./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-40.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc8129dbd625890f0a6c6fb8220f750f06e74365510b0e3af1c906da415c9ec4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:44:42,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:44:42,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:44:42,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:44:42,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:44:42,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:44:42,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:44:42,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:44:42,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:44:42,909 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:44:42,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:44:42,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:44:42,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:44:42,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:44:42,911 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:44:42,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:44:42,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:44:42,912 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:44:42,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:44:42,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:44:42,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:44:42,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:44:42,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:44:42,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:44:42,915 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:44:42,916 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:44:42,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:44:42,916 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:44:42,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:44:42,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:44:42,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:44:42,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:44:42,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:44:42,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:44:42,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:44:42,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:44:42,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:44:42,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:44:42,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:44:42,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:44:42,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:44:42,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:44:42,921 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bc8129dbd625890f0a6c6fb8220f750f06e74365510b0e3af1c906da415c9ec4 [2024-10-11 08:44:43,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:44:43,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:44:43,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:44:43,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:44:43,183 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:44:43,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-40.i [2024-10-11 08:44:44,624 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:44:44,823 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:44:44,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-40.i [2024-10-11 08:44:44,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8bc7d0940/a839117a93f74aff8a2d1726cae16cbc/FLAGdba59a7f0 [2024-10-11 08:44:44,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8bc7d0940/a839117a93f74aff8a2d1726cae16cbc [2024-10-11 08:44:44,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:44:44,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:44:44,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:44:44,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:44:44,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:44:44,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:44:44" (1/1) ... [2024-10-11 08:44:44,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87283f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:44:44, skipping insertion in model container [2024-10-11 08:44:44,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:44:44" (1/1) ... [2024-10-11 08:44:44,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:44:45,059 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-40.i[915,928] [2024-10-11 08:44:45,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:44:45,141 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:44:45,152 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-40.i[915,928] [2024-10-11 08:44:45,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:44:45,213 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:44:45,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:44:45 WrapperNode [2024-10-11 08:44:45,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:44:45,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:44:45,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:44:45,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:44:45,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:44:45" (1/1) ... [2024-10-11 08:44:45,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:44:45" (1/1) ... [2024-10-11 08:44:45,276 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-10-11 08:44:45,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:44:45,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:44:45,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:44:45,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:44:45,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:44:45" (1/1) ... [2024-10-11 08:44:45,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:44:45" (1/1) ... [2024-10-11 08:44:45,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:44:45" (1/1) ... [2024-10-11 08:44:45,342 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 08:44:45,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:44:45" (1/1) ... [2024-10-11 08:44:45,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:44:45" (1/1) ... [2024-10-11 08:44:45,355 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:44:45" (1/1) ... [2024-10-11 08:44:45,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:44:45" (1/1) ... [2024-10-11 08:44:45,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:44:45" (1/1) ... [2024-10-11 08:44:45,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:44:45" (1/1) ... [2024-10-11 08:44:45,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:44:45,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:44:45,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:44:45,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:44:45,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:44:45" (1/1) ... [2024-10-11 08:44:45,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:44:45,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:44:45,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:44:45,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:44:45,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:44:45,513 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:44:45,514 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:44:45,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:44:45,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:44:45,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:44:45,621 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:44:45,623 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:44:46,041 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 08:44:46,042 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:44:46,096 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:44:46,097 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:44:46,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:44:46 BoogieIcfgContainer [2024-10-11 08:44:46,097 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:44:46,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:44:46,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:44:46,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:44:46,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:44:44" (1/3) ... [2024-10-11 08:44:46,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f4f6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:44:46, skipping insertion in model container [2024-10-11 08:44:46,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:44:45" (2/3) ... [2024-10-11 08:44:46,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f4f6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:44:46, skipping insertion in model container [2024-10-11 08:44:46,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:44:46" (3/3) ... [2024-10-11 08:44:46,107 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-40.i [2024-10-11 08:44:46,122 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:44:46,122 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:44:46,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:44:46,192 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@228fa761, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:44:46,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:44:46,197 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 08:44:46,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 08:44:46,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:44:46,213 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:44:46,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:44:46,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:44:46,218 INFO L85 PathProgramCache]: Analyzing trace with hash -249484361, now seen corresponding path program 1 times [2024-10-11 08:44:46,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:44:46,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213378117] [2024-10-11 08:44:46,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:46,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:44:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:44:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:44:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:44:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:44:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:44:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:44:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:44:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:44:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:44:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:44:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 08:44:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:44:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:44:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:44:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:44:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:44:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:44:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:44:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:44:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:44:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:44:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:44:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:44:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:44:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:44:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:44:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:44:46,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:44:46,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213378117] [2024-10-11 08:44:46,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213378117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:44:46,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:44:46,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:44:46,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965473303] [2024-10-11 08:44:46,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:44:46,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:44:46,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:44:46,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:44:46,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:44:46,778 INFO L87 Difference]: Start difference. First operand has 80 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:46,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:44:46,833 INFO L93 Difference]: Finished difference Result 157 states and 280 transitions. [2024-10-11 08:44:46,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:44:46,836 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-10-11 08:44:46,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:44:46,848 INFO L225 Difference]: With dead ends: 157 [2024-10-11 08:44:46,848 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 08:44:46,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:44:46,858 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:44:46,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:44:46,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 08:44:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 08:44:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 08:44:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 122 transitions. [2024-10-11 08:44:46,944 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 122 transitions. Word has length 169 [2024-10-11 08:44:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:44:46,948 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 122 transitions. [2024-10-11 08:44:46,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 122 transitions. [2024-10-11 08:44:46,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 08:44:46,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:44:46,959 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:44:46,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:44:46,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:44:46,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:44:46,976 INFO L85 PathProgramCache]: Analyzing trace with hash 697551206, now seen corresponding path program 1 times [2024-10-11 08:44:46,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:44:46,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35906201] [2024-10-11 08:44:46,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:46,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:44:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:44:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:44:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:44:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:44:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:44:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:44:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:44:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:44:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:44:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:44:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 08:44:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:44:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:44:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:44:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:44:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:44:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:44:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:44:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:44:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:44:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:44:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:44:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:44:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:44:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:44:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:44:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:44:47,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:44:47,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35906201] [2024-10-11 08:44:47,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35906201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:44:47,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:44:47,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:44:47,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086137225] [2024-10-11 08:44:47,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:44:47,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:44:47,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:44:47,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:44:47,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:44:47,617 INFO L87 Difference]: Start difference. First operand 78 states and 122 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:44:47,809 INFO L93 Difference]: Finished difference Result 232 states and 364 transitions. [2024-10-11 08:44:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:44:47,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-10-11 08:44:47,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:44:47,817 INFO L225 Difference]: With dead ends: 232 [2024-10-11 08:44:47,817 INFO L226 Difference]: Without dead ends: 155 [2024-10-11 08:44:47,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:44:47,819 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 190 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:44:47,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 288 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:44:47,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-11 08:44:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2024-10-11 08:44:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 08:44:47,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 241 transitions. [2024-10-11 08:44:47,913 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 241 transitions. Word has length 170 [2024-10-11 08:44:47,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:44:47,913 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 241 transitions. [2024-10-11 08:44:47,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 241 transitions. [2024-10-11 08:44:47,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 08:44:47,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:44:47,922 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:44:47,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:44:47,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:44:47,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:44:47,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1296593500, now seen corresponding path program 1 times [2024-10-11 08:44:47,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:44:47,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601802131] [2024-10-11 08:44:47,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:47,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:44:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:44:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:44:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:44:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:44:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:44:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:44:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:44:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:44:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:44:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:44:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 08:44:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:44:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:44:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:44:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:44:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:44:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:44:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:44:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:44:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:44:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:44:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:44:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:44:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:44:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:44:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:44:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:44:48,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:44:48,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601802131] [2024-10-11 08:44:48,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601802131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:44:48,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:44:48,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:44:48,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180201874] [2024-10-11 08:44:48,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:44:48,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:44:48,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:44:48,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:44:48,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:44:48,082 INFO L87 Difference]: Start difference. First operand 153 states and 241 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:44:48,153 INFO L93 Difference]: Finished difference Result 376 states and 593 transitions. [2024-10-11 08:44:48,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:44:48,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-10-11 08:44:48,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:44:48,156 INFO L225 Difference]: With dead ends: 376 [2024-10-11 08:44:48,156 INFO L226 Difference]: Without dead ends: 224 [2024-10-11 08:44:48,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:44:48,159 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 90 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:44:48,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 303 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:44:48,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-11 08:44:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 213. [2024-10-11 08:44:48,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 139 states have (on average 1.4028776978417266) internal successors, (195), 140 states have internal predecessors, (195), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 08:44:48,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 335 transitions. [2024-10-11 08:44:48,193 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 335 transitions. Word has length 170 [2024-10-11 08:44:48,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:44:48,194 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 335 transitions. [2024-10-11 08:44:48,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:48,194 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 335 transitions. [2024-10-11 08:44:48,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 08:44:48,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:44:48,197 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:44:48,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:44:48,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:44:48,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:44:48,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1430607006, now seen corresponding path program 1 times [2024-10-11 08:44:48,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:44:48,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376766835] [2024-10-11 08:44:48,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:48,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:44:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:44:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:44:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:44:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:44:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:44:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:44:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:44:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:44:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:44:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:44:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 08:44:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:44:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:44:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:44:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:44:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:44:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:44:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:44:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:44:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:44:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:44:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:44:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:44:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:44:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:44:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:44:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:44:48,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:44:48,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376766835] [2024-10-11 08:44:48,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376766835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:44:48,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:44:48,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:44:48,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983328811] [2024-10-11 08:44:48,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:44:48,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:44:48,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:44:48,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:44:48,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:44:48,477 INFO L87 Difference]: Start difference. First operand 213 states and 335 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:44:48,534 INFO L93 Difference]: Finished difference Result 510 states and 804 transitions. [2024-10-11 08:44:48,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:44:48,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-10-11 08:44:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:44:48,541 INFO L225 Difference]: With dead ends: 510 [2024-10-11 08:44:48,543 INFO L226 Difference]: Without dead ends: 298 [2024-10-11 08:44:48,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:44:48,548 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 70 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:44:48,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 259 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:44:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-11 08:44:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 288. [2024-10-11 08:44:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 187 states have (on average 1.4010695187165776) internal successors, (262), 188 states have internal predecessors, (262), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 08:44:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 454 transitions. [2024-10-11 08:44:48,601 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 454 transitions. Word has length 170 [2024-10-11 08:44:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:44:48,602 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 454 transitions. [2024-10-11 08:44:48,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:48,602 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 454 transitions. [2024-10-11 08:44:48,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 08:44:48,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:44:48,604 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:44:48,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 08:44:48,604 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:44:48,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:44:48,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1417746011, now seen corresponding path program 1 times [2024-10-11 08:44:48,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:44:48,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670494796] [2024-10-11 08:44:48,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:48,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:44:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:44:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:44:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:44:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:44:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:44:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:44:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:44:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:44:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:44:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:44:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 08:44:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:44:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:44:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:44:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:44:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:44:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:44:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:44:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:44:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:44:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:44:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:44:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:44:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:44:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:44:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:44:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:44:48,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:44:48,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670494796] [2024-10-11 08:44:48,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670494796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:44:48,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:44:48,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:44:48,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244559572] [2024-10-11 08:44:48,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:44:48,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:44:48,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:44:48,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:44:48,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:44:48,806 INFO L87 Difference]: Start difference. First operand 288 states and 454 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:48,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:44:48,872 INFO L93 Difference]: Finished difference Result 712 states and 1121 transitions. [2024-10-11 08:44:48,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:44:48,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-10-11 08:44:48,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:44:48,879 INFO L225 Difference]: With dead ends: 712 [2024-10-11 08:44:48,879 INFO L226 Difference]: Without dead ends: 425 [2024-10-11 08:44:48,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:44:48,883 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 69 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:44:48,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 257 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:44:48,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-11 08:44:48,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 423. [2024-10-11 08:44:48,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 276 states have (on average 1.391304347826087) internal successors, (384), 278 states have internal predecessors, (384), 140 states have call successors, (140), 6 states have call predecessors, (140), 6 states have return successors, (140), 138 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-11 08:44:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 664 transitions. [2024-10-11 08:44:48,973 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 664 transitions. Word has length 171 [2024-10-11 08:44:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:44:48,973 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 664 transitions. [2024-10-11 08:44:48,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 664 transitions. [2024-10-11 08:44:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 08:44:48,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:44:48,976 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:44:48,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 08:44:48,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:44:48,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:44:48,977 INFO L85 PathProgramCache]: Analyzing trace with hash 699162883, now seen corresponding path program 1 times [2024-10-11 08:44:48,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:44:48,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192938373] [2024-10-11 08:44:48,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:48,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:44:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:44:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:44:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:44:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:44:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:44:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:44:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:44:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:44:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:44:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:44:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 08:44:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:44:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:44:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:44:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:44:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:44:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:44:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:44:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:44:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:44:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:44:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:44:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:44:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:44:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:44:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:44:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:44:49,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:44:49,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192938373] [2024-10-11 08:44:49,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192938373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:44:49,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:44:49,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:44:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428984787] [2024-10-11 08:44:49,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:44:49,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:44:49,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:44:49,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:44:49,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:44:49,188 INFO L87 Difference]: Start difference. First operand 423 states and 664 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:44:49,232 INFO L93 Difference]: Finished difference Result 845 states and 1327 transitions. [2024-10-11 08:44:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:44:49,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-10-11 08:44:49,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:44:49,237 INFO L225 Difference]: With dead ends: 845 [2024-10-11 08:44:49,237 INFO L226 Difference]: Without dead ends: 423 [2024-10-11 08:44:49,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:44:49,241 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:44:49,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:44:49,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-10-11 08:44:49,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2024-10-11 08:44:49,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 276 states have (on average 1.3695652173913044) internal successors, (378), 278 states have internal predecessors, (378), 140 states have call successors, (140), 6 states have call predecessors, (140), 6 states have return successors, (140), 138 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-11 08:44:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 658 transitions. [2024-10-11 08:44:49,295 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 658 transitions. Word has length 171 [2024-10-11 08:44:49,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:44:49,296 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 658 transitions. [2024-10-11 08:44:49,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 658 transitions. [2024-10-11 08:44:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 08:44:49,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:44:49,298 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:44:49,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 08:44:49,298 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:44:49,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:44:49,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1820797051, now seen corresponding path program 1 times [2024-10-11 08:44:49,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:44:49,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881613937] [2024-10-11 08:44:49,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:49,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:44:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:44:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:44:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:44:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:44:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:44:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:44:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:44:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:44:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:44:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:44:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 08:44:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:44:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:44:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:44:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:44:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:44:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:44:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:44:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:44:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:44:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:44:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:44:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:44:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:44:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:44:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:44:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:44:49,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:44:49,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881613937] [2024-10-11 08:44:49,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881613937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:44:49,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:44:49,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:44:49,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326514504] [2024-10-11 08:44:49,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:44:49,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:44:49,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:44:49,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:44:49,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:44:49,697 INFO L87 Difference]: Start difference. First operand 423 states and 658 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:49,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:44:49,966 INFO L93 Difference]: Finished difference Result 704 states and 1094 transitions. [2024-10-11 08:44:49,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:44:49,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-10-11 08:44:49,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:44:49,973 INFO L225 Difference]: With dead ends: 704 [2024-10-11 08:44:49,973 INFO L226 Difference]: Without dead ends: 492 [2024-10-11 08:44:49,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:44:49,975 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 148 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:44:49,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 460 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:44:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-10-11 08:44:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 469. [2024-10-11 08:44:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 309 states have (on average 1.372168284789644) internal successors, (424), 312 states have internal predecessors, (424), 152 states have call successors, (152), 7 states have call predecessors, (152), 7 states have return successors, (152), 149 states have call predecessors, (152), 152 states have call successors, (152) [2024-10-11 08:44:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 728 transitions. [2024-10-11 08:44:50,032 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 728 transitions. Word has length 171 [2024-10-11 08:44:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:44:50,032 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 728 transitions. [2024-10-11 08:44:50,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 728 transitions. [2024-10-11 08:44:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 08:44:50,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:44:50,035 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:44:50,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 08:44:50,035 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:44:50,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:44:50,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1453101891, now seen corresponding path program 1 times [2024-10-11 08:44:50,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:44:50,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049568137] [2024-10-11 08:44:50,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:50,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:44:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:44:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:44:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:44:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:44:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:44:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:44:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:44:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:44:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:44:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:44:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 08:44:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:44:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:44:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:44:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:44:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:44:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:44:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:44:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:44:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:44:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:44:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:44:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:44:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:44:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:44:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:44:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:44:50,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:44:50,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049568137] [2024-10-11 08:44:50,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049568137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:44:50,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:44:50,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:44:50,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567232880] [2024-10-11 08:44:50,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:44:50,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:44:50,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:44:50,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:44:50,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:44:50,369 INFO L87 Difference]: Start difference. First operand 469 states and 728 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:44:50,648 INFO L93 Difference]: Finished difference Result 751 states and 1165 transitions. [2024-10-11 08:44:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:44:50,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-10-11 08:44:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:44:50,653 INFO L225 Difference]: With dead ends: 751 [2024-10-11 08:44:50,653 INFO L226 Difference]: Without dead ends: 492 [2024-10-11 08:44:50,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 08:44:50,655 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 169 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:44:50,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 487 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:44:50,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-10-11 08:44:50,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 469. [2024-10-11 08:44:50,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 309 states have (on average 1.3689320388349515) internal successors, (423), 312 states have internal predecessors, (423), 152 states have call successors, (152), 7 states have call predecessors, (152), 7 states have return successors, (152), 149 states have call predecessors, (152), 152 states have call successors, (152) [2024-10-11 08:44:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 727 transitions. [2024-10-11 08:44:50,712 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 727 transitions. Word has length 171 [2024-10-11 08:44:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:44:50,712 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 727 transitions. [2024-10-11 08:44:50,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 727 transitions. [2024-10-11 08:44:50,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 08:44:50,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:44:50,715 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:44:50,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 08:44:50,715 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:44:50,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:44:50,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2034127466, now seen corresponding path program 1 times [2024-10-11 08:44:50,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:44:50,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917457554] [2024-10-11 08:44:50,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:50,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:44:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:44:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:44:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:44:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:44:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:44:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:44:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:44:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:44:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:44:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:44:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 08:44:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:44:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:44:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:44:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:44:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:44:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:44:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:44:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:44:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:44:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:44:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:44:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:44:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:44:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:44:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:44:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:44:51,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:44:51,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917457554] [2024-10-11 08:44:51,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917457554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:44:51,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:44:51,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:44:51,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469578347] [2024-10-11 08:44:51,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:44:51,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:44:51,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:44:51,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:44:51,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:44:51,079 INFO L87 Difference]: Start difference. First operand 469 states and 727 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:44:51,246 INFO L93 Difference]: Finished difference Result 824 states and 1270 transitions. [2024-10-11 08:44:51,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:44:51,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-10-11 08:44:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:44:51,251 INFO L225 Difference]: With dead ends: 824 [2024-10-11 08:44:51,251 INFO L226 Difference]: Without dead ends: 565 [2024-10-11 08:44:51,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 08:44:51,253 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 110 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:44:51,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 372 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:44:51,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-10-11 08:44:51,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 560. [2024-10-11 08:44:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 374 states have (on average 1.3636363636363635) internal successors, (510), 379 states have internal predecessors, (510), 176 states have call successors, (176), 9 states have call predecessors, (176), 9 states have return successors, (176), 171 states have call predecessors, (176), 176 states have call successors, (176) [2024-10-11 08:44:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 862 transitions. [2024-10-11 08:44:51,313 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 862 transitions. Word has length 172 [2024-10-11 08:44:51,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:44:51,313 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 862 transitions. [2024-10-11 08:44:51,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 862 transitions. [2024-10-11 08:44:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 08:44:51,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:44:51,316 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:44:51,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 08:44:51,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:44:51,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:44:51,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1013059112, now seen corresponding path program 1 times [2024-10-11 08:44:51,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:44:51,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899185809] [2024-10-11 08:44:51,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:51,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:44:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:44:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:44:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:44:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:44:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:44:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:44:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:44:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:44:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:44:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:44:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 08:44:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:44:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:44:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:44:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:44:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:44:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:44:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:44:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:44:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:44:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:44:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:44:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:44:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:44:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:44:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:44:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:44:51,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:44:51,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899185809] [2024-10-11 08:44:51,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899185809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:44:51,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:44:51,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:44:51,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805065723] [2024-10-11 08:44:51,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:44:51,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:44:51,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:44:51,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:44:51,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:44:51,637 INFO L87 Difference]: Start difference. First operand 560 states and 862 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:51,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:44:51,849 INFO L93 Difference]: Finished difference Result 841 states and 1282 transitions. [2024-10-11 08:44:51,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:44:51,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-10-11 08:44:51,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:44:51,855 INFO L225 Difference]: With dead ends: 841 [2024-10-11 08:44:51,855 INFO L226 Difference]: Without dead ends: 610 [2024-10-11 08:44:51,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 08:44:51,857 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 131 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:44:51,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 559 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:44:51,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-10-11 08:44:51,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 561. [2024-10-11 08:44:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 375 states have (on average 1.36) internal successors, (510), 380 states have internal predecessors, (510), 176 states have call successors, (176), 9 states have call predecessors, (176), 9 states have return successors, (176), 171 states have call predecessors, (176), 176 states have call successors, (176) [2024-10-11 08:44:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 862 transitions. [2024-10-11 08:44:51,914 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 862 transitions. Word has length 172 [2024-10-11 08:44:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:44:51,915 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 862 transitions. [2024-10-11 08:44:51,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 862 transitions. [2024-10-11 08:44:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 08:44:51,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:44:51,917 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:44:51,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 08:44:51,918 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:44:51,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:44:51,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1027481141, now seen corresponding path program 1 times [2024-10-11 08:44:51,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:44:51,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382048108] [2024-10-11 08:44:51,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:51,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:44:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:44:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:44:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:44:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:44:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:44:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:44:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:44:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:44:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:44:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:44:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 08:44:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:44:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:44:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:44:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:44:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:44:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:44:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:44:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:44:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:44:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:44:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:44:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:44:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:44:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:44:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:44:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:44:52,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:44:52,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382048108] [2024-10-11 08:44:52,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382048108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:44:52,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:44:52,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:44:52,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524981670] [2024-10-11 08:44:52,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:44:52,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:44:52,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:44:52,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:44:52,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:44:52,401 INFO L87 Difference]: Start difference. First operand 561 states and 862 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:44:52,871 INFO L93 Difference]: Finished difference Result 1620 states and 2435 transitions. [2024-10-11 08:44:52,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:44:52,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-10-11 08:44:52,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:44:52,911 INFO L225 Difference]: With dead ends: 1620 [2024-10-11 08:44:52,911 INFO L226 Difference]: Without dead ends: 1060 [2024-10-11 08:44:52,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:44:52,914 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 85 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:44:52,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 415 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:44:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-10-11 08:44:53,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 840. [2024-10-11 08:44:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 564 states have (on average 1.3191489361702127) internal successors, (744), 578 states have internal predecessors, (744), 257 states have call successors, (257), 18 states have call predecessors, (257), 18 states have return successors, (257), 243 states have call predecessors, (257), 257 states have call successors, (257) [2024-10-11 08:44:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1258 transitions. [2024-10-11 08:44:53,047 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1258 transitions. Word has length 172 [2024-10-11 08:44:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:44:53,048 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 1258 transitions. [2024-10-11 08:44:53,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:44:53,049 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1258 transitions. [2024-10-11 08:44:53,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 08:44:53,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:44:53,050 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:44:53,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 08:44:53,051 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:44:53,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:44:53,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1027421559, now seen corresponding path program 1 times [2024-10-11 08:44:53,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:44:53,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380720339] [2024-10-11 08:44:53,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:53,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:44:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:44:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:44:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:44:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:44:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:44:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:44:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:44:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:44:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:44:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:44:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 08:44:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:44:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:44:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:44:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:44:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:44:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:44:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:44:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:44:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:44:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:44:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:44:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:44:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:44:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:44:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:44:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-11 08:44:53,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:44:53,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380720339] [2024-10-11 08:44:53,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380720339] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:44:53,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283000604] [2024-10-11 08:44:53,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:53,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:44:53,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:44:53,408 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:44:53,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 08:44:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:44:53,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 08:44:53,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:44:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 585 proven. 51 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2024-10-11 08:44:53,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:44:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-11 08:44:54,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283000604] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:44:54,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:44:54,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 08:44:54,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183668305] [2024-10-11 08:44:54,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:44:54,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 08:44:54,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:44:54,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 08:44:54,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:44:54,193 INFO L87 Difference]: Start difference. First operand 840 states and 1258 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-11 08:44:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:44:54,558 INFO L93 Difference]: Finished difference Result 1517 states and 2200 transitions. [2024-10-11 08:44:54,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 08:44:54,560 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 172 [2024-10-11 08:44:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:44:54,565 INFO L225 Difference]: With dead ends: 1517 [2024-10-11 08:44:54,566 INFO L226 Difference]: Without dead ends: 678 [2024-10-11 08:44:54,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 391 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 08:44:54,569 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 71 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:44:54,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 193 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:44:54,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-10-11 08:44:54,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 624. [2024-10-11 08:44:54,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 420 states have (on average 1.2357142857142858) internal successors, (519), 425 states have internal predecessors, (519), 176 states have call successors, (176), 27 states have call predecessors, (176), 27 states have return successors, (176), 171 states have call predecessors, (176), 176 states have call successors, (176) [2024-10-11 08:44:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 871 transitions. [2024-10-11 08:44:54,742 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 871 transitions. Word has length 172 [2024-10-11 08:44:54,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:44:54,742 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 871 transitions. [2024-10-11 08:44:54,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-11 08:44:54,743 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 871 transitions. [2024-10-11 08:44:54,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 08:44:54,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:44:54,745 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:44:54,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 08:44:54,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 08:44:54,946 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:44:54,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:44:54,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1420448569, now seen corresponding path program 1 times [2024-10-11 08:44:54,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:44:54,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916022307] [2024-10-11 08:44:54,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:54,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:44:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:44:55,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [631811631] [2024-10-11 08:44:55,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:44:55,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:44:55,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:44:55,051 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:44:55,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 08:44:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:44:55,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:44:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:44:55,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:44:55,493 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:44:55,494 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:44:55,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 08:44:55,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:44:55,700 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:44:55,844 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:44:55,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:44:55 BoogieIcfgContainer [2024-10-11 08:44:55,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:44:55,849 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:44:55,849 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:44:55,849 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:44:55,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:44:46" (3/4) ... [2024-10-11 08:44:55,853 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:44:55,854 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:44:55,855 INFO L158 Benchmark]: Toolchain (without parser) took 10998.60ms. Allocated memory was 155.2MB in the beginning and 427.8MB in the end (delta: 272.6MB). Free memory was 85.2MB in the beginning and 295.3MB in the end (delta: -210.2MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. [2024-10-11 08:44:55,855 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 106.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:44:55,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.64ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 67.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 08:44:55,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.67ms. Allocated memory is still 155.2MB. Free memory was 67.6MB in the beginning and 63.0MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:44:55,855 INFO L158 Benchmark]: Boogie Preprocessor took 103.96ms. Allocated memory is still 155.2MB. Free memory was 63.0MB in the beginning and 122.7MB in the end (delta: -59.7MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-10-11 08:44:55,857 INFO L158 Benchmark]: RCFGBuilder took 715.24ms. Allocated memory was 155.2MB in the beginning and 220.2MB in the end (delta: 65.0MB). Free memory was 122.6MB in the beginning and 157.0MB in the end (delta: -34.5MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2024-10-11 08:44:55,857 INFO L158 Benchmark]: TraceAbstraction took 9748.53ms. Allocated memory was 220.2MB in the beginning and 427.8MB in the end (delta: 207.6MB). Free memory was 156.0MB in the beginning and 295.3MB in the end (delta: -139.3MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2024-10-11 08:44:55,857 INFO L158 Benchmark]: Witness Printer took 5.33ms. Allocated memory is still 427.8MB. Free memory is still 295.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:44:55,859 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 106.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.64ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 67.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.67ms. Allocated memory is still 155.2MB. Free memory was 67.6MB in the beginning and 63.0MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.96ms. Allocated memory is still 155.2MB. Free memory was 63.0MB in the beginning and 122.7MB in the end (delta: -59.7MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * RCFGBuilder took 715.24ms. Allocated memory was 155.2MB in the beginning and 220.2MB in the end (delta: 65.0MB). Free memory was 122.6MB in the beginning and 157.0MB in the end (delta: -34.5MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9748.53ms. Allocated memory was 220.2MB in the beginning and 427.8MB in the end (delta: 207.6MB). Free memory was 156.0MB in the beginning and 295.3MB in the end (delta: -139.3MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. * Witness Printer took 5.33ms. Allocated memory is still 427.8MB. Free memory is still 295.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of bitwiseOr at line 86, overapproximation of someUnaryDOUBLEoperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 178. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] unsigned char var_1_31 = 0; [L42] unsigned char var_1_32 = 0; [L43] unsigned char var_1_33 = 8; [L44] unsigned long int var_1_34 = 50; [L45] double var_1_35 = 31.1; [L46] double var_1_36 = 127.4; [L47] unsigned long int var_1_37 = 64; [L48] signed long int var_1_38 = 8; [L49] float var_1_39 = 200.6; [L50] unsigned short int var_1_40 = 2; [L51] signed char var_1_42 = -4; [L52] double var_1_43 = 2.75; [L53] double var_1_44 = 7.6; [L54] signed char var_1_45 = 32; [L55] unsigned long int var_1_46 = 32; [L56] signed long int var_1_47 = -256; [L57] unsigned char last_1_var_1_9 = 1; [L58] float last_1_var_1_24 = 128.5; [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L174] last_1_var_1_9 = var_1_9 [L175] last_1_var_1_24 = var_1_24 [L185] RET updateLastVariables() [L186] CALL updateVariables() [L132] var_1_4 = __VERIFIER_nondet_short() [L133] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L133] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L134] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L134] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L135] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L136] var_1_8 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_9=1] [L137] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L139] var_1_10 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L140] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L142] var_1_11 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L145] var_1_15 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L148] var_1_20 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L150] var_1_28 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L151] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L152] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L153] var_1_29 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L154] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L155] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L155] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L156] var_1_31 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L157] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L158] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L158] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L159] var_1_32 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L160] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L161] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L161] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L162] var_1_33 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L163] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L164] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L164] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L165] var_1_36 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L166] RET assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L167] var_1_39 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L168] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_39 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L169] RET assume_abort_if_not(var_1_39 != 0.0F) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L170] var_1_44 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L171] RET assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L186] RET updateVariables() [L187] CALL step() [L62] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L63] COND TRUE var_1_31 && var_1_32 [L64] var_1_30 = (((((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))) < 0 ) ? -((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))) : ((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L66] COND FALSE !(var_1_28 > var_1_30) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L71] var_1_35 = var_1_36 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L72] COND FALSE !((var_1_31 && var_1_32) && (var_1_30 > var_1_34)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L75] COND FALSE !((((((var_1_36 / var_1_39)) > (var_1_35)) ? ((var_1_36 / var_1_39)) : (var_1_35))) > 100.3) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L80] COND TRUE var_1_27 > ((var_1_29 >> 1) + var_1_37) [L81] var_1_40 = (((((var_1_33) < 0 ) ? -(var_1_33) : (var_1_33))) + ((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29)))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L83] COND TRUE var_1_32 || var_1_31 [L84] var_1_42 = 1 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L86] EXPR var_1_42 | var_1_38 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L86] COND TRUE var_1_28 > (var_1_42 | var_1_38) [L87] var_1_43 = ((((var_1_36) > ((((((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) < 0 ) ? -((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) : ((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))))))) ? (var_1_36) : ((((((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) < 0 ) ? -((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) : ((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44)))))))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L89] var_1_45 = var_1_28 [L90] var_1_46 = var_1_33 [L91] var_1_47 = var_1_30 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=1, var_1_8=0, var_1_9=1] [L92] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L99] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=1, var_1_8=0, var_1_9=1] [L101] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=1, var_1_8=0, var_1_9=1] [L102] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L103] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=1, var_1_8=0, var_1_9=0] [L105] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=0, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=1, var_1_8=0, var_1_9=0] [L106] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L109] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=1, var_1_8=0, var_1_9=0] [L111] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=1, var_1_8=0, var_1_9=0] [L112] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=1, var_1_8=0, var_1_9=0] [L115] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=1, var_1_8=0, var_1_9=0] [L119] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L120] var_1_25 = var_1_20 [L121] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=0, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=0, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=0, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=1, var_1_8=0, var_1_9=0] [L122] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L123] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=0, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=1, var_1_8=0, var_1_9=0] [L127] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=0, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=1, var_1_8=0, var_1_9=0] [L187] RET step() [L188] CALL, EXPR property() [L178-L179] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=0, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=0, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=-206, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=60, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 13, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1140 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1133 mSDsluCounter, 3943 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2118 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 910 IncrementalHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 1825 mSDtfsCounter, 910 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1028 GetRequests, 988 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=840occurred in iteration=11, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 399 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2567 NumberOfCodeBlocks, 2567 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2381 ConstructedInterpolants, 0 QuantifiedInterpolants, 5147 SizeOfPredicates, 2 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 18047/18200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 08:44:55,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-40.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc8129dbd625890f0a6c6fb8220f750f06e74365510b0e3af1c906da415c9ec4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:44:58,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:44:58,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:44:58,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:44:58,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:44:58,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:44:58,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:44:58,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:44:58,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:44:58,323 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:44:58,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:44:58,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:44:58,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:44:58,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:44:58,327 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:44:58,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:44:58,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:44:58,328 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:44:58,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:44:58,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:44:58,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:44:58,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:44:58,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:44:58,333 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:44:58,333 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:44:58,333 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:44:58,334 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:44:58,334 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:44:58,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:44:58,334 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:44:58,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:44:58,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:44:58,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:44:58,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:44:58,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:44:58,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:44:58,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:44:58,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:44:58,337 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:44:58,337 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:44:58,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:44:58,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:44:58,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:44:58,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:44:58,339 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:44:58,339 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bc8129dbd625890f0a6c6fb8220f750f06e74365510b0e3af1c906da415c9ec4 [2024-10-11 08:44:58,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:44:58,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:44:58,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:44:58,687 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:44:58,687 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:44:58,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-40.i [2024-10-11 08:45:00,394 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:45:00,662 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:45:00,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-40.i [2024-10-11 08:45:00,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/655b5d386/1a28eacb3b5f42ae8450869415282d52/FLAG4edc01a9a [2024-10-11 08:45:00,701 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/655b5d386/1a28eacb3b5f42ae8450869415282d52 [2024-10-11 08:45:00,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:45:00,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:45:00,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:45:00,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:45:00,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:45:00,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:45:00" (1/1) ... [2024-10-11 08:45:00,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d54a08b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:00, skipping insertion in model container [2024-10-11 08:45:00,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:45:00" (1/1) ... [2024-10-11 08:45:00,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:45:00,955 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-40.i[915,928] [2024-10-11 08:45:01,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:45:01,053 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:45:01,075 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-40.i[915,928] [2024-10-11 08:45:01,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:45:01,143 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:45:01,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:01 WrapperNode [2024-10-11 08:45:01,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:45:01,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:45:01,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:45:01,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:45:01,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:01" (1/1) ... [2024-10-11 08:45:01,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:01" (1/1) ... [2024-10-11 08:45:01,198 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-10-11 08:45:01,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:45:01,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:45:01,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:45:01,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:45:01,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:01" (1/1) ... [2024-10-11 08:45:01,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:01" (1/1) ... [2024-10-11 08:45:01,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:01" (1/1) ... [2024-10-11 08:45:01,255 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 08:45:01,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:01" (1/1) ... [2024-10-11 08:45:01,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:01" (1/1) ... [2024-10-11 08:45:01,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:01" (1/1) ... [2024-10-11 08:45:01,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:01" (1/1) ... [2024-10-11 08:45:01,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:01" (1/1) ... [2024-10-11 08:45:01,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:01" (1/1) ... [2024-10-11 08:45:01,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:45:01,315 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:45:01,315 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:45:01,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:45:01,323 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:01" (1/1) ... [2024-10-11 08:45:01,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:45:01,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:45:01,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:45:01,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:45:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:45:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:45:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:45:01,416 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:45:01,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:45:01,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:45:01,504 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:45:01,506 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:45:10,955 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 08:45:10,955 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:45:11,020 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:45:11,020 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:45:11,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:45:11 BoogieIcfgContainer [2024-10-11 08:45:11,023 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:45:11,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:45:11,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:45:11,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:45:11,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:45:00" (1/3) ... [2024-10-11 08:45:11,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428a4ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:45:11, skipping insertion in model container [2024-10-11 08:45:11,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:01" (2/3) ... [2024-10-11 08:45:11,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428a4ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:45:11, skipping insertion in model container [2024-10-11 08:45:11,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:45:11" (3/3) ... [2024-10-11 08:45:11,034 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-40.i [2024-10-11 08:45:11,048 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:45:11,049 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:45:11,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:45:11,122 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@33d272f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:45:11,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:45:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 08:45:11,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 08:45:11,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:45:11,140 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:45:11,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:45:11,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:45:11,145 INFO L85 PathProgramCache]: Analyzing trace with hash -733217589, now seen corresponding path program 1 times [2024-10-11 08:45:11,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:45:11,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852481747] [2024-10-11 08:45:11,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:45:11,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:45:11,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:45:11,160 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:45:11,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 08:45:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:45:12,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:45:12,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:45:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2024-10-11 08:45:12,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:45:12,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:45:12,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852481747] [2024-10-11 08:45:12,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852481747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:45:12,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:45:12,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:45:12,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768965368] [2024-10-11 08:45:12,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:45:12,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:45:12,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:45:12,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:45:12,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:45:12,142 INFO L87 Difference]: Start difference. First operand has 77 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 08:45:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:45:12,351 INFO L93 Difference]: Finished difference Result 151 states and 270 transitions. [2024-10-11 08:45:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:45:12,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2024-10-11 08:45:12,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:45:12,370 INFO L225 Difference]: With dead ends: 151 [2024-10-11 08:45:12,371 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 08:45:12,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:45:12,377 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:45:12,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:45:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 08:45:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-11 08:45:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 08:45:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2024-10-11 08:45:12,430 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 168 [2024-10-11 08:45:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:45:12,430 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2024-10-11 08:45:12,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 08:45:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2024-10-11 08:45:12,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 08:45:12,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:45:12,437 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:45:12,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 08:45:12,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:45:12,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:45:12,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:45:12,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1943206582, now seen corresponding path program 1 times [2024-10-11 08:45:12,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:45:12,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450515670] [2024-10-11 08:45:12,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:45:12,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:45:12,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:45:12,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:45:12,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 08:45:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:45:13,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 08:45:13,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:45:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 585 proven. 51 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2024-10-11 08:45:16,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:45:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-11 08:45:19,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:45:19,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450515670] [2024-10-11 08:45:19,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450515670] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:45:19,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 08:45:19,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-11 08:45:19,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075679403] [2024-10-11 08:45:19,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 08:45:19,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 08:45:19,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:45:19,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 08:45:19,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:45:19,552 INFO L87 Difference]: Start difference. First operand 75 states and 117 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-11 08:45:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:45:24,447 INFO L93 Difference]: Finished difference Result 235 states and 355 transitions. [2024-10-11 08:45:24,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 08:45:24,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 169 [2024-10-11 08:45:24,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:45:24,452 INFO L225 Difference]: With dead ends: 235 [2024-10-11 08:45:24,453 INFO L226 Difference]: Without dead ends: 161 [2024-10-11 08:45:24,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 330 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-11 08:45:24,456 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 171 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 08:45:24,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 391 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 08:45:24,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-11 08:45:24,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 77. [2024-10-11 08:45:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 08:45:24,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2024-10-11 08:45:24,490 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 169 [2024-10-11 08:45:24,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:45:24,493 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2024-10-11 08:45:24,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-11 08:45:24,494 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2024-10-11 08:45:24,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 08:45:24,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:45:24,499 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:45:24,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 08:45:24,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:45:24,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:45:24,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:45:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1958733704, now seen corresponding path program 1 times [2024-10-11 08:45:24,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:45:24,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256051968] [2024-10-11 08:45:24,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:45:24,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:45:24,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:45:24,706 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:45:24,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 08:45:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:45:25,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 08:45:25,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:45:25,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:45:25,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:45:25,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:45:25,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256051968] [2024-10-11 08:45:25,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256051968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:45:25,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:45:25,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:45:25,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856061141] [2024-10-11 08:45:25,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:45:25,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:45:25,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:45:25,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:45:25,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:45:25,719 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:45:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:45:26,021 INFO L93 Difference]: Finished difference Result 153 states and 227 transitions. [2024-10-11 08:45:26,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:45:26,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-10-11 08:45:26,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:45:26,041 INFO L225 Difference]: With dead ends: 153 [2024-10-11 08:45:26,041 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 08:45:26,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:45:26,047 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:45:26,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:45:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 08:45:26,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 08:45:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 08:45:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 113 transitions. [2024-10-11 08:45:26,075 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 113 transitions. Word has length 169 [2024-10-11 08:45:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:45:26,076 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 113 transitions. [2024-10-11 08:45:26,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:45:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 113 transitions. [2024-10-11 08:45:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 08:45:26,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:45:26,082 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:45:26,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 08:45:26,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:45:26,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:45:26,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:45:26,284 INFO L85 PathProgramCache]: Analyzing trace with hash -561226230, now seen corresponding path program 1 times [2024-10-11 08:45:26,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:45:26,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27432163] [2024-10-11 08:45:26,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:45:26,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:45:26,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:45:26,289 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:45:26,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 08:45:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:45:27,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 08:45:27,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:45:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:45:27,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:45:27,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:45:27,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27432163] [2024-10-11 08:45:27,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27432163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:45:27,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:45:27,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:45:27,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379952490] [2024-10-11 08:45:27,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:45:27,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:45:27,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:45:27,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:45:27,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:45:27,816 INFO L87 Difference]: Start difference. First operand 77 states and 113 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:45:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:45:30,790 INFO L93 Difference]: Finished difference Result 289 states and 426 transitions. [2024-10-11 08:45:30,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 08:45:30,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-10-11 08:45:30,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:45:30,797 INFO L225 Difference]: With dead ends: 289 [2024-10-11 08:45:30,797 INFO L226 Difference]: Without dead ends: 213 [2024-10-11 08:45:30,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:45:30,799 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 195 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 08:45:30,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 531 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 08:45:30,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-11 08:45:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 130. [2024-10-11 08:45:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 73 states have internal predecessors, (85), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 08:45:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 189 transitions. [2024-10-11 08:45:30,828 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 189 transitions. Word has length 169 [2024-10-11 08:45:30,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:45:30,829 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 189 transitions. [2024-10-11 08:45:30,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:45:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 189 transitions. [2024-10-11 08:45:30,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 08:45:30,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:45:30,833 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:45:30,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 08:45:31,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:45:31,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:45:31,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:45:31,035 INFO L85 PathProgramCache]: Analyzing trace with hash -561166648, now seen corresponding path program 1 times [2024-10-11 08:45:31,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:45:31,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939260690] [2024-10-11 08:45:31,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:45:31,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:45:31,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:45:31,039 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:45:31,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 08:45:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:45:31,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 08:45:31,932 INFO L278 TraceCheckSpWp]: Computing forward predicates...