./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-60.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 ad157bb59ab2340bd84ae4f3e0fc67d889cafb8dcb0637d5b8ca503c84568a53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:04:33,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:04:33,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:04:33,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:04:33,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:04:33,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:04:33,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:04:33,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:04:33,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:04:33,397 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:04:33,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:04:33,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:04:33,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:04:33,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:04:33,398 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:04:33,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:04:33,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:04:33,399 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:04:33,399 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:04:33,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:04:33,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:04:33,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:04:33,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:04:33,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:04:33,399 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:04:33,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:04:33,400 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:04:33,400 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:04:33,400 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:04:33,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:04:33,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:04:33,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:04:33,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:04:33,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:04:33,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:04:33,401 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:04:33,401 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:04:33,401 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:04:33,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:04:33,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:04:33,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:04:33,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:04:33,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:04:33,401 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> ad157bb59ab2340bd84ae4f3e0fc67d889cafb8dcb0637d5b8ca503c84568a53 [2025-03-17 04:04:33,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:04:33,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:04:33,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:04:33,615 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:04:33,615 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:04:33,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-60.i [2025-03-17 04:04:34,750 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1644a27/89dbfc8e6bd84d89a5332d2c9ffa38c5/FLAG5ca57eb77 [2025-03-17 04:04:34,963 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:04:34,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-60.i [2025-03-17 04:04:34,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1644a27/89dbfc8e6bd84d89a5332d2c9ffa38c5/FLAG5ca57eb77 [2025-03-17 04:04:35,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1644a27/89dbfc8e6bd84d89a5332d2c9ffa38c5 [2025-03-17 04:04:35,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:04:35,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:04:35,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:04:35,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:04:35,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:04:35,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:04:35" (1/1) ... [2025-03-17 04:04:35,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c47d700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:35, skipping insertion in model container [2025-03-17 04:04:35,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:04:35" (1/1) ... [2025-03-17 04:04:35,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:04:35,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-60.i[915,928] [2025-03-17 04:04:35,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:04:35,506 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:04:35,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-60.i[915,928] [2025-03-17 04:04:35,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:04:35,548 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:04:35,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:35 WrapperNode [2025-03-17 04:04:35,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:04:35,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:04:35,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:04:35,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:04:35,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:35" (1/1) ... [2025-03-17 04:04:35,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:35" (1/1) ... [2025-03-17 04:04:35,575 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2025-03-17 04:04:35,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:04:35,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:04:35,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:04:35,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:04:35,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:35" (1/1) ... [2025-03-17 04:04:35,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:35" (1/1) ... [2025-03-17 04:04:35,585 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:35" (1/1) ... [2025-03-17 04:04:35,602 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]. [2025-03-17 04:04:35,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:35" (1/1) ... [2025-03-17 04:04:35,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:35" (1/1) ... [2025-03-17 04:04:35,607 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:35" (1/1) ... [2025-03-17 04:04:35,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:35" (1/1) ... [2025-03-17 04:04:35,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:35" (1/1) ... [2025-03-17 04:04:35,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:35" (1/1) ... [2025-03-17 04:04:35,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:04:35,620 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:04:35,621 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:04:35,621 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:04:35,621 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:35" (1/1) ... [2025-03-17 04:04:35,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:04:35,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:04:35,645 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) [2025-03-17 04:04:35,647 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 [2025-03-17 04:04:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:04:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:04:35,665 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:04:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:04:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:04:35,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:04:35,717 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:04:35,719 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:04:35,923 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 04:04:35,923 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:04:35,932 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:04:35,932 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:04:35,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:04:35 BoogieIcfgContainer [2025-03-17 04:04:35,933 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:04:35,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:04:35,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:04:35,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:04:35,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:04:35" (1/3) ... [2025-03-17 04:04:35,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6046fc0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:04:35, skipping insertion in model container [2025-03-17 04:04:35,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:35" (2/3) ... [2025-03-17 04:04:35,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6046fc0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:04:35, skipping insertion in model container [2025-03-17 04:04:35,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:04:35" (3/3) ... [2025-03-17 04:04:35,940 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-60.i [2025-03-17 04:04:35,949 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:04:35,950 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-60.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:04:35,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:04:35,993 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;@4f102b67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:04:35,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:04:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 04:04:36,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 04:04:36,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:04:36,003 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:04:36,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:04:36,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:04:36,006 INFO L85 PathProgramCache]: Analyzing trace with hash -534886260, now seen corresponding path program 1 times [2025-03-17 04:04:36,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:04:36,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404642248] [2025-03-17 04:04:36,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:04:36,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:04:36,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 04:04:36,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 04:04:36,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:04:36,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:04:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-17 04:04:36,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:04:36,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404642248] [2025-03-17 04:04:36,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404642248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:04:36,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623676206] [2025-03-17 04:04:36,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:04:36,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:04:36,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:04:36,228 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) [2025-03-17 04:04:36,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:04:36,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 04:04:36,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 04:04:36,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:04:36,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:04:36,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:04:36,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:04:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-17 04:04:36,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:04:36,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623676206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:04:36,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:04:36,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:04:36,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537325355] [2025-03-17 04:04:36,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:04:36,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:04:36,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:04:36,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:04:36,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:04:36,438 INFO L87 Difference]: Start difference. First operand has 60 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 04:04:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:04:36,456 INFO L93 Difference]: Finished difference Result 117 states and 208 transitions. [2025-03-17 04:04:36,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:04:36,457 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2025-03-17 04:04:36,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:04:36,464 INFO L225 Difference]: With dead ends: 117 [2025-03-17 04:04:36,465 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 04:04:36,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:04:36,473 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:04:36,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:04:36,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 04:04:36,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-17 04:04:36,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 04:04:36,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 89 transitions. [2025-03-17 04:04:36,507 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 89 transitions. Word has length 135 [2025-03-17 04:04:36,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:04:36,507 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 89 transitions. [2025-03-17 04:04:36,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 04:04:36,508 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 89 transitions. [2025-03-17 04:04:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 04:04:36,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:04:36,510 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:04:36,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 04:04:36,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 04:04:36,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:04:36,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:04:36,711 INFO L85 PathProgramCache]: Analyzing trace with hash 79444848, now seen corresponding path program 1 times [2025-03-17 04:04:36,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:04:36,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997636970] [2025-03-17 04:04:36,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:04:36,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:04:36,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 04:04:36,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 04:04:36,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:04:36,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:04:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 04:04:36,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:04:36,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997636970] [2025-03-17 04:04:36,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997636970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:04:36,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:04:36,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:04:36,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027364114] [2025-03-17 04:04:36,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:04:36,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:04:36,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:04:36,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:04:36,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:04:36,888 INFO L87 Difference]: Start difference. First operand 58 states and 89 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 04:04:36,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:04:36,923 INFO L93 Difference]: Finished difference Result 148 states and 226 transitions. [2025-03-17 04:04:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:04:36,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 135 [2025-03-17 04:04:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:04:36,925 INFO L225 Difference]: With dead ends: 148 [2025-03-17 04:04:36,925 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 04:04:36,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:04:36,926 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 48 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:04:36,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 201 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:04:36,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 04:04:36,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2025-03-17 04:04:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 52 states have internal predecessors, (67), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 04:04:36,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 135 transitions. [2025-03-17 04:04:36,946 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 135 transitions. Word has length 135 [2025-03-17 04:04:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:04:36,947 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 135 transitions. [2025-03-17 04:04:36,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 04:04:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 135 transitions. [2025-03-17 04:04:36,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 04:04:36,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:04:36,948 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:04:36,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:04:36,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:04:36,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:04:36,949 INFO L85 PathProgramCache]: Analyzing trace with hash 892301271, now seen corresponding path program 1 times [2025-03-17 04:04:36,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:04:36,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707756450] [2025-03-17 04:04:36,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:04:36,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:04:36,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 04:04:37,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 04:04:37,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:04:37,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 04:04:37,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1110828208] [2025-03-17 04:04:37,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:04:37,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:04:37,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:04:37,074 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) [2025-03-17 04:04:37,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 04:04:37,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 04:04:37,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 04:04:37,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:04:37,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:04:37,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 04:04:37,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:04:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 471 proven. 36 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2025-03-17 04:04:38,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:04:38,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:04:38,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707756450] [2025-03-17 04:04:38,274 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 04:04:38,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110828208] [2025-03-17 04:04:38,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110828208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:04:38,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:04:38,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-17 04:04:38,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733841431] [2025-03-17 04:04:38,275 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 04:04:38,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:04:38,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:04:38,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:04:38,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:04:38,276 INFO L87 Difference]: Start difference. First operand 88 states and 135 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 04:04:38,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:04:38,609 INFO L93 Difference]: Finished difference Result 250 states and 379 transitions. [2025-03-17 04:04:38,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 04:04:38,610 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 136 [2025-03-17 04:04:38,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:04:38,612 INFO L225 Difference]: With dead ends: 250 [2025-03-17 04:04:38,613 INFO L226 Difference]: Without dead ends: 163 [2025-03-17 04:04:38,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2025-03-17 04:04:38,617 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 90 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:04:38,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 320 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:04:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-17 04:04:38,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 136. [2025-03-17 04:04:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.24) internal successors, (93), 76 states have internal predecessors, (93), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 04:04:38,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 205 transitions. [2025-03-17 04:04:38,648 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 205 transitions. Word has length 136 [2025-03-17 04:04:38,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:04:38,649 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 205 transitions. [2025-03-17 04:04:38,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 04:04:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 205 transitions. [2025-03-17 04:04:38,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 04:04:38,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:04:38,653 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:04:38,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 04:04:38,853 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,SelfDestructingSolverStorable2 [2025-03-17 04:04:38,854 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:04:38,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:04:38,854 INFO L85 PathProgramCache]: Analyzing trace with hash -915153192, now seen corresponding path program 1 times [2025-03-17 04:04:38,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:04:38,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904552162] [2025-03-17 04:04:38,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:04:38,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:04:38,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 04:04:38,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 04:04:38,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:04:38,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 04:04:38,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [857329088] [2025-03-17 04:04:38,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:04:38,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:04:38,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:04:38,903 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:04:38,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 04:04:38,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 04:04:39,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 04:04:39,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:04:39,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:04:39,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 04:04:39,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 04:04:39,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 04:04:39,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:04:39,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:04:39,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 04:04:39,272 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 04:04:39,273 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:04:39,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 04:04:39,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:04:39,477 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 04:04:39,538 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:04:39,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:04:39 BoogieIcfgContainer [2025-03-17 04:04:39,543 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:04:39,544 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:04:39,544 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:04:39,544 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:04:39,545 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:04:35" (3/4) ... [2025-03-17 04:04:39,546 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 04:04:39,547 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:04:39,547 INFO L158 Benchmark]: Toolchain (without parser) took 4227.80ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 54.3MB in the end (delta: 59.3MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. [2025-03-17 04:04:39,547 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:04:39,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.97ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 99.7MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:04:39,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.82ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 97.0MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:04:39,548 INFO L158 Benchmark]: Boogie Preprocessor took 43.42ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 94.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:04:39,548 INFO L158 Benchmark]: IcfgBuilder took 313.02ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 74.8MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 04:04:39,548 INFO L158 Benchmark]: TraceAbstraction took 3608.19ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 54.3MB in the end (delta: 20.0MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2025-03-17 04:04:39,548 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 142.6MB. Free memory is still 54.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:04:39,551 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.66ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.97ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 99.7MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.82ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 97.0MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.42ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 94.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 313.02ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 74.8MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3608.19ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 54.3MB in the end (delta: 20.0MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 142.6MB. Free memory is still 54.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 32; [L23] unsigned char var_1_2 = 1; [L24] float var_1_4 = 7.8; [L25] signed short int var_1_6 = 16; [L26] signed short int var_1_7 = 256; [L27] float var_1_8 = 256.6; [L28] unsigned char var_1_9 = 50; [L29] unsigned char var_1_10 = 5; [L30] double var_1_11 = 127.75; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 1; [L33] unsigned char var_1_14 = 0; [L34] double var_1_15 = 15.2; [L35] double var_1_16 = 256.5; [L36] double var_1_17 = 256.5; [L37] double var_1_18 = 0.0; [L38] double var_1_19 = 9.7; [L39] unsigned long int var_1_20 = 10000000; [L40] unsigned long int var_1_21 = 4008920074; [L41] signed short int last_1_var_1_1 = 32; [L42] unsigned char last_1_var_1_9 = 50; [L43] double last_1_var_1_11 = 127.75; [L44] double last_1_var_1_16 = 256.5; [L45] unsigned long int last_1_var_1_20 = 10000000; [L145] isInitial = 1 [L146] FCALL initially() [L147] COND TRUE 1 [L148] CALL updateLastVariables() [L134] last_1_var_1_1 = var_1_1 [L135] last_1_var_1_9 = var_1_9 [L136] last_1_var_1_11 = var_1_11 [L137] last_1_var_1_16 = var_1_16 [L138] last_1_var_1_20 = var_1_20 [L148] RET updateLastVariables() [L149] CALL updateVariables() [L97] var_1_2 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L98] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L99] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L99] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L100] var_1_4 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L101] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L102] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L102] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L103] var_1_6 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L104] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L105] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L105] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L106] var_1_7 = __VERIFIER_nondet_short() [L107] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L107] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L108] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L108] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L109] var_1_10 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L110] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L111] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L111] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L112] var_1_12 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L113] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L114] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L114] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L115] var_1_13 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L116] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L117] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L117] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L118] var_1_14 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L119] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L120] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L120] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L121] var_1_15 = __VERIFIER_nondet_double() [L122] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L122] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L123] var_1_17 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L124] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L125] var_1_18 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L126] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L127] var_1_19 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L128] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L129] var_1_21 = __VERIFIER_nondet_ulong() [L130] CALL assume_abort_if_not(var_1_21 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L130] RET assume_abort_if_not(var_1_21 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L131] CALL assume_abort_if_not(var_1_21 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L131] RET assume_abort_if_not(var_1_21 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L149] RET updateVariables() [L150] CALL step() [L49] signed long int stepLocal_0 = (((var_1_7) < (last_1_var_1_1)) ? (var_1_7) : (last_1_var_1_1)); VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L50] COND FALSE !(last_1_var_1_11 < (last_1_var_1_11 + last_1_var_1_16)) [L57] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=1] [L59] unsigned long int stepLocal_1 = last_1_var_1_20; VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, stepLocal_1=10000000, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=1] [L60] COND FALSE !(((var_1_10 * last_1_var_1_9) + last_1_var_1_1) > stepLocal_1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=1, var_1_11=511/4, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=1] [L63] COND FALSE !((last_1_var_1_16 >= last_1_var_1_16) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14))) [L70] var_1_11 = var_1_15 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=1, var_1_11=2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=1] [L72] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=1, var_1_11=2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=1] [L75] COND TRUE var_1_9 >= var_1_9 [L76] var_1_20 = (var_1_21 - var_1_9) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=1, var_1_11=2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=2147483646, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=1] [L81] COND FALSE !((- var_1_16) <= var_1_4) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=1, var_1_11=2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=2147483646, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=1] [L86] COND FALSE !(\read(var_1_2)) [L93] var_1_1 = var_1_9 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=1, var_1_11=2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=1, var_1_20=2147483646, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=1] [L150] RET step() [L151] CALL, EXPR property() [L141-L142] return (((((var_1_2 ? (((var_1_11 / var_1_4) <= var_1_8) ? (var_1_1 == ((signed short int) (var_1_9 - var_1_9))) : (var_1_1 == ((signed short int) var_1_9))) : (var_1_1 == ((signed short int) var_1_9))) && (((- var_1_16) <= var_1_4) ? (((var_1_11 <= var_1_4) || var_1_2) ? (var_1_8 == ((float) 3.3f)) : 1) : 1)) && ((last_1_var_1_11 < (last_1_var_1_11 + last_1_var_1_16)) ? ((((((var_1_7) < (last_1_var_1_1)) ? (var_1_7) : (last_1_var_1_1))) > (var_1_6 * 1)) ? (var_1_9 == ((unsigned char) var_1_10)) : (var_1_9 == ((unsigned char) var_1_10))) : (var_1_9 == ((unsigned char) var_1_10)))) && (((last_1_var_1_16 >= last_1_var_1_16) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14))) ? (var_1_2 ? (var_1_11 == ((double) var_1_15)) : (var_1_11 == ((double) var_1_15))) : (var_1_11 == ((double) var_1_15)))) && ((((var_1_10 * last_1_var_1_9) + last_1_var_1_1) > last_1_var_1_20) ? (var_1_16 == ((double) (var_1_17 - (var_1_18 - var_1_19)))) : 1)) && (var_1_13 ? (var_1_20 == ((unsigned long int) (((((var_1_9) > (128u)) ? (var_1_9) : (128u))) + var_1_9))) : ((var_1_9 >= var_1_9) ? (var_1_20 == ((unsigned long int) (var_1_21 - var_1_9))) : (var_1_20 == ((unsigned long int) var_1_9)))) ; [L151] RET, EXPR property() [L151] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=1, var_1_20=2147483646, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=1, var_1_11=2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=513/2, var_1_1=1, var_1_20=2147483646, var_1_21=2147483647, var_1_2=0, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 116 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 610 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 343 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 226 IncrementalHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 267 mSDtfsCounter, 226 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=3, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 30 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 537 ConstructedInterpolants, 0 QuantifiedInterpolants, 1674 SizeOfPredicates, 6 NumberOfNonLiveVariables, 661 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 3618/3696 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 04:04:39,568 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/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-60.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 ad157bb59ab2340bd84ae4f3e0fc67d889cafb8dcb0637d5b8ca503c84568a53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:04:41,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:04:41,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 04:04:41,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:04:41,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:04:41,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:04:41,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:04:41,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:04:41,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:04:41,420 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:04:41,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:04:41,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:04:41,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:04:41,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:04:41,420 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:04:41,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:04:41,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:04:41,420 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:04:41,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:04:41,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:04:41,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:04:41,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:04:41,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:04:41,421 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 04:04:41,421 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 04:04:41,421 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 04:04:41,421 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:04:41,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:04:41,421 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:04:41,422 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:04:41,422 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:04:41,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:04:41,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:04:41,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:04:41,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:04:41,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:04:41,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:04:41,422 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:04:41,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:04:41,422 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 04:04:41,423 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 04:04:41,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:04:41,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:04:41,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:04:41,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:04:41,423 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> ad157bb59ab2340bd84ae4f3e0fc67d889cafb8dcb0637d5b8ca503c84568a53 [2025-03-17 04:04:41,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:04:41,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:04:41,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:04:41,643 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:04:41,643 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:04:41,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-60.i [2025-03-17 04:04:42,795 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/302a732a0/f87fc5fb227c45d3aaae26da571c2b80/FLAG6bd4f297f [2025-03-17 04:04:42,962 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:04:42,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-60.i [2025-03-17 04:04:42,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/302a732a0/f87fc5fb227c45d3aaae26da571c2b80/FLAG6bd4f297f [2025-03-17 04:04:42,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/302a732a0/f87fc5fb227c45d3aaae26da571c2b80 [2025-03-17 04:04:42,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:04:42,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:04:42,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:04:42,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:04:42,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:04:42,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:04:42" (1/1) ... [2025-03-17 04:04:42,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da4404c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:42, skipping insertion in model container [2025-03-17 04:04:42,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:04:42" (1/1) ... [2025-03-17 04:04:43,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:04:43,111 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-60.i[915,928] [2025-03-17 04:04:43,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:04:43,172 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:04:43,180 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-60.i[915,928] [2025-03-17 04:04:43,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:04:43,226 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:04:43,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:43 WrapperNode [2025-03-17 04:04:43,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:04:43,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:04:43,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:04:43,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:04:43,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:43" (1/1) ... [2025-03-17 04:04:43,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:43" (1/1) ... [2025-03-17 04:04:43,268 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2025-03-17 04:04:43,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:04:43,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:04:43,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:04:43,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:04:43,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:43" (1/1) ... [2025-03-17 04:04:43,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:43" (1/1) ... [2025-03-17 04:04:43,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:43" (1/1) ... [2025-03-17 04:04:43,300 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]. [2025-03-17 04:04:43,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:43" (1/1) ... [2025-03-17 04:04:43,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:43" (1/1) ... [2025-03-17 04:04:43,314 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:43" (1/1) ... [2025-03-17 04:04:43,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:43" (1/1) ... [2025-03-17 04:04:43,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:43" (1/1) ... [2025-03-17 04:04:43,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:43" (1/1) ... [2025-03-17 04:04:43,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:04:43,324 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:04:43,327 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:04:43,327 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:04:43,328 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:43" (1/1) ... [2025-03-17 04:04:43,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:04:43,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:04:43,357 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) [2025-03-17 04:04:43,359 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 [2025-03-17 04:04:43,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:04:43,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 04:04:43,377 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:04:43,377 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:04:43,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:04:43,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:04:43,430 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:04:43,432 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:04:57,619 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 04:04:57,619 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:04:57,626 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:04:57,626 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:04:57,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:04:57 BoogieIcfgContainer [2025-03-17 04:04:57,626 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:04:57,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:04:57,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:04:57,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:04:57,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:04:42" (1/3) ... [2025-03-17 04:04:57,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6357af7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:04:57, skipping insertion in model container [2025-03-17 04:04:57,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:04:43" (2/3) ... [2025-03-17 04:04:57,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6357af7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:04:57, skipping insertion in model container [2025-03-17 04:04:57,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:04:57" (3/3) ... [2025-03-17 04:04:57,633 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-60.i [2025-03-17 04:04:57,641 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:04:57,643 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-60.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:04:57,679 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:04:57,685 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;@685c25b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:04:57,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:04:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 04:04:57,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 04:04:57,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:04:57,697 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:04:57,697 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:04:57,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:04:57,700 INFO L85 PathProgramCache]: Analyzing trace with hash -534886260, now seen corresponding path program 1 times [2025-03-17 04:04:57,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:04:57,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91405819] [2025-03-17 04:04:57,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:04:57,707 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 [2025-03-17 04:04:57,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:04:57,709 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) [2025-03-17 04:04:57,710 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 [2025-03-17 04:04:57,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 04:04:58,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 04:04:58,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:04:58,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:04:58,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:04:58,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:04:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 04:04:58,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:04:58,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:04:58,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91405819] [2025-03-17 04:04:58,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91405819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:04:58,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:04:58,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:04:58,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719868910] [2025-03-17 04:04:58,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:04:58,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:04:58,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:04:58,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:04:58,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:04:58,627 INFO L87 Difference]: Start difference. First operand has 60 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 04:04:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:04:58,644 INFO L93 Difference]: Finished difference Result 117 states and 208 transitions. [2025-03-17 04:04:58,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:04:58,645 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2025-03-17 04:04:58,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:04:58,649 INFO L225 Difference]: With dead ends: 117 [2025-03-17 04:04:58,650 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 04:04:58,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:04:58,653 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:04:58,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:04:58,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 04:04:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-17 04:04:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 04:04:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 89 transitions. [2025-03-17 04:04:58,693 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 89 transitions. Word has length 135 [2025-03-17 04:04:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:04:58,694 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 89 transitions. [2025-03-17 04:04:58,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 04:04:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 89 transitions. [2025-03-17 04:04:58,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 04:04:58,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:04:58,698 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:04:58,723 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 [2025-03-17 04:04:58,899 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 [2025-03-17 04:04:58,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:04:58,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:04:58,900 INFO L85 PathProgramCache]: Analyzing trace with hash 79444848, now seen corresponding path program 1 times [2025-03-17 04:04:58,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:04:58,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600187410] [2025-03-17 04:04:58,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:04:58,900 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 [2025-03-17 04:04:58,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:04:58,902 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) [2025-03-17 04:04:58,903 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 [2025-03-17 04:04:58,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 04:04:59,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 04:04:59,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:04:59,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:04:59,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 04:04:59,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:05:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 04:05:09,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:05:09,199 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:05:09,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600187410] [2025-03-17 04:05:09,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600187410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:05:09,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:05:09,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:05:09,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177567849] [2025-03-17 04:05:09,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:05:09,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:05:09,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:05:09,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:05:09,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:05:09,201 INFO L87 Difference]: Start difference. First operand 58 states and 89 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 04:05:15,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:05:19,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:05:24,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:05:28,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:05:32,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:05:36,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:05:42,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:05:46,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:05:50,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:05:54,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:05:58,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:06:02,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:06:02,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:06:02,858 INFO L93 Difference]: Finished difference Result 175 states and 270 transitions. [2025-03-17 04:06:02,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:06:02,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 135 [2025-03-17 04:06:02,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:06:02,943 INFO L225 Difference]: With dead ends: 175 [2025-03-17 04:06:02,943 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 04:06:02,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:06:02,944 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 48 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 46 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:06:02,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 216 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 48 Invalid, 12 Unknown, 0 Unchecked, 53.5s Time] [2025-03-17 04:06:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 04:06:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2025-03-17 04:06:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 56 states have internal predecessors, (69), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 04:06:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2025-03-17 04:06:02,967 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 135 [2025-03-17 04:06:02,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:06:02,967 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2025-03-17 04:06:02,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 04:06:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2025-03-17 04:06:02,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 04:06:02,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:06:02,968 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:06:02,994 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 [2025-03-17 04:06:03,169 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 [2025-03-17 04:06:03,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:06:03,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:06:03,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1587854221, now seen corresponding path program 1 times [2025-03-17 04:06:03,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:06:03,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983389985] [2025-03-17 04:06:03,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:06:03,171 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 [2025-03-17 04:06:03,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:06:03,173 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) [2025-03-17 04:06:03,173 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 [2025-03-17 04:06:03,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 04:06:04,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 04:06:04,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:06:04,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:06:04,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 04:06:04,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:06:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 04:06:10,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:06:10,608 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:06:10,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983389985] [2025-03-17 04:06:10,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983389985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:06:10,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:06:10,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:06:10,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753463612] [2025-03-17 04:06:10,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:06:10,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:06:10,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:06:10,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:06:10,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:06:10,612 INFO L87 Difference]: Start difference. First operand 103 states and 157 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 04:06:16,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []