./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.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 cd8885ac41c62f773245cba90ab11a911b6bfaa88e51237315a4bb24a1d31893 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:52:29,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:52:29,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:52:29,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:52:29,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:52:29,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:52:29,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:52:29,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:52:29,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:52:29,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:52:29,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:52:29,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:52:29,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:52:29,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:52:29,324 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:52:29,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:52:29,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:52:29,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:52:29,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:52:29,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:52:29,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:52:29,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:52:29,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:52:29,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:52:29,328 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:52:29,328 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:52:29,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:52:29,328 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:52:29,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:52:29,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:52:29,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:52:29,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:52:29,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:52:29,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:52:29,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:52:29,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:52:29,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:52:29,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:52:29,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:52:29,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:52:29,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:52:29,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:52:29,333 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 -> cd8885ac41c62f773245cba90ab11a911b6bfaa88e51237315a4bb24a1d31893 [2024-10-24 09:52:29,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:52:29,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:52:29,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:52:29,622 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:52:29,623 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:52:29,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-10-24 09:52:31,012 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:52:31,224 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:52:31,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-10-24 09:52:31,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/136822ce2/8e4f02a3069c4fc5b6d197d33c288965/FLAGb8b5d9592 [2024-10-24 09:52:31,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/136822ce2/8e4f02a3069c4fc5b6d197d33c288965 [2024-10-24 09:52:31,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:52:31,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:52:31,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:52:31,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:52:31,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:52:31,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:52:31" (1/1) ... [2024-10-24 09:52:31,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5178c8df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:31, skipping insertion in model container [2024-10-24 09:52:31,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:52:31" (1/1) ... [2024-10-24 09:52:31,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:52:31,453 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i[915,928] [2024-10-24 09:52:31,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:52:31,525 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:52:31,536 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i[915,928] [2024-10-24 09:52:31,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:52:31,595 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:52:31,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:31 WrapperNode [2024-10-24 09:52:31,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:52:31,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:52:31,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:52:31,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:52:31,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:31" (1/1) ... [2024-10-24 09:52:31,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:31" (1/1) ... [2024-10-24 09:52:31,671 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-10-24 09:52:31,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:52:31,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:52:31,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:52:31,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:52:31,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:31" (1/1) ... [2024-10-24 09:52:31,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:31" (1/1) ... [2024-10-24 09:52:31,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:31" (1/1) ... [2024-10-24 09:52:31,720 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:52:31,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:31" (1/1) ... [2024-10-24 09:52:31,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:31" (1/1) ... [2024-10-24 09:52:31,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:31" (1/1) ... [2024-10-24 09:52:31,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:31" (1/1) ... [2024-10-24 09:52:31,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:31" (1/1) ... [2024-10-24 09:52:31,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:31" (1/1) ... [2024-10-24 09:52:31,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:52:31,753 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:52:31,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:52:31,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:52:31,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:31" (1/1) ... [2024-10-24 09:52:31,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:52:31,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:52:31,790 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-10-24 09:52:31,797 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-10-24 09:52:31,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:52:31,899 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:52:31,901 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:52:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:52:31,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:52:31,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:52:32,021 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:52:32,023 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:52:32,350 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-24 09:52:32,351 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:52:32,398 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:52:32,399 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:52:32,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:52:32 BoogieIcfgContainer [2024-10-24 09:52:32,400 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:52:32,403 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:52:32,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:52:32,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:52:32,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:52:31" (1/3) ... [2024-10-24 09:52:32,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae3d434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:52:32, skipping insertion in model container [2024-10-24 09:52:32,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:31" (2/3) ... [2024-10-24 09:52:32,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae3d434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:52:32, skipping insertion in model container [2024-10-24 09:52:32,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:52:32" (3/3) ... [2024-10-24 09:52:32,411 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-10-24 09:52:32,427 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:52:32,427 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:52:32,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:52:32,496 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;@53b4eb28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:52:32,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:52:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 09:52:32,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 09:52:32,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:52:32,514 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:52:32,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:52:32,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:52:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash 959712181, now seen corresponding path program 1 times [2024-10-24 09:52:32,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:52:32,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964643672] [2024-10-24 09:52:32,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:52:32,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:52:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:52:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:52:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:52:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:52:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:52:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:52:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:52:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:52:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:52:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 09:52:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 09:52:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 09:52:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 09:52:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 09:52:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 09:52:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 09:52:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 09:52:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 09:52:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:52:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 09:52:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:52:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 09:52:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:52:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 09:52:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 09:52:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 09:52:32,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:52:32,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964643672] [2024-10-24 09:52:32,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964643672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:52:32,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:52:32,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:52:32,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979130836] [2024-10-24 09:52:32,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:52:32,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:52:32,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:52:32,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:52:32,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:52:32,970 INFO L87 Difference]: Start difference. First operand has 65 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 09:52:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:52:33,010 INFO L93 Difference]: Finished difference Result 129 states and 228 transitions. [2024-10-24 09:52:33,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:52:33,014 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 153 [2024-10-24 09:52:33,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:52:33,024 INFO L225 Difference]: With dead ends: 129 [2024-10-24 09:52:33,024 INFO L226 Difference]: Without dead ends: 63 [2024-10-24 09:52:33,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:52:33,034 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:52:33,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:52:33,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-24 09:52:33,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-24 09:52:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 09:52:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2024-10-24 09:52:33,093 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 153 [2024-10-24 09:52:33,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:52:33,093 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2024-10-24 09:52:33,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 09:52:33,094 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2024-10-24 09:52:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 09:52:33,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:52:33,098 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:52:33,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:52:33,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:52:33,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:52:33,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1005634521, now seen corresponding path program 1 times [2024-10-24 09:52:33,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:52:33,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308794473] [2024-10-24 09:52:33,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:52:33,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:52:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:52:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:52:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:52:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:52:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:52:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:52:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:52:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:52:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:52:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 09:52:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 09:52:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 09:52:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 09:52:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 09:52:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 09:52:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 09:52:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 09:52:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 09:52:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:52:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 09:52:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:52:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 09:52:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:52:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 09:52:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 09:52:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 09:52:33,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:52:33,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308794473] [2024-10-24 09:52:33,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308794473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:52:33,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:52:33,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:52:33,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538129005] [2024-10-24 09:52:33,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:52:33,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:52:33,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:52:33,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:52:33,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:52:33,717 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 09:52:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:52:33,794 INFO L93 Difference]: Finished difference Result 187 states and 289 transitions. [2024-10-24 09:52:33,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:52:33,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 153 [2024-10-24 09:52:33,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:52:33,799 INFO L225 Difference]: With dead ends: 187 [2024-10-24 09:52:33,799 INFO L226 Difference]: Without dead ends: 125 [2024-10-24 09:52:33,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:52:33,802 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 46 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:52:33,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 184 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:52:33,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-24 09:52:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-10-24 09:52:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 09:52:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 190 transitions. [2024-10-24 09:52:33,844 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 190 transitions. Word has length 153 [2024-10-24 09:52:33,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:52:33,845 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 190 transitions. [2024-10-24 09:52:33,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 09:52:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 190 transitions. [2024-10-24 09:52:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-24 09:52:33,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:52:33,848 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:52:33,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:52:33,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:52:33,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:52:33,849 INFO L85 PathProgramCache]: Analyzing trace with hash -593972223, now seen corresponding path program 1 times [2024-10-24 09:52:33,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:52:33,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205834728] [2024-10-24 09:52:33,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:52:33,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:52:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:52:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:52:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:52:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:52:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:52:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:52:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:52:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:52:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:52:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 09:52:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 09:52:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 09:52:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 09:52:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 09:52:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 09:52:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 09:52:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 09:52:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 09:52:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:52:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 09:52:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:52:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 09:52:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:52:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 09:52:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 09:52:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 09:52:34,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:52:34,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205834728] [2024-10-24 09:52:34,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205834728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:52:34,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:52:34,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:52:34,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103534643] [2024-10-24 09:52:34,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:52:34,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:52:34,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:52:34,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:52:34,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:52:34,265 INFO L87 Difference]: Start difference. First operand 123 states and 190 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 09:52:34,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:52:34,524 INFO L93 Difference]: Finished difference Result 260 states and 399 transitions. [2024-10-24 09:52:34,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:52:34,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 154 [2024-10-24 09:52:34,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:52:34,528 INFO L225 Difference]: With dead ends: 260 [2024-10-24 09:52:34,528 INFO L226 Difference]: Without dead ends: 138 [2024-10-24 09:52:34,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:52:34,534 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 79 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:52:34,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 315 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:52:34,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-24 09:52:34,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2024-10-24 09:52:34,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 09:52:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 189 transitions. [2024-10-24 09:52:34,560 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 189 transitions. Word has length 154 [2024-10-24 09:52:34,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:52:34,561 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 189 transitions. [2024-10-24 09:52:34,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 09:52:34,562 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 189 transitions. [2024-10-24 09:52:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 09:52:34,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:52:34,565 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:52:34,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:52:34,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:52:34,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:52:34,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1256152771, now seen corresponding path program 1 times [2024-10-24 09:52:34,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:52:34,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242552628] [2024-10-24 09:52:34,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:52:34,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:52:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:52:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:52:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:52:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:52:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:52:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:52:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:52:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:52:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:52:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 09:52:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 09:52:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 09:52:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 09:52:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 09:52:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 09:52:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 09:52:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 09:52:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 09:52:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:52:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 09:52:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:52:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 09:52:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:52:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 09:52:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 09:52:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 09:52:34,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:52:34,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242552628] [2024-10-24 09:52:34,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242552628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:52:34,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:52:34,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:52:34,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698287575] [2024-10-24 09:52:34,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:52:34,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:52:34,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:52:34,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:52:34,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:52:34,806 INFO L87 Difference]: Start difference. First operand 123 states and 189 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 09:52:34,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:52:34,855 INFO L93 Difference]: Finished difference Result 260 states and 394 transitions. [2024-10-24 09:52:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:52:34,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 155 [2024-10-24 09:52:34,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:52:34,860 INFO L225 Difference]: With dead ends: 260 [2024-10-24 09:52:34,862 INFO L226 Difference]: Without dead ends: 138 [2024-10-24 09:52:34,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:52:34,864 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 30 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:52:34,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 169 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:52:34,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-24 09:52:34,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2024-10-24 09:52:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 79 states have internal predecessors, (95), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-24 09:52:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2024-10-24 09:52:34,898 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 155 [2024-10-24 09:52:34,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:52:34,899 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2024-10-24 09:52:34,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 09:52:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2024-10-24 09:52:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 09:52:34,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:52:34,902 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:52:34,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:52:34,903 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:52:34,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:52:34,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1282942444, now seen corresponding path program 1 times [2024-10-24 09:52:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:52:34,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632804910] [2024-10-24 09:52:34,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:52:34,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:52:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:52:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:52:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:52:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:52:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:52:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:52:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:52:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:52:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:52:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 09:52:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 09:52:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 09:52:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 09:52:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 09:52:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 09:52:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 09:52:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 09:52:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 09:52:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:52:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 09:52:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:52:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 09:52:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:52:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 09:52:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 09:52:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-24 09:52:35,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:52:35,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632804910] [2024-10-24 09:52:35,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632804910] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:52:35,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701002526] [2024-10-24 09:52:35,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:52:35,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:52:35,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:52:35,378 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-10-24 09:52:35,382 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-10-24 09:52:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:35,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 09:52:35,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:52:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 612 proven. 30 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-10-24 09:52:36,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:52:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-24 09:52:36,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701002526] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:52:36,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 09:52:36,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2024-10-24 09:52:36,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555970493] [2024-10-24 09:52:36,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 09:52:36,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 09:52:36,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:52:36,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 09:52:36,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-10-24 09:52:36,414 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 5 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (61), 5 states have call predecessors, (61), 5 states have call successors, (61) [2024-10-24 09:52:36,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:52:36,838 INFO L93 Difference]: Finished difference Result 223 states and 319 transitions. [2024-10-24 09:52:36,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 09:52:36,838 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 5 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (61), 5 states have call predecessors, (61), 5 states have call successors, (61) Word has length 156 [2024-10-24 09:52:36,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:52:36,842 INFO L225 Difference]: With dead ends: 223 [2024-10-24 09:52:36,842 INFO L226 Difference]: Without dead ends: 157 [2024-10-24 09:52:36,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2024-10-24 09:52:36,844 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 139 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:52:36,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 218 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 09:52:36,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-24 09:52:36,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2024-10-24 09:52:36,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 85 states have internal predecessors, (98), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-24 09:52:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 206 transitions. [2024-10-24 09:52:36,868 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 206 transitions. Word has length 156 [2024-10-24 09:52:36,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:52:36,869 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 206 transitions. [2024-10-24 09:52:36,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 5 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (61), 5 states have call predecessors, (61), 5 states have call successors, (61) [2024-10-24 09:52:36,869 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 206 transitions. [2024-10-24 09:52:36,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 09:52:36,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:52:36,871 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:52:36,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:52:37,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:52:37,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:52:37,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:52:37,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2073573089, now seen corresponding path program 1 times [2024-10-24 09:52:37,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:52:37,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252373762] [2024-10-24 09:52:37,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:52:37,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:52:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:52:37,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1314651820] [2024-10-24 09:52:37,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:52:37,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:52:37,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:52:37,160 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-10-24 09:52:37,162 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-10-24 09:52:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:52:37,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:52:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:52:37,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:52:37,783 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:52:37,784 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:52:37,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 09:52:37,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 09:52:37,991 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 09:52:38,104 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:52:38,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:52:38 BoogieIcfgContainer [2024-10-24 09:52:38,108 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:52:38,109 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:52:38,109 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:52:38,109 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:52:38,109 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:52:32" (3/4) ... [2024-10-24 09:52:38,111 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:52:38,112 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:52:38,114 INFO L158 Benchmark]: Toolchain (without parser) took 6857.92ms. Allocated memory was 199.2MB in the beginning and 247.5MB in the end (delta: 48.2MB). Free memory was 148.2MB in the beginning and 83.1MB in the end (delta: 65.1MB). Peak memory consumption was 113.3MB. Max. memory is 16.1GB. [2024-10-24 09:52:38,114 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 100.7MB. Free memory was 65.5MB in the beginning and 65.5MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:52:38,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.13ms. Allocated memory is still 199.2MB. Free memory was 147.6MB in the beginning and 131.4MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 09:52:38,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.74ms. Allocated memory is still 199.2MB. Free memory was 131.4MB in the beginning and 126.6MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 09:52:38,115 INFO L158 Benchmark]: Boogie Preprocessor took 79.02ms. Allocated memory is still 199.2MB. Free memory was 126.6MB in the beginning and 118.9MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 09:52:38,115 INFO L158 Benchmark]: RCFGBuilder took 646.91ms. Allocated memory is still 199.2MB. Free memory was 118.9MB in the beginning and 142.2MB in the end (delta: -23.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 09:52:38,116 INFO L158 Benchmark]: TraceAbstraction took 5705.05ms. Allocated memory was 199.2MB in the beginning and 247.5MB in the end (delta: 48.2MB). Free memory was 141.2MB in the beginning and 84.1MB in the end (delta: 57.1MB). Peak memory consumption was 107.4MB. Max. memory is 16.1GB. [2024-10-24 09:52:38,116 INFO L158 Benchmark]: Witness Printer took 4.87ms. Allocated memory is still 247.5MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:52:38,118 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.08ms. Allocated memory is still 100.7MB. Free memory was 65.5MB in the beginning and 65.5MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.13ms. Allocated memory is still 199.2MB. Free memory was 147.6MB in the beginning and 131.4MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.74ms. Allocated memory is still 199.2MB. Free memory was 131.4MB in the beginning and 126.6MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.02ms. Allocated memory is still 199.2MB. Free memory was 126.6MB in the beginning and 118.9MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 646.91ms. Allocated memory is still 199.2MB. Free memory was 118.9MB in the beginning and 142.2MB in the end (delta: -23.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5705.05ms. Allocated memory was 199.2MB in the beginning and 247.5MB in the end (delta: 48.2MB). Free memory was 141.2MB in the beginning and 84.1MB in the end (delta: 57.1MB). Peak memory consumption was 107.4MB. Max. memory is 16.1GB. * Witness Printer took 4.87ms. Allocated memory is still 247.5MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 145. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_7 = 50; [L26] unsigned char var_1_8 = 0; [L27] double var_1_9 = 127.625; [L28] double var_1_10 = 256.8; [L29] double var_1_11 = 0.30000000000000004; [L30] signed long int var_1_12 = -2; [L31] double var_1_13 = 2.475; [L32] double var_1_14 = 25.2; [L33] double var_1_15 = 500.125; [L34] double var_1_16 = 10.75; [L35] double var_1_17 = 255.4; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 100; [L39] unsigned char var_1_21 = 128; [L40] unsigned char var_1_22 = 0; [L41] unsigned char var_1_23 = 1; [L42] unsigned char var_1_24 = 8; [L43] unsigned char var_1_25 = 10; [L44] float var_1_26 = 16.8; [L45] unsigned long int var_1_27 = 64; [L46] unsigned char last_1_var_1_18 = 1; [L47] unsigned char last_1_var_1_20 = 100; [L149] isInitial = 1 [L150] FCALL initially() [L151] int k_loop; [L152] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L152] COND TRUE k_loop < 1 [L153] CALL updateLastVariables() [L141] last_1_var_1_18 = var_1_18 [L142] last_1_var_1_20 = var_1_20 [L153] RET updateLastVariables() [L154] CALL updateVariables() [L98] var_1_2 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L99] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L100] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L100] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L101] var_1_3 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L102] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L103] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L103] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L104] var_1_8 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L105] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L106] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L106] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L107] var_1_10 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L108] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L109] var_1_11 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L110] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L111] var_1_13 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L112] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L113] var_1_14 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L114] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L115] var_1_15 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L116] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L117] var_1_16 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L118] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L119] var_1_17 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L120] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L121] var_1_19 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L122] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L123] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L123] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L124] var_1_21 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L125] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L126] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L126] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L127] var_1_22 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L128] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L129] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L129] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L130] var_1_23 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L131] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L132] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L132] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L133] var_1_24 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L134] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L135] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L135] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L136] var_1_25 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L137] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L138] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=-385, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=-385, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L138] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=-385, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L154] RET updateVariables() [L155] CALL step() [L51] signed long int stepLocal_1 = last_1_var_1_20; [L52] unsigned char stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_0=1, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=-385, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L53] COND TRUE stepLocal_0 && last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=-385, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L54] COND FALSE !(((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > stepLocal_1) [L57] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=-385, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L62] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=-385, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L67] var_1_26 = var_1_16 [L68] var_1_27 = 10u [L69] unsigned long int stepLocal_2 = var_1_27; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_2=10, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=-385, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L70] COND TRUE stepLocal_2 != (var_1_8 + var_1_7) [L71] var_1_9 = ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=-385, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L75] COND TRUE var_1_8 >= var_1_7 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=-385, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L76] COND TRUE var_1_15 >= var_1_26 [L77] var_1_20 = (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=-385, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L84] COND TRUE \read(var_1_18) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=-385, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L85] COND FALSE !(! var_1_18) [L88] var_1_1 = (var_1_20 - var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=-385, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L93] COND TRUE (var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17)) [L94] var_1_12 = (var_1_20 + var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=0, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=-385, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L155] RET step() [L156] CALL, EXPR property() [L145-L146] return (((((((var_1_18 ? ((! var_1_18) ? (var_1_1 == ((signed short int) (var_1_7 + 5))) : (var_1_1 == ((signed short int) (var_1_20 - var_1_20)))) : (var_1_1 == ((signed short int) var_1_20))) && ((last_1_var_1_18 && last_1_var_1_18) ? ((((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > last_1_var_1_20) ? (var_1_7 == ((unsigned char) var_1_8)) : (var_1_7 == ((unsigned char) var_1_8))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((var_1_27 != (var_1_8 + var_1_7)) ? (var_1_9 == ((double) ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))))) : (var_1_9 == ((double) ((((var_1_11) < (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) ? (var_1_11) : (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))))))) && (((var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17))) ? (var_1_12 == ((signed long int) (var_1_20 + var_1_20))) : 1)) && (var_1_3 ? (var_1_2 ? (var_1_18 == ((unsigned char) (! var_1_19))) : 1) : 1)) && ((var_1_8 >= var_1_7) ? ((var_1_15 >= var_1_26) ? (var_1_20 == ((unsigned char) (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))))) : (var_1_20 == ((unsigned char) var_1_24))) : (var_1_20 == ((unsigned char) var_1_22)))) && (var_1_26 == ((float) var_1_16))) && (var_1_27 == ((unsigned long int) 10u)) ; [L156] RET, EXPR property() [L156] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=0, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=-385, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=0, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=639, var_1_22=0, var_1_23=0, var_1_24=-129, var_1_25=-385, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 6, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 294 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 294 mSDsluCounter, 980 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 538 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 453 IncrementalHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 442 mSDtfsCounter, 453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 619 GetRequests, 587 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=5, InterpolantAutomatonStates: 24, 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, 5 MinimizatonAttempts, 30 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1239 NumberOfCodeBlocks, 1239 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1076 ConstructedInterpolants, 0 QuantifiedInterpolants, 2351 SizeOfPredicates, 4 NumberOfNonLiveVariables, 362 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 8310/8400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 09:52:38,154 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.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 cd8885ac41c62f773245cba90ab11a911b6bfaa88e51237315a4bb24a1d31893 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:52:40,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:52:40,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:52:40,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:52:40,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:52:40,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:52:40,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:52:40,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:52:40,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:52:40,398 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:52:40,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:52:40,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:52:40,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:52:40,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:52:40,403 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:52:40,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:52:40,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:52:40,404 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:52:40,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:52:40,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:52:40,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:52:40,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:52:40,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:52:40,407 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:52:40,408 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:52:40,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:52:40,410 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:52:40,410 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:52:40,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:52:40,411 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:52:40,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:52:40,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:52:40,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:52:40,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:52:40,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:52:40,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:52:40,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:52:40,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:52:40,414 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:52:40,414 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:52:40,415 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:52:40,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:52:40,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:52:40,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:52:40,415 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:52:40,416 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 -> cd8885ac41c62f773245cba90ab11a911b6bfaa88e51237315a4bb24a1d31893 [2024-10-24 09:52:40,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:52:40,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:52:40,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:52:40,746 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:52:40,746 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:52:40,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-10-24 09:52:42,217 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:52:42,454 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:52:42,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-10-24 09:52:42,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c2221e35/0d5c11a3397e403a9d26353bf709e678/FLAG97f299be9 [2024-10-24 09:52:42,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c2221e35/0d5c11a3397e403a9d26353bf709e678 [2024-10-24 09:52:42,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:52:42,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:52:42,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:52:42,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:52:42,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:52:42,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:52:42" (1/1) ... [2024-10-24 09:52:42,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@415f1910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:42, skipping insertion in model container [2024-10-24 09:52:42,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:52:42" (1/1) ... [2024-10-24 09:52:42,858 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:52:43,036 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i[915,928] [2024-10-24 09:52:43,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:52:43,148 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:52:43,164 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i[915,928] [2024-10-24 09:52:43,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:52:43,239 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:52:43,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:43 WrapperNode [2024-10-24 09:52:43,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:52:43,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:52:43,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:52:43,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:52:43,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:43" (1/1) ... [2024-10-24 09:52:43,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:43" (1/1) ... [2024-10-24 09:52:43,304 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-10-24 09:52:43,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:52:43,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:52:43,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:52:43,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:52:43,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:43" (1/1) ... [2024-10-24 09:52:43,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:43" (1/1) ... [2024-10-24 09:52:43,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:43" (1/1) ... [2024-10-24 09:52:43,350 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:52:43,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:43" (1/1) ... [2024-10-24 09:52:43,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:43" (1/1) ... [2024-10-24 09:52:43,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:43" (1/1) ... [2024-10-24 09:52:43,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:43" (1/1) ... [2024-10-24 09:52:43,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:43" (1/1) ... [2024-10-24 09:52:43,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:43" (1/1) ... [2024-10-24 09:52:43,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:52:43,393 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:52:43,393 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:52:43,393 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:52:43,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:43" (1/1) ... [2024-10-24 09:52:43,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:52:43,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:52:43,424 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-10-24 09:52:43,426 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-10-24 09:52:43,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:52:43,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:52:43,470 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:52:43,470 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:52:43,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:52:43,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:52:43,550 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:52:43,552 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:52:51,214 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-24 09:52:51,214 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:52:51,279 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:52:51,279 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:52:51,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:52:51 BoogieIcfgContainer [2024-10-24 09:52:51,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:52:51,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:52:51,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:52:51,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:52:51,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:52:42" (1/3) ... [2024-10-24 09:52:51,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e009631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:52:51, skipping insertion in model container [2024-10-24 09:52:51,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:52:43" (2/3) ... [2024-10-24 09:52:51,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e009631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:52:51, skipping insertion in model container [2024-10-24 09:52:51,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:52:51" (3/3) ... [2024-10-24 09:52:51,300 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-10-24 09:52:51,317 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:52:51,318 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:52:51,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:52:51,391 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;@3fb6ae20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:52:51,391 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:52:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 09:52:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 09:52:51,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:52:51,405 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:52:51,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:52:51,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:52:51,411 INFO L85 PathProgramCache]: Analyzing trace with hash 959712181, now seen corresponding path program 1 times [2024-10-24 09:52:51,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:52:51,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181624608] [2024-10-24 09:52:51,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:52:51,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:52:51,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:52:51,432 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-10-24 09:52:51,433 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-10-24 09:52:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:51,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:52:51,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:52:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 09:52:52,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:52:52,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:52:52,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181624608] [2024-10-24 09:52:52,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181624608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:52:52,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:52:52,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:52:52,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107416719] [2024-10-24 09:52:52,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:52:52,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:52:52,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:52:52,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:52:52,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:52:52,060 INFO L87 Difference]: Start difference. First operand has 65 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 09:52:56,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:52:56,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:52:56,165 INFO L93 Difference]: Finished difference Result 129 states and 228 transitions. [2024-10-24 09:52:56,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:52:56,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 153 [2024-10-24 09:52:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:52:56,173 INFO L225 Difference]: With dead ends: 129 [2024-10-24 09:52:56,173 INFO L226 Difference]: Without dead ends: 63 [2024-10-24 09:52:56,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:52:56,181 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:52:56,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-24 09:52:56,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-24 09:52:56,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-24 09:52:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 09:52:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2024-10-24 09:52:56,224 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 153 [2024-10-24 09:52:56,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:52:56,225 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2024-10-24 09:52:56,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 09:52:56,225 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2024-10-24 09:52:56,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 09:52:56,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:52:56,229 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:52:56,245 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-10-24 09:52:56,433 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-10-24 09:52:56,434 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:52:56,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:52:56,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1005634521, now seen corresponding path program 1 times [2024-10-24 09:52:56,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:52:56,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598201761] [2024-10-24 09:52:56,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:52:56,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:52:56,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:52:56,439 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-10-24 09:52:56,441 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-10-24 09:52:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:52:56,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 09:52:56,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:52:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 09:52:57,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:52:57,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:52:57,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598201761] [2024-10-24 09:52:57,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598201761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:52:57,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:52:57,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:52:57,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042058465] [2024-10-24 09:52:57,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:52:57,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:52:57,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:52:57,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:52:57,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:52:57,878 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 09:53:01,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:53:05,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:53:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:53:05,678 INFO L93 Difference]: Finished difference Result 200 states and 308 transitions. [2024-10-24 09:53:05,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:53:05,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 153 [2024-10-24 09:53:05,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:53:05,683 INFO L225 Difference]: With dead ends: 200 [2024-10-24 09:53:05,683 INFO L226 Difference]: Without dead ends: 138 [2024-10-24 09:53:05,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:53:05,685 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 76 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-10-24 09:53:05,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 315 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2024-10-24 09:53:05,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-24 09:53:05,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2024-10-24 09:53:05,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 09:53:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 189 transitions. [2024-10-24 09:53:05,716 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 189 transitions. Word has length 153 [2024-10-24 09:53:05,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:53:05,717 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 189 transitions. [2024-10-24 09:53:05,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 09:53:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 189 transitions. [2024-10-24 09:53:05,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 09:53:05,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:53:05,723 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:53:05,741 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 (3)] Ended with exit code 0 [2024-10-24 09:53:05,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-10-24 09:53:05,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:53:05,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:53:05,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1256152771, now seen corresponding path program 1 times [2024-10-24 09:53:05,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:53:05,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087617586] [2024-10-24 09:53:05,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:53:05,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:53:05,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:53:05,929 INFO L229 MonitoredProcess]: Starting monitored process 4 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-10-24 09:53:05,931 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 (4)] Waiting until timeout for monitored process [2024-10-24 09:53:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:06,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 09:53:06,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:53:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 09:53:06,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:53:06,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:53:06,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087617586] [2024-10-24 09:53:06,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087617586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:53:06,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:53:06,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:53:06,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594444105] [2024-10-24 09:53:06,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:53:06,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:53:06,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:53:06,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:53:06,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:53:06,351 INFO L87 Difference]: Start difference. First operand 123 states and 189 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 09:53:09,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:53:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:53:09,861 INFO L93 Difference]: Finished difference Result 260 states and 394 transitions. [2024-10-24 09:53:09,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:53:09,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 155 [2024-10-24 09:53:09,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:53:09,865 INFO L225 Difference]: With dead ends: 260 [2024-10-24 09:53:09,865 INFO L226 Difference]: Without dead ends: 138 [2024-10-24 09:53:09,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:53:09,868 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 30 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-24 09:53:09,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 168 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-24 09:53:09,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-24 09:53:09,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2024-10-24 09:53:09,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 79 states have internal predecessors, (95), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-24 09:53:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2024-10-24 09:53:09,908 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 155 [2024-10-24 09:53:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:53:09,909 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2024-10-24 09:53:09,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 09:53:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2024-10-24 09:53:09,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 09:53:09,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:53:09,912 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:53:09,930 INFO L540 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 (4)] Forceful destruction successful, exit code 0 [2024-10-24 09:53:10,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-10-24 09:53:10,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:53:10,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:53:10,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1282942444, now seen corresponding path program 1 times [2024-10-24 09:53:10,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:53:10,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645517633] [2024-10-24 09:53:10,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:53:10,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:53:10,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:53:10,119 INFO L229 MonitoredProcess]: Starting monitored process 5 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-10-24 09:53:10,120 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 (5)] Waiting until timeout for monitored process [2024-10-24 09:53:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:10,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 09:53:10,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:53:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 612 proven. 30 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-10-24 09:53:11,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:53:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-24 09:53:12,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:53:12,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645517633] [2024-10-24 09:53:12,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645517633] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:53:12,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:53:12,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-24 09:53:12,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633527593] [2024-10-24 09:53:12,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:53:12,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 09:53:12,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:53:12,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 09:53:12,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:53:12,026 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-24 09:53:16,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:53:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:53:17,082 INFO L93 Difference]: Finished difference Result 223 states and 319 transitions. [2024-10-24 09:53:17,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 09:53:17,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 156 [2024-10-24 09:53:17,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:53:17,091 INFO L225 Difference]: With dead ends: 223 [2024-10-24 09:53:17,091 INFO L226 Difference]: Without dead ends: 157 [2024-10-24 09:53:17,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-24 09:53:17,095 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 184 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-24 09:53:17,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 128 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-24 09:53:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-24 09:53:17,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2024-10-24 09:53:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 84 states have (on average 1.1785714285714286) internal successors, (99), 85 states have internal predecessors, (99), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-24 09:53:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 207 transitions. [2024-10-24 09:53:17,125 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 207 transitions. Word has length 156 [2024-10-24 09:53:17,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:53:17,125 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 207 transitions. [2024-10-24 09:53:17,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-24 09:53:17,126 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 207 transitions. [2024-10-24 09:53:17,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 09:53:17,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:53:17,128 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:53:17,147 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 (5)] Ended with exit code 0 [2024-10-24 09:53:17,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-10-24 09:53:17,329 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:53:17,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:53:17,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2073573089, now seen corresponding path program 1 times [2024-10-24 09:53:17,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:53:17,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836229162] [2024-10-24 09:53:17,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:53:17,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:53:17,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:53:17,331 INFO L229 MonitoredProcess]: Starting monitored process 6 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-10-24 09:53:17,332 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 (6)] Waiting until timeout for monitored process [2024-10-24 09:53:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:17,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 09:53:17,756 INFO L278 TraceCheckSpWp]: Computing forward predicates...