./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 497d15388e034a149c78194db219807046ee74564c7ab7b99d1dbd873759d869 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:26:58,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:26:58,521 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:26:58,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:26:58,525 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:26:58,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:26:58,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:26:58,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:26:58,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:26:58,564 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:26:58,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:26:58,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:26:58,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:26:58,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:26:58,567 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:26:58,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:26:58,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:26:58,568 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:26:58,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:26:58,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:26:58,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:26:58,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:26:58,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:26:58,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:26:58,574 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:26:58,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:26:58,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:26:58,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:26:58,576 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:26:58,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:26:58,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:26:58,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:26:58,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:26:58,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:26:58,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:26:58,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:26:58,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:26:58,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:26:58,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:26:58,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:26:58,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:26:58,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:26:58,581 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/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/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 -> 497d15388e034a149c78194db219807046ee74564c7ab7b99d1dbd873759d869 [2024-11-09 00:26:58,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:26:58,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:26:58,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:26:58,960 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:26:58,960 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:26:58,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.i [2024-11-09 00:27:00,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:27:00,802 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:27:00,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.i [2024-11-09 00:27:00,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961283798/7f18d6a1b17d47699008355fabdbce49/FLAG7bb9d06cc [2024-11-09 00:27:00,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961283798/7f18d6a1b17d47699008355fabdbce49 [2024-11-09 00:27:00,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:27:00,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:27:00,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:27:00,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:27:00,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:27:00,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:27:00" (1/1) ... [2024-11-09 00:27:00,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7c4f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:00, skipping insertion in model container [2024-11-09 00:27:00,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:27:00" (1/1) ... [2024-11-09 00:27:00,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:27:01,093 WARN L250 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_operatoramount_amount100_file-62.i[916,929] [2024-11-09 00:27:01,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:27:01,223 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:27:01,236 WARN L250 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_operatoramount_amount100_file-62.i[916,929] [2024-11-09 00:27:01,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:27:01,290 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:27:01,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:01 WrapperNode [2024-11-09 00:27:01,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:27:01,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:27:01,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:27:01,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:27:01,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:01" (1/1) ... [2024-11-09 00:27:01,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:01" (1/1) ... [2024-11-09 00:27:01,379 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-11-09 00:27:01,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:27:01,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:27:01,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:27:01,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:27:01,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:01" (1/1) ... [2024-11-09 00:27:01,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:01" (1/1) ... [2024-11-09 00:27:01,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:01" (1/1) ... [2024-11-09 00:27:01,431 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-11-09 00:27:01,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:01" (1/1) ... [2024-11-09 00:27:01,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:01" (1/1) ... [2024-11-09 00:27:01,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:01" (1/1) ... [2024-11-09 00:27:01,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:01" (1/1) ... [2024-11-09 00:27:01,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:01" (1/1) ... [2024-11-09 00:27:01,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:01" (1/1) ... [2024-11-09 00:27:01,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:27:01,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:27:01,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:27:01,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:27:01,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:01" (1/1) ... [2024-11-09 00:27:01,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:27:01,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:27:01,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:27:01,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:27:01,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:27:01,582 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:27:01,584 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:27:01,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:27:01,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:27:01,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:27:01,692 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:27:01,695 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:27:02,220 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-09 00:27:02,220 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:27:02,243 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:27:02,243 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:27:02,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:27:02 BoogieIcfgContainer [2024-11-09 00:27:02,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:27:02,249 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:27:02,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:27:02,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:27:02,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:27:00" (1/3) ... [2024-11-09 00:27:02,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633fc086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:27:02, skipping insertion in model container [2024-11-09 00:27:02,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:01" (2/3) ... [2024-11-09 00:27:02,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633fc086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:27:02, skipping insertion in model container [2024-11-09 00:27:02,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:27:02" (3/3) ... [2024-11-09 00:27:02,257 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-62.i [2024-11-09 00:27:02,275 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:27:02,276 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:27:02,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:27:02,347 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;@528e7f86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:27:02,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:27:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 00:27:02,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-09 00:27:02,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:02,374 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:27:02,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:02,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:02,380 INFO L85 PathProgramCache]: Analyzing trace with hash -509721845, now seen corresponding path program 1 times [2024-11-09 00:27:02,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:02,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133094675] [2024-11-09 00:27:02,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:02,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:27:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:27:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 00:27:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:27:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 00:27:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:27:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:27:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:27:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 00:27:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:27:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:27:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:27:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:27:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:27:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 00:27:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:27:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:27:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:27:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 00:27:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 00:27:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:27:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 00:27:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 00:27:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-09 00:27:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 00:27:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-09 00:27:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-09 00:27:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:02,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-09 00:27:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-09 00:27:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-09 00:27:03,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:03,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133094675] [2024-11-09 00:27:03,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133094675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:03,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:03,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:27:03,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913886328] [2024-11-09 00:27:03,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:03,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:27:03,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:03,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:27:03,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:27:03,067 INFO L87 Difference]: Start difference. First operand has 91 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-09 00:27:03,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:03,103 INFO L93 Difference]: Finished difference Result 175 states and 310 transitions. [2024-11-09 00:27:03,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:27:03,106 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 191 [2024-11-09 00:27:03,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:03,119 INFO L225 Difference]: With dead ends: 175 [2024-11-09 00:27:03,120 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 00:27:03,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-11-09 00:27:03,129 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:03,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:27:03,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 00:27:03,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 00:27:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 00:27:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 135 transitions. [2024-11-09 00:27:03,179 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 135 transitions. Word has length 191 [2024-11-09 00:27:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:03,180 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 135 transitions. [2024-11-09 00:27:03,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-09 00:27:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 135 transitions. [2024-11-09 00:27:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-09 00:27:03,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:03,185 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:27:03,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:27:03,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:03,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:03,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1613001297, now seen corresponding path program 1 times [2024-11-09 00:27:03,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:03,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127428518] [2024-11-09 00:27:03,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:03,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:27:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:27:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 00:27:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:27:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 00:27:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:27:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:27:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:27:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 00:27:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:27:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:27:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:27:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:27:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:27:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 00:27:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:27:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:27:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:27:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 00:27:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 00:27:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:27:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 00:27:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 00:27:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-09 00:27:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 00:27:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-09 00:27:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-09 00:27:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-09 00:27:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-09 00:27:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:03,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-09 00:27:03,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:03,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127428518] [2024-11-09 00:27:03,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127428518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:03,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:03,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:27:03,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236162399] [2024-11-09 00:27:03,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:03,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:27:03,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:03,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:27:03,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:27:03,799 INFO L87 Difference]: Start difference. First operand 87 states and 135 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-09 00:27:03,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:03,894 INFO L93 Difference]: Finished difference Result 206 states and 316 transitions. [2024-11-09 00:27:03,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:27:03,896 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2024-11-09 00:27:03,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:03,903 INFO L225 Difference]: With dead ends: 206 [2024-11-09 00:27:03,904 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 00:27:03,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-11-09 00:27:03,907 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 47 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:03,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 296 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:27:03,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 00:27:03,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2024-11-09 00:27:03,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 82 states have internal predecessors, (110), 35 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-09 00:27:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 180 transitions. [2024-11-09 00:27:03,949 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 180 transitions. Word has length 191 [2024-11-09 00:27:03,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:03,950 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 180 transitions. [2024-11-09 00:27:03,950 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-09 00:27:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 180 transitions. [2024-11-09 00:27:03,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-09 00:27:03,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:03,957 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:27:03,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:27:03,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:03,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash 333137619, now seen corresponding path program 1 times [2024-11-09 00:27:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:03,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599037854] [2024-11-09 00:27:03,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:27:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:27:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 00:27:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:27:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 00:27:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:27:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:27:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:27:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 00:27:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:27:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:27:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:27:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:27:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:27:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 00:27:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:27:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:27:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:27:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 00:27:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 00:27:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:27:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 00:27:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 00:27:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-09 00:27:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 00:27:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-09 00:27:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-09 00:27:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-09 00:27:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-09 00:27:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-09 00:27:05,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:05,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599037854] [2024-11-09 00:27:05,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599037854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:05,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:05,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:27:05,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116820874] [2024-11-09 00:27:05,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:05,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:27:05,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:05,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:27:05,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:27:05,947 INFO L87 Difference]: Start difference. First operand 119 states and 180 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-09 00:27:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:06,396 INFO L93 Difference]: Finished difference Result 342 states and 523 transitions. [2024-11-09 00:27:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 00:27:06,397 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2024-11-09 00:27:06,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:06,401 INFO L225 Difference]: With dead ends: 342 [2024-11-09 00:27:06,402 INFO L226 Difference]: Without dead ends: 226 [2024-11-09 00:27:06,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:27:06,404 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 82 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:06,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 444 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:27:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-09 00:27:06,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 179. [2024-11-09 00:27:06,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 110 states have (on average 1.3) internal successors, (143), 111 states have internal predecessors, (143), 65 states have call successors, (65), 3 states have call predecessors, (65), 3 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-09 00:27:06,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 273 transitions. [2024-11-09 00:27:06,440 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 273 transitions. Word has length 191 [2024-11-09 00:27:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:06,441 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 273 transitions. [2024-11-09 00:27:06,442 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-09 00:27:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 273 transitions. [2024-11-09 00:27:06,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-09 00:27:06,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:06,445 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:27:06,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:27:06,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:06,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:06,446 INFO L85 PathProgramCache]: Analyzing trace with hash 88760842, now seen corresponding path program 1 times [2024-11-09 00:27:06,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:06,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365285085] [2024-11-09 00:27:06,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:06,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:27:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:27:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 00:27:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:27:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 00:27:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:27:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:27:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:27:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 00:27:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:27:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:27:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:27:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:27:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:27:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 00:27:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:27:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:27:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:27:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 00:27:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 00:27:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:27:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 00:27:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 00:27:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-09 00:27:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 00:27:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-09 00:27:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-09 00:27:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-09 00:27:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-09 00:27:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-09 00:27:06,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:06,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365285085] [2024-11-09 00:27:06,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365285085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:27:06,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349129489] [2024-11-09 00:27:06,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:06,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:27:06,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:27:06,970 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:27:06,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 00:27:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:07,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 00:27:07,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:27:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 519 proven. 72 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2024-11-09 00:27:07,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:27:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-09 00:27:07,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349129489] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:27:07,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:27:07,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-09 00:27:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785977038] [2024-11-09 00:27:07,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:27:07,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:27:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:07,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:27:07,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:27:07,799 INFO L87 Difference]: Start difference. First operand 179 states and 273 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, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-09 00:27:08,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:08,158 INFO L93 Difference]: Finished difference Result 282 states and 418 transitions. [2024-11-09 00:27:08,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:27:08,159 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, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 192 [2024-11-09 00:27:08,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:08,162 INFO L225 Difference]: With dead ends: 282 [2024-11-09 00:27:08,165 INFO L226 Difference]: Without dead ends: 166 [2024-11-09 00:27:08,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 440 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:27:08,167 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 96 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:08,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 255 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:27:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-09 00:27:08,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 158. [2024-11-09 00:27:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 92 states have (on average 1.2173913043478262) internal successors, (112), 92 states have internal predecessors, (112), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 00:27:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 232 transitions. [2024-11-09 00:27:08,219 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 232 transitions. Word has length 192 [2024-11-09 00:27:08,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:08,221 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 232 transitions. [2024-11-09 00:27:08,221 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, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-09 00:27:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 232 transitions. [2024-11-09 00:27:08,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-09 00:27:08,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:08,227 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:27:08,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 00:27:08,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:27:08,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:08,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:08,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1996666553, now seen corresponding path program 1 times [2024-11-09 00:27:08,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:08,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544007205] [2024-11-09 00:27:08,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:08,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:27:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:27:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 00:27:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:27:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 00:27:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:27:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:27:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:27:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 00:27:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:27:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:27:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:27:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:27:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:27:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 00:27:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:27:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:27:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:27:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 00:27:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 00:27:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:27:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 00:27:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 00:27:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-09 00:27:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 00:27:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-09 00:27:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-09 00:27:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-09 00:27:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-09 00:27:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-09 00:27:08,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:08,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544007205] [2024-11-09 00:27:08,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544007205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:27:08,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663598749] [2024-11-09 00:27:08,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:08,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:27:08,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:27:08,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:27:09,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 00:27:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:09,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 00:27:09,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:27:09,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-09 00:27:09,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:27:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-09 00:27:09,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663598749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:27:09,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:27:09,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-09 00:27:09,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224455395] [2024-11-09 00:27:09,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:27:09,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:27:09,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:09,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:27:09,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:27:09,677 INFO L87 Difference]: Start difference. First operand 158 states and 232 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-09 00:27:09,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:09,926 INFO L93 Difference]: Finished difference Result 271 states and 385 transitions. [2024-11-09 00:27:09,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:27:09,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 193 [2024-11-09 00:27:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:09,931 INFO L225 Difference]: With dead ends: 271 [2024-11-09 00:27:09,931 INFO L226 Difference]: Without dead ends: 178 [2024-11-09 00:27:09,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 442 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:27:09,933 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 120 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:09,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 223 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:27:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-09 00:27:09,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2024-11-09 00:27:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 98 states have (on average 1.183673469387755) internal successors, (116), 98 states have internal predecessors, (116), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 00:27:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 236 transitions. [2024-11-09 00:27:09,963 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 236 transitions. Word has length 193 [2024-11-09 00:27:09,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:09,964 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 236 transitions. [2024-11-09 00:27:09,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-09 00:27:09,964 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 236 transitions. [2024-11-09 00:27:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-09 00:27:09,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:09,967 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:27:09,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:27:10,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:27:10,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:10,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:10,169 INFO L85 PathProgramCache]: Analyzing trace with hash -2132778036, now seen corresponding path program 1 times [2024-11-09 00:27:10,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:10,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832007853] [2024-11-09 00:27:10,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:10,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:27:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:27:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 00:27:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:27:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 00:27:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:27:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:27:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:27:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 00:27:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:27:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:27:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:27:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:27:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:27:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 00:27:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:27:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:27:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:27:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 00:27:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 00:27:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:27:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 00:27:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 00:27:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-09 00:27:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 00:27:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-09 00:27:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-09 00:27:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-09 00:27:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-09 00:27:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 21 proven. 66 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-09 00:27:10,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:10,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832007853] [2024-11-09 00:27:10,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832007853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:27:10,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991475955] [2024-11-09 00:27:10,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:10,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:27:10,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:27:10,792 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:27:10,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 00:27:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:10,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 00:27:10,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:27:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 683 proven. 126 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2024-11-09 00:27:11,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:27:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 21 proven. 66 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-09 00:27:11,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991475955] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:27:11,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:27:11,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-11-09 00:27:11,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436374855] [2024-11-09 00:27:11,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:27:11,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 00:27:11,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:11,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 00:27:11,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-09 00:27:11,556 INFO L87 Difference]: Start difference. First operand 166 states and 236 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 3 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2024-11-09 00:27:11,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:11,935 INFO L93 Difference]: Finished difference Result 291 states and 397 transitions. [2024-11-09 00:27:11,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 00:27:11,936 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 3 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) Word has length 194 [2024-11-09 00:27:11,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:11,938 INFO L225 Difference]: With dead ends: 291 [2024-11-09 00:27:11,939 INFO L226 Difference]: Without dead ends: 194 [2024-11-09 00:27:11,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 438 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-09 00:27:11,941 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 158 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:11,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 506 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:27:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-09 00:27:11,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 182. [2024-11-09 00:27:11,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 110 states have internal predecessors, (125), 60 states have call successors, (60), 11 states have call predecessors, (60), 11 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 00:27:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 245 transitions. [2024-11-09 00:27:11,983 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 245 transitions. Word has length 194 [2024-11-09 00:27:11,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:11,984 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 245 transitions. [2024-11-09 00:27:11,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 3 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2024-11-09 00:27:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 245 transitions. [2024-11-09 00:27:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-09 00:27:11,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:11,987 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:27:12,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 00:27:12,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:27:12,188 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:12,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:12,189 INFO L85 PathProgramCache]: Analyzing trace with hash -378562860, now seen corresponding path program 1 times [2024-11-09 00:27:12,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:12,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686432395] [2024-11-09 00:27:12,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:12,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:27:12,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1565921663] [2024-11-09 00:27:12,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:12,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:27:12,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:27:12,421 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:27:12,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 00:27:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:27:12,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:27:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:27:12,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:27:12,903 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:27:12,904 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:27:12,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 00:27:13,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:27:13,111 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:27:13,217 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:27:13,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:27:13 BoogieIcfgContainer [2024-11-09 00:27:13,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:27:13,221 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:27:13,221 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:27:13,221 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:27:13,222 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:27:02" (3/4) ... [2024-11-09 00:27:13,225 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:27:13,226 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:27:13,226 INFO L158 Benchmark]: Toolchain (without parser) took 12380.32ms. Allocated memory was 182.5MB in the beginning and 304.1MB in the end (delta: 121.6MB). Free memory was 107.6MB in the beginning and 129.7MB in the end (delta: -22.1MB). Peak memory consumption was 101.7MB. Max. memory is 16.1GB. [2024-11-09 00:27:13,227 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 182.5MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:27:13,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.50ms. Allocated memory is still 182.5MB. Free memory was 107.4MB in the beginning and 88.7MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:27:13,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.90ms. Allocated memory is still 182.5MB. Free memory was 88.7MB in the beginning and 151.6MB in the end (delta: -62.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2024-11-09 00:27:13,227 INFO L158 Benchmark]: Boogie Preprocessor took 99.65ms. Allocated memory is still 182.5MB. Free memory was 151.6MB in the beginning and 143.5MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 00:27:13,228 INFO L158 Benchmark]: RCFGBuilder took 764.20ms. Allocated memory is still 182.5MB. Free memory was 143.5MB in the beginning and 133.0MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:27:13,228 INFO L158 Benchmark]: TraceAbstraction took 10970.89ms. Allocated memory was 182.5MB in the beginning and 304.1MB in the end (delta: 121.6MB). Free memory was 131.8MB in the beginning and 130.8MB in the end (delta: 983.7kB). Peak memory consumption was 123.5MB. Max. memory is 16.1GB. [2024-11-09 00:27:13,228 INFO L158 Benchmark]: Witness Printer took 5.16ms. Allocated memory is still 304.1MB. Free memory was 130.8MB in the beginning and 129.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:27:13,229 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.15ms. Allocated memory is still 182.5MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.50ms. Allocated memory is still 182.5MB. Free memory was 107.4MB in the beginning and 88.7MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.90ms. Allocated memory is still 182.5MB. Free memory was 88.7MB in the beginning and 151.6MB in the end (delta: -62.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.65ms. Allocated memory is still 182.5MB. Free memory was 151.6MB in the beginning and 143.5MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 764.20ms. Allocated memory is still 182.5MB. Free memory was 143.5MB in the beginning and 133.0MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10970.89ms. Allocated memory was 182.5MB in the beginning and 304.1MB in the end (delta: 121.6MB). Free memory was 131.8MB in the beginning and 130.8MB in the end (delta: 983.7kB). Peak memory consumption was 123.5MB. Max. memory is 16.1GB. * Witness Printer took 5.16ms. Allocated memory is still 304.1MB. Free memory was 130.8MB in the beginning and 129.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 202, overapproximation of someBinaryArithmeticDOUBLEoperation at line 117, overapproximation of someUnaryDOUBLEoperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 202. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 32.2; [L23] double var_1_4 = 10000000.9; [L24] double var_1_5 = 32.46; [L25] double var_1_6 = 10000.6; [L26] unsigned long int var_1_7 = 128; [L27] unsigned long int var_1_9 = 1; [L28] unsigned long int var_1_10 = 10000; [L29] unsigned char var_1_12 = 0; [L30] unsigned char var_1_13 = 0; [L31] unsigned char var_1_14 = 1; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] double var_1_17 = 63.8; [L35] double var_1_18 = 64.125; [L36] double var_1_19 = 0.9; [L37] float var_1_20 = 8.8; [L38] float var_1_21 = 999999999999.75; [L39] float var_1_22 = 127.5; [L40] unsigned long int var_1_23 = 25; [L41] float var_1_24 = 127.75; [L42] float var_1_25 = 64.7; [L43] signed char var_1_26 = -128; [L44] signed char var_1_27 = 64; [L45] signed char var_1_28 = -16; [L46] signed char var_1_29 = -2; [L47] unsigned short int var_1_30 = 4; [L48] unsigned short int var_1_31 = 57679; [L49] unsigned short int var_1_32 = 23164; [L50] unsigned short int var_1_33 = 1; [L51] double last_1_var_1_1 = 32.2; [L52] unsigned long int last_1_var_1_7 = 128; [L53] unsigned long int last_1_var_1_9 = 1; [L54] unsigned short int last_1_var_1_30 = 4; VAL [isInitial=0, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_4=100000009/10, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L206] isInitial = 1 [L207] FCALL initially() [L208] COND TRUE 1 [L209] CALL updateLastVariables() [L196] last_1_var_1_1 = var_1_1 [L197] last_1_var_1_7 = var_1_7 [L198] last_1_var_1_9 = var_1_9 [L199] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_4=100000009/10, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L209] RET updateLastVariables() [L210] CALL updateVariables() [L146] var_1_4 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L147] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L148] var_1_5 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L149] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L150] var_1_6 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L151] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L152] var_1_10 = __VERIFIER_nondet_ulong() [L153] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L153] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L154] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L155] var_1_13 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L156] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L157] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L159] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L160] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L161] var_1_15 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L162] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L163] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L164] var_1_16 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L165] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L166] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L167] var_1_18 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L168] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L169] var_1_19 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L170] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L171] var_1_23 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L172] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L173] CALL assume_abort_if_not(var_1_23 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L173] RET assume_abort_if_not(var_1_23 <= 4294967295) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L174] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L174] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L175] var_1_24 = __VERIFIER_nondet_float() [L176] CALL assume_abort_if_not((var_1_24 >= -230584.3009213691390e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 2305843.009213691390e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L176] RET assume_abort_if_not((var_1_24 >= -230584.3009213691390e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 2305843.009213691390e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L177] var_1_25 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_25 >= -230584.3009213691390e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 2305843.009213691390e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L178] RET assume_abort_if_not((var_1_25 >= -230584.3009213691390e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 2305843.009213691390e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L179] var_1_27 = __VERIFIER_nondet_char() [L180] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L180] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L181] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L181] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L182] var_1_29 = __VERIFIER_nondet_char() [L183] CALL assume_abort_if_not(var_1_29 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L183] RET assume_abort_if_not(var_1_29 >= -127) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L184] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L184] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L185] var_1_31 = __VERIFIER_nondet_ushort() [L186] CALL assume_abort_if_not(var_1_31 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L186] RET assume_abort_if_not(var_1_31 >= 32767) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L187] CALL assume_abort_if_not(var_1_31 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L187] RET assume_abort_if_not(var_1_31 <= 65534) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L188] var_1_32 = __VERIFIER_nondet_ushort() [L189] CALL assume_abort_if_not(var_1_32 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L189] RET assume_abort_if_not(var_1_32 >= 16383) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L190] CALL assume_abort_if_not(var_1_32 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L190] RET assume_abort_if_not(var_1_32 <= 32767) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L191] var_1_33 = __VERIFIER_nondet_ushort() [L192] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_7=128, var_1_9=1] [L192] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_7=128, var_1_9=1] [L193] CALL assume_abort_if_not(var_1_33 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=128, var_1_9=1] [L193] RET assume_abort_if_not(var_1_33 <= 16383) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=128, var_1_9=1] [L210] RET updateVariables() [L211] CALL step() [L58] unsigned char stepLocal_8 = var_1_14; [L59] unsigned char stepLocal_7 = var_1_14; [L60] unsigned short int stepLocal_6 = var_1_32; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_6=16383, stepLocal_7=1, stepLocal_8=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=128, var_1_9=1] [L61] COND FALSE !(stepLocal_7 && var_1_16) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_6=16383, stepLocal_8=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=128, var_1_9=1] [L64] COND TRUE (var_1_13 && (last_1_var_1_1 > 64.177)) || stepLocal_8 VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_6=16383, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=128, var_1_9=1] [L65] COND TRUE var_1_10 >= stepLocal_6 [L66] var_1_30 = var_1_33 VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=128, var_1_9=1] [L74] var_1_9 = (((((((((last_1_var_1_7) < (last_1_var_1_30)) ? (last_1_var_1_7) : (last_1_var_1_30))) + ((((last_1_var_1_30) < (last_1_var_1_30)) ? (last_1_var_1_30) : (last_1_var_1_30))))) < (last_1_var_1_30)) ? ((((((last_1_var_1_7) < (last_1_var_1_30)) ? (last_1_var_1_7) : (last_1_var_1_30))) + ((((last_1_var_1_30) < (last_1_var_1_30)) ? (last_1_var_1_30) : (last_1_var_1_30))))) : (last_1_var_1_30))) [L75] unsigned long int stepLocal_2 = var_1_9 - var_1_30; [L76] unsigned long int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_1=4, stepLocal_2=0, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=128, var_1_9=4] [L77] COND TRUE 32 > stepLocal_1 VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_2=0, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=128, var_1_9=4] [L78] COND TRUE (- var_1_30) != stepLocal_2 [L79] var_1_7 = ((((((((5u) < (var_1_30)) ? (5u) : (var_1_30)))) < (var_1_30)) ? (((((5u) < (var_1_30)) ? (5u) : (var_1_30)))) : (var_1_30))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=4, var_1_9=4] [L86] COND TRUE \read(var_1_13) [L87] var_1_17 = ((var_1_18 - var_1_19) + var_1_4) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=4, var_1_9=4] [L91] COND TRUE \read(var_1_13) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=4, var_1_9=4] [L92] COND FALSE !(var_1_5 > var_1_18) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=4, var_1_9=4] [L98] signed long int stepLocal_4 = ~ var_1_30; [L99] unsigned short int stepLocal_3 = var_1_30; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=-131068, stepLocal_4=-5, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=4, var_1_9=4] [L100] COND FALSE !((var_1_30 / var_1_23) == stepLocal_4) [L105] var_1_22 = 7.5f VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=-131068, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=15/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=4, var_1_9=4] [L107] unsigned short int stepLocal_5 = var_1_30; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=-131068, stepLocal_5=-131068, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=15/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=4, var_1_9=4] [L108] COND FALSE !(var_1_18 > var_1_24) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=-131068, stepLocal_5=-131068, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=15/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=4, var_1_9=4] [L115] unsigned long int stepLocal_0 = var_1_9; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_0=4, stepLocal_3=-131068, stepLocal_5=-131068, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=15/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=4, var_1_9=4] [L116] COND TRUE var_1_30 >= stepLocal_0 [L117] var_1_1 = ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6) < 0 ) ? -(((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=-131068, stepLocal_5=-131068, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=2, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=15/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=4, var_1_9=4] [L121] COND TRUE var_1_4 <= (var_1_21 + (var_1_5 * var_1_6)) [L122] var_1_12 = ((var_1_13 && var_1_14) && var_1_15) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=-131068, stepLocal_5=-131068, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=2, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=15/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_7=4, var_1_9=4] [L126] COND TRUE (var_1_30 == var_1_30) || var_1_12 [L127] var_1_20 = ((((25.5f) < (var_1_4)) ? (25.5f) : (var_1_4))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=-131068, stepLocal_5=-131068, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=2, var_1_20=51/2, var_1_21=3999999999999/4, var_1_22=15/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_4=0, var_1_7=4, var_1_9=4] [L129] COND FALSE !(var_1_1 > (var_1_20 * (var_1_24 / 2.8))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=-131068, stepLocal_5=-131068, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=2, var_1_20=51/2, var_1_21=3999999999999/4, var_1_22=15/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_4=0, var_1_7=4, var_1_9=4] [L211] RET step() [L212] CALL, EXPR property() [L202-L203] return (((((((((((var_1_30 >= var_1_9) ? (var_1_1 == ((double) ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6) < 0 ) ? -(((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6))))) : (var_1_1 == ((double) (var_1_4 + var_1_5)))) && ((32 > var_1_9) ? (((- var_1_30) != (var_1_9 - var_1_30)) ? (var_1_7 == ((unsigned long int) ((((((((5u) < (var_1_30)) ? (5u) : (var_1_30)))) < (var_1_30)) ? (((((5u) < (var_1_30)) ? (5u) : (var_1_30)))) : (var_1_30))))) : (var_1_7 == ((unsigned long int) var_1_9))) : (var_1_7 == ((unsigned long int) var_1_9)))) && (var_1_9 == ((unsigned long int) (((((((((last_1_var_1_7) < (last_1_var_1_30)) ? (last_1_var_1_7) : (last_1_var_1_30))) + ((((last_1_var_1_30) < (last_1_var_1_30)) ? (last_1_var_1_30) : (last_1_var_1_30))))) < (last_1_var_1_30)) ? ((((((last_1_var_1_7) < (last_1_var_1_30)) ? (last_1_var_1_7) : (last_1_var_1_30))) + ((((last_1_var_1_30) < (last_1_var_1_30)) ? (last_1_var_1_30) : (last_1_var_1_30))))) : (last_1_var_1_30)))))) && ((var_1_4 <= (var_1_21 + (var_1_5 * var_1_6))) ? (var_1_12 == ((unsigned char) ((var_1_13 && var_1_14) && var_1_15))) : (var_1_12 == ((unsigned char) var_1_16)))) && (var_1_13 ? (var_1_17 == ((double) ((var_1_18 - var_1_19) + var_1_4))) : (var_1_17 == ((double) var_1_6)))) && (((var_1_30 == var_1_30) || var_1_12) ? (var_1_20 == ((float) ((((25.5f) < (var_1_4)) ? (25.5f) : (var_1_4))))) : 1)) && (var_1_13 ? ((var_1_5 > var_1_18) ? (var_1_21 == ((float) ((((var_1_18) < (var_1_6)) ? (var_1_18) : (var_1_6))))) : 1) : (var_1_21 == ((float) (var_1_5 + (1.55f + 5.7f)))))) && (((var_1_30 / var_1_23) == (~ var_1_30)) ? (((var_1_30 + (- var_1_30)) >= var_1_30) ? (var_1_22 == ((float) ((var_1_24 + var_1_25) + (var_1_18 - ((((31.85f) > (10.5f)) ? (31.85f) : (10.5f))))))) : 1) : (var_1_22 == ((float) 7.5f)))) && ((var_1_1 > (var_1_20 * (var_1_24 / 2.8))) ? (var_1_14 ? (var_1_13 ? (var_1_26 == ((signed char) ((((var_1_27) > (0)) ? (var_1_27) : (0))))) : (var_1_16 ? (var_1_26 == ((signed char) var_1_27)) : (var_1_26 == ((signed char) var_1_27)))) : (var_1_26 == ((signed char) var_1_27))) : 1)) && ((var_1_18 > var_1_24) ? ((var_1_23 <= var_1_30) ? (var_1_28 == ((signed char) ((((var_1_27) > (var_1_29)) ? (var_1_27) : (var_1_29))))) : (var_1_28 == ((signed char) var_1_29))) : 1)) && ((var_1_14 && var_1_16) ? (var_1_30 == ((unsigned short int) (var_1_31 - ((((var_1_32 - var_1_33) < 0 ) ? -(var_1_32 - var_1_33) : (var_1_32 - var_1_33)))))) : (((var_1_13 && (last_1_var_1_1 > 64.177)) || var_1_14) ? ((var_1_10 >= var_1_32) ? (var_1_30 == ((unsigned short int) var_1_33)) : ((! (last_1_var_1_9 >= var_1_27)) ? (var_1_30 == ((unsigned short int) var_1_33)) : 1)) : 1)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=2, var_1_20=51/2, var_1_21=3999999999999/4, var_1_22=15/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_4=0, var_1_7=4, var_1_9=4] [L212] RET, EXPR property() [L212] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=2, var_1_20=51/2, var_1_21=3999999999999/4, var_1_22=15/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_4=0, var_1_7=4, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=2, var_1_20=51/2, var_1_21=3999999999999/4, var_1_22=15/2, var_1_23=4, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131068, var_1_31=32767, var_1_32=16383, var_1_33=-131068, var_1_4=0, var_1_7=4, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 7, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 526 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 503 mSDsluCounter, 1859 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1125 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 891 IncrementalHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 734 mSDtfsCounter, 891 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1581 GetRequests, 1537 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 82 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2121 NumberOfCodeBlocks, 2121 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2298 ConstructedInterpolants, 0 QuantifiedInterpolants, 5822 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1344 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 20253/20880 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-11-09 00:27:13,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 497d15388e034a149c78194db219807046ee74564c7ab7b99d1dbd873759d869 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:27:15,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:27:15,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:27:15,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:27:15,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:27:15,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:27:15,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:27:15,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:27:15,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:27:15,983 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:27:15,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:27:15,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:27:15,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:27:15,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:27:15,987 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:27:15,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:27:15,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:27:15,989 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:27:15,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:27:15,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:27:15,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:27:15,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:27:15,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:27:15,991 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:27:15,992 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:27:15,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:27:15,992 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:27:15,993 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:27:15,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:27:15,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:27:15,994 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:27:15,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:27:15,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:27:15,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:27:15,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:27:15,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:27:15,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:27:15,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:27:15,996 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:27:15,996 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:27:15,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:27:15,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:27:15,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:27:15,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:27:15,998 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/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/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 -> 497d15388e034a149c78194db219807046ee74564c7ab7b99d1dbd873759d869 [2024-11-09 00:27:16,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:27:16,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:27:16,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:27:16,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:27:16,357 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:27:16,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.i [2024-11-09 00:27:18,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:27:18,539 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:27:18,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-62.i [2024-11-09 00:27:18,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ba5c5f34/df1abf43ff5d4dafa365fab8dc72c9bf/FLAG511399ceb [2024-11-09 00:27:18,574 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ba5c5f34/df1abf43ff5d4dafa365fab8dc72c9bf [2024-11-09 00:27:18,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:27:18,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:27:18,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:27:18,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:27:18,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:27:18,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:27:18" (1/1) ... [2024-11-09 00:27:18,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e9b8d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:18, skipping insertion in model container [2024-11-09 00:27:18,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:27:18" (1/1) ... [2024-11-09 00:27:18,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:27:18,852 WARN L250 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_operatoramount_amount100_file-62.i[916,929] [2024-11-09 00:27:18,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:27:18,989 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:27:19,004 WARN L250 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_operatoramount_amount100_file-62.i[916,929] [2024-11-09 00:27:19,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:27:19,096 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:27:19,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:19 WrapperNode [2024-11-09 00:27:19,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:27:19,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:27:19,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:27:19,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:27:19,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:19" (1/1) ... [2024-11-09 00:27:19,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:19" (1/1) ... [2024-11-09 00:27:19,182 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2024-11-09 00:27:19,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:27:19,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:27:19,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:27:19,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:27:19,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:19" (1/1) ... [2024-11-09 00:27:19,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:19" (1/1) ... [2024-11-09 00:27:19,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:19" (1/1) ... [2024-11-09 00:27:19,236 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-11-09 00:27:19,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:19" (1/1) ... [2024-11-09 00:27:19,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:19" (1/1) ... [2024-11-09 00:27:19,254 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:19" (1/1) ... [2024-11-09 00:27:19,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:19" (1/1) ... [2024-11-09 00:27:19,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:19" (1/1) ... [2024-11-09 00:27:19,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:19" (1/1) ... [2024-11-09 00:27:19,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:27:19,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:27:19,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:27:19,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:27:19,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:19" (1/1) ... [2024-11-09 00:27:19,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:27:19,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:27:19,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:27:19,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:27:19,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:27:19,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:27:19,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:27:19,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:27:19,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:27:19,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:27:19,494 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:27:19,496 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:27:51,604 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-09 00:27:51,604 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:27:51,620 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:27:51,620 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:27:51,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:27:51 BoogieIcfgContainer [2024-11-09 00:27:51,621 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:27:51,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:27:51,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:27:51,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:27:51,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:27:18" (1/3) ... [2024-11-09 00:27:51,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d478ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:27:51, skipping insertion in model container [2024-11-09 00:27:51,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:19" (2/3) ... [2024-11-09 00:27:51,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d478ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:27:51, skipping insertion in model container [2024-11-09 00:27:51,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:27:51" (3/3) ... [2024-11-09 00:27:51,629 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-62.i [2024-11-09 00:27:51,644 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:27:51,644 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:27:51,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:27:51,718 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;@3c39f1d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:27:51,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:27:51,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 00:27:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-09 00:27:51,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:51,738 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:27:51,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:51,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:51,744 INFO L85 PathProgramCache]: Analyzing trace with hash -509721845, now seen corresponding path program 1 times [2024-11-09 00:27:51,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:27:51,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135625245] [2024-11-09 00:27:51,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:51,772 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-11-09 00:27:51,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:27:51,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-11-09 00:27:51,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-09 00:27:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:54,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:27:54,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:27:54,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 1282 trivial. 0 not checked. [2024-11-09 00:27:54,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:27:54,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:27:54,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135625245] [2024-11-09 00:27:54,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135625245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:54,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:54,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:27:54,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618634258] [2024-11-09 00:27:54,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:54,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:27:54,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:27:54,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:27:54,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:27:54,347 INFO L87 Difference]: Start difference. First operand has 91 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-09 00:27:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:54,391 INFO L93 Difference]: Finished difference Result 175 states and 310 transitions. [2024-11-09 00:27:54,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:27:54,393 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 191 [2024-11-09 00:27:54,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:54,401 INFO L225 Difference]: With dead ends: 175 [2024-11-09 00:27:54,401 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 00:27:54,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 190 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-11-09 00:27:54,408 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:54,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:27:54,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 00:27:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 00:27:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 00:27:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 135 transitions. [2024-11-09 00:27:54,455 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 135 transitions. Word has length 191 [2024-11-09 00:27:54,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:54,455 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 135 transitions. [2024-11-09 00:27:54,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-09 00:27:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 135 transitions. [2024-11-09 00:27:54,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-09 00:27:54,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:54,459 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:27:54,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-11-09 00:27:54,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-11-09 00:27:54,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:54,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:54,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1613001297, now seen corresponding path program 1 times [2024-11-09 00:27:54,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:27:54,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587997059] [2024-11-09 00:27:54,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:54,663 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-11-09 00:27:54,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:27:54,668 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-11-09 00:27:54,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-09 00:27:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:57,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 00:27:57,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:28:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-09 00:28:05,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:28:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-09 00:28:13,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:28:13,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587997059] [2024-11-09 00:28:13,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587997059] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:28:13,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:28:13,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-09 00:28:13,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037404731] [2024-11-09 00:28:13,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:28:13,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:28:13,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:28:13,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:28:13,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:28:13,636 INFO L87 Difference]: Start difference. First operand 87 states and 135 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-09 00:28:24,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:28:28,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []