./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_codestructure_steplocals_file-11.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 ebeb5cc386d7505a158903e5b70d0f6301aafddfa314d0b5e6dafaafd876bfb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:57:43,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:57:43,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 18:57:43,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:57:43,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:57:43,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:57:43,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:57:43,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:57:43,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:57:43,789 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:57:43,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:57:43,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:57:43,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:57:43,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:57:43,789 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:57:43,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:57:43,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:57:43,789 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:57:43,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:57:43,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:57:43,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:57:43,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:57:43,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:57:43,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:57:43,789 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:57:43,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:57:43,790 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:57:43,790 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:57:43,790 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:57:43,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:57:43,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:57:43,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:57:43,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:57:43,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:57:43,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:57:43,790 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:57:43,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:57:43,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:57:43,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:57:43,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:57:43,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:57:43,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:57:43,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:57:43,791 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 -> ebeb5cc386d7505a158903e5b70d0f6301aafddfa314d0b5e6dafaafd876bfb3 [2025-03-03 18:57:44,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:57:44,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:57:44,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:57:44,024 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:57:44,024 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:57:44,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i [2025-03-03 18:57:45,175 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c78bdd78/86fb3c768c474970abd1f5cee4544a3b/FLAG435b57d3b [2025-03-03 18:57:45,433 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:57:45,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i [2025-03-03 18:57:45,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c78bdd78/86fb3c768c474970abd1f5cee4544a3b/FLAG435b57d3b [2025-03-03 18:57:45,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c78bdd78/86fb3c768c474970abd1f5cee4544a3b [2025-03-03 18:57:45,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:57:45,471 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:57:45,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:57:45,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:57:45,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:57:45,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:57:45" (1/1) ... [2025-03-03 18:57:45,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a72b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:57:45, skipping insertion in model container [2025-03-03 18:57:45,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:57:45" (1/1) ... [2025-03-03 18:57:45,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:57:45,597 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_codestructure_steplocals_file-11.i[917,930] [2025-03-03 18:57:45,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:57:45,657 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:57:45,664 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_codestructure_steplocals_file-11.i[917,930] [2025-03-03 18:57:45,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:57:45,688 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:57:45,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:57:45 WrapperNode [2025-03-03 18:57:45,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:57:45,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:57:45,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:57:45,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:57:45,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:57:45" (1/1) ... [2025-03-03 18:57:45,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:57:45" (1/1) ... [2025-03-03 18:57:45,720 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2025-03-03 18:57:45,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:57:45,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:57:45,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:57:45,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:57:45,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:57:45" (1/1) ... [2025-03-03 18:57:45,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:57:45" (1/1) ... [2025-03-03 18:57:45,730 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:57:45" (1/1) ... [2025-03-03 18:57:45,740 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-03 18:57:45,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:57:45" (1/1) ... [2025-03-03 18:57:45,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:57:45" (1/1) ... [2025-03-03 18:57:45,747 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:57:45" (1/1) ... [2025-03-03 18:57:45,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:57:45" (1/1) ... [2025-03-03 18:57:45,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:57:45" (1/1) ... [2025-03-03 18:57:45,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:57:45" (1/1) ... [2025-03-03 18:57:45,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:57:45,752 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:57:45,752 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:57:45,752 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:57:45,753 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:57:45" (1/1) ... [2025-03-03 18:57:45,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:57:45,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:57:45,776 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-03 18:57:45,778 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-03 18:57:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:57:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:57:45,794 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:57:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:57:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:57:45,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:57:45,844 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:57:45,846 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:57:46,050 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 18:57:46,050 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:57:46,060 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:57:46,060 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:57:46,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:57:46 BoogieIcfgContainer [2025-03-03 18:57:46,061 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:57:46,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:57:46,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:57:46,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:57:46,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:57:45" (1/3) ... [2025-03-03 18:57:46,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cbda00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:57:46, skipping insertion in model container [2025-03-03 18:57:46,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:57:45" (2/3) ... [2025-03-03 18:57:46,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cbda00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:57:46, skipping insertion in model container [2025-03-03 18:57:46,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:57:46" (3/3) ... [2025-03-03 18:57:46,069 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-11.i [2025-03-03 18:57:46,079 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:57:46,080 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-11.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:57:46,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:57:46,130 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;@7f5a698e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:57:46,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:57:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 18:57:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 18:57:46,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:57:46,147 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:57:46,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:57:46,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:57:46,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2124740957, now seen corresponding path program 1 times [2025-03-03 18:57:46,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:57:46,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769696811] [2025-03-03 18:57:46,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:57:46,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:57:46,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 18:57:46,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 18:57:46,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:57:46,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:57:46,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 18:57:46,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:57:46,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769696811] [2025-03-03 18:57:46,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769696811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:57:46,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127538457] [2025-03-03 18:57:46,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:57:46,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:57:46,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:57:46,393 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-03 18:57:46,394 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-03 18:57:46,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 18:57:46,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 18:57:46,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:57:46,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:57:46,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:57:46,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:57:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 18:57:46,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:57:46,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127538457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:57:46,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:57:46,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 18:57:46,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996066363] [2025-03-03 18:57:46,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:57:46,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:57:46,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:57:46,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:57:46,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:57:46,587 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 18:57:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:57:46,603 INFO L93 Difference]: Finished difference Result 126 states and 218 transitions. [2025-03-03 18:57:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:57:46,604 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2025-03-03 18:57:46,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:57:46,609 INFO L225 Difference]: With dead ends: 126 [2025-03-03 18:57:46,609 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 18:57:46,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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-03 18:57:46,613 INFO L435 NwaCegarLoop]: 95 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, 95 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-03 18:57:46,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:57:46,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 18:57:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-03 18:57:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 18:57:46,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2025-03-03 18:57:46,644 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 144 [2025-03-03 18:57:46,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:57:46,644 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2025-03-03 18:57:46,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 18:57:46,644 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2025-03-03 18:57:46,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 18:57:46,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:57:46,647 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:57:46,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 18:57:46,848 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-03 18:57:46,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:57:46,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:57:46,849 INFO L85 PathProgramCache]: Analyzing trace with hash 710228064, now seen corresponding path program 1 times [2025-03-03 18:57:46,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:57:46,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323837813] [2025-03-03 18:57:46,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:57:46,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:57:46,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 18:57:46,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 18:57:46,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:57:46,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:57:47,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 18:57:47,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:57:47,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323837813] [2025-03-03 18:57:47,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323837813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:57:47,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:57:47,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 18:57:47,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530255727] [2025-03-03 18:57:47,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:57:47,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 18:57:47,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:57:47,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 18:57:47,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:57:47,051 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 18:57:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:57:47,081 INFO L93 Difference]: Finished difference Result 135 states and 202 transitions. [2025-03-03 18:57:47,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 18:57:47,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 144 [2025-03-03 18:57:47,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:57:47,084 INFO L225 Difference]: With dead ends: 135 [2025-03-03 18:57:47,085 INFO L226 Difference]: Without dead ends: 75 [2025-03-03 18:57:47,085 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-03 18:57:47,086 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 13 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 177 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-03 18:57:47,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 177 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:57:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-03 18:57:47,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2025-03-03 18:57:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 18:57:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-03-03 18:57:47,100 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 144 [2025-03-03 18:57:47,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:57:47,101 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-03-03 18:57:47,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 18:57:47,101 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-03-03 18:57:47,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 18:57:47,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:57:47,103 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:57:47,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:57:47,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:57:47,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:57:47,103 INFO L85 PathProgramCache]: Analyzing trace with hash 711151585, now seen corresponding path program 1 times [2025-03-03 18:57:47,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:57:47,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850709277] [2025-03-03 18:57:47,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:57:47,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:57:47,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 18:57:47,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 18:57:47,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:57:47,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:57:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 18:57:47,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:57:47,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850709277] [2025-03-03 18:57:47,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850709277] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:57:47,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307886024] [2025-03-03 18:57:47,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:57:47,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:57:47,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:57:47,857 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-03 18:57:47,858 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-03 18:57:47,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 18:57:48,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 18:57:48,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:57:48,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:57:48,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-03 18:57:48,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:57:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 681 proven. 191 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-03 18:57:50,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:57:51,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307886024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:57:51,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:57:51,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 26] total 33 [2025-03-03 18:57:51,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8466592] [2025-03-03 18:57:51,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:57:51,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 18:57:51,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:57:51,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 18:57:51,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=2039, Unknown=0, NotChecked=0, Total=2652 [2025-03-03 18:57:51,497 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 33 states, 32 states have (on average 2.34375) internal successors, (75), 28 states have internal predecessors, (75), 12 states have call successors, (42), 9 states have call predecessors, (42), 11 states have return successors, (42), 12 states have call predecessors, (42), 12 states have call successors, (42) [2025-03-03 18:57:53,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:57:53,016 INFO L93 Difference]: Finished difference Result 199 states and 276 transitions. [2025-03-03 18:57:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 18:57:53,017 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.34375) internal successors, (75), 28 states have internal predecessors, (75), 12 states have call successors, (42), 9 states have call predecessors, (42), 11 states have return successors, (42), 12 states have call predecessors, (42), 12 states have call successors, (42) Word has length 144 [2025-03-03 18:57:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:57:53,018 INFO L225 Difference]: With dead ends: 199 [2025-03-03 18:57:53,018 INFO L226 Difference]: Without dead ends: 135 [2025-03-03 18:57:53,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1803, Invalid=5003, Unknown=0, NotChecked=0, Total=6806 [2025-03-03 18:57:53,022 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 244 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:57:53,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 531 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:57:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-03 18:57:53,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2025-03-03 18:57:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 90 states have internal predecessors, (113), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 18:57:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 171 transitions. [2025-03-03 18:57:53,034 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 171 transitions. Word has length 144 [2025-03-03 18:57:53,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:57:53,035 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 171 transitions. [2025-03-03 18:57:53,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.34375) internal successors, (75), 28 states have internal predecessors, (75), 12 states have call successors, (42), 9 states have call predecessors, (42), 11 states have return successors, (42), 12 states have call predecessors, (42), 12 states have call successors, (42) [2025-03-03 18:57:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 171 transitions. [2025-03-03 18:57:53,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 18:57:53,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:57:53,037 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:57:53,043 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-03 18:57:53,241 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-03 18:57:53,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:57:53,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:57:53,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1085799774, now seen corresponding path program 1 times [2025-03-03 18:57:53,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:57:53,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620448973] [2025-03-03 18:57:53,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:57:53,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:57:53,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 18:57:53,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 18:57:53,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:57:53,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:57:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 18:57:53,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:57:53,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620448973] [2025-03-03 18:57:53,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620448973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:57:53,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365070235] [2025-03-03 18:57:53,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:57:53,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:57:53,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:57:53,597 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-03 18:57:53,598 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-03 18:57:53,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 18:57:54,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 18:57:54,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:57:54,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:57:54,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 18:57:54,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:57:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 758 proven. 108 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-03 18:57:55,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:57:55,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365070235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:57:55,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:57:55,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 25 [2025-03-03 18:57:55,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122846646] [2025-03-03 18:57:55,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:57:55,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 18:57:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:57:55,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 18:57:55,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1081, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 18:57:55,927 INFO L87 Difference]: Start difference. First operand 128 states and 171 transitions. Second operand has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 11 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2025-03-03 18:57:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:57:56,490 INFO L93 Difference]: Finished difference Result 257 states and 343 transitions. [2025-03-03 18:57:56,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 18:57:56,491 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 11 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) Word has length 144 [2025-03-03 18:57:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:57:56,492 INFO L225 Difference]: With dead ends: 257 [2025-03-03 18:57:56,492 INFO L226 Difference]: Without dead ends: 132 [2025-03-03 18:57:56,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=705, Invalid=1845, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 18:57:56,494 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 83 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:57:56,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 282 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:57:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-03 18:57:56,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2025-03-03 18:57:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 90 states have internal predecessors, (112), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 18:57:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 170 transitions. [2025-03-03 18:57:56,510 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 170 transitions. Word has length 144 [2025-03-03 18:57:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:57:56,510 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 170 transitions. [2025-03-03 18:57:56,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 11 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2025-03-03 18:57:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 170 transitions. [2025-03-03 18:57:56,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 18:57:56,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:57:56,514 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:57:56,521 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-03 18:57:56,715 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-03 18:57:56,715 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:57:56,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:57:56,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1902633634, now seen corresponding path program 1 times [2025-03-03 18:57:56,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:57:56,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108210849] [2025-03-03 18:57:56,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:57:56,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:57:56,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 18:57:56,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 18:57:56,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:57:56,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:57:56,804 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:57:56,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 18:57:56,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 18:57:56,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:57:56,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:57:56,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:57:56,912 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:57:56,913 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:57:56,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:57:56,920 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 18:57:57,004 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:57:57,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:57:57 BoogieIcfgContainer [2025-03-03 18:57:57,010 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:57:57,011 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:57:57,011 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:57:57,011 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:57:57,012 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:57:46" (3/4) ... [2025-03-03 18:57:57,013 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:57:57,014 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:57:57,015 INFO L158 Benchmark]: Toolchain (without parser) took 11544.04ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 125.7MB in the beginning and 204.6MB in the end (delta: -78.9MB). Peak memory consumption was 121.0MB. Max. memory is 16.1GB. [2025-03-03 18:57:57,015 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:57:57,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.13ms. Allocated memory is still 167.8MB. Free memory was 125.7MB in the beginning and 112.1MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:57:57,016 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.88ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 110.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:57:57,016 INFO L158 Benchmark]: Boogie Preprocessor took 29.93ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 107.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:57:57,016 INFO L158 Benchmark]: IcfgBuilder took 308.71ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 88.8MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:57:57,017 INFO L158 Benchmark]: TraceAbstraction took 10946.81ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 87.9MB in the beginning and 204.7MB in the end (delta: -116.7MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. [2025-03-03 18:57:57,017 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 377.5MB. Free memory was 204.7MB in the beginning and 204.6MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:57:57,018 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.64ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.13ms. Allocated memory is still 167.8MB. Free memory was 125.7MB in the beginning and 112.1MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.88ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 110.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.93ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 107.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 308.71ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 88.8MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10946.81ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 87.9MB in the beginning and 204.7MB in the end (delta: -116.7MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 377.5MB. Free memory was 204.7MB in the beginning and 204.6MB in the end (delta: 78.1kB). 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 73, overapproximation of someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someUnaryDOUBLEoperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 129. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed short int var_1_5 = -256; [L27] signed short int var_1_6 = 4; [L28] signed char var_1_7 = 0; [L29] signed char var_1_8 = 16; [L30] signed char var_1_9 = 4; [L31] unsigned long int var_1_10 = 128; [L32] unsigned long int var_1_11 = 1422462314; [L33] signed short int var_1_12 = 8; [L34] float var_1_13 = 49.5; [L35] float var_1_14 = 0.4; [L36] signed short int var_1_15 = -50; [L37] unsigned long int var_1_16 = 1; [L38] unsigned long int var_1_17 = 3609236770; [L39] unsigned long int var_1_18 = 2902762324; [L40] double var_1_19 = 3.8; [L41] double var_1_20 = 255.75; [L42] unsigned short int var_1_21 = 0; VAL [isInitial=0, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] FCALL updateLastVariables() [L137] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L91] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L91] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L92] var_1_3 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L93] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L94] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L94] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L95] var_1_5 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L96] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L97] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L97] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L98] var_1_6 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_6 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L99] RET assume_abort_if_not(var_1_6 >= -32768) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L100] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=16, var_1_9=4] [L101] var_1_7 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=16, var_1_9=4] [L102] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=16, var_1_9=4] [L103] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=16, var_1_9=4] [L103] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=16, var_1_9=4] [L104] var_1_8 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=4] [L105] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=4] [L106] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=4] [L106] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=4] [L107] var_1_9 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L108] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L109] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L109] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L110] var_1_11 = __VERIFIER_nondet_ulong() [L111] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L111] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L112] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L112] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L113] var_1_13 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L114] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L115] var_1_14 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L116] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L117] var_1_17 = __VERIFIER_nondet_ulong() [L118] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L118] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L119] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L120] var_1_18 = __VERIFIER_nondet_ulong() [L121] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L121] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L122] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L123] var_1_20 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L124] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L137] RET updateVariables() [L138] CALL step() [L46] var_1_1 = (var_1_2 || (! var_1_3)) VAL [isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L47] COND TRUE var_1_5 == var_1_6 [L48] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=70, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L50] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L51] unsigned long int stepLocal_1 = var_1_10; [L52] signed char stepLocal_0 = var_1_8; VAL [isInitial=1, stepLocal_0=62, stepLocal_1=2953285049, var_1_10=2953285049, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=70, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L53] COND TRUE var_1_6 != stepLocal_1 VAL [isInitial=1, stepLocal_0=62, var_1_10=2953285049, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=70, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L54] COND FALSE !(stepLocal_0 <= var_1_6) VAL [isInitial=1, var_1_10=2953285049, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=70, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L62] COND FALSE !(\read(var_1_2)) [L71] var_1_15 = 5 VAL [isInitial=1, var_1_10=2953285049, var_1_11=1073741823, var_1_12=8, var_1_15=5, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=70, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L73] COND TRUE var_1_13 != var_1_14 [L74] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, var_1_10=2953285049, var_1_11=1073741823, var_1_12=8, var_1_15=5, var_1_16=125, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=70, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L82] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) [L83] unsigned char stepLocal_2 = var_1_12 == (var_1_8 - var_1_9); VAL [isInitial=1, stepLocal_2=0, var_1_10=2953285049, var_1_11=1073741823, var_1_12=8, var_1_15=5, var_1_16=125, var_1_17=4294967294, var_1_18=6442450943, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=70, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L84] COND FALSE !(stepLocal_2 && var_1_2) VAL [isInitial=1, var_1_10=2953285049, var_1_11=1073741823, var_1_12=8, var_1_15=5, var_1_16=125, var_1_17=4294967294, var_1_18=6442450943, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=70, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L138] RET step() [L139] CALL, EXPR property() [L129-L130] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_5 == var_1_6) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((var_1_6 != var_1_10) ? ((var_1_8 <= var_1_6) ? (((- var_1_13) >= var_1_14) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_2 ? ((var_1_13 >= var_1_14) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_13 != var_1_14) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_5 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_12 == (var_1_8 - var_1_9)) && var_1_2) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; VAL [\result=0, isInitial=1, var_1_10=2953285049, var_1_11=1073741823, var_1_12=8, var_1_15=5, var_1_16=125, var_1_17=4294967294, var_1_18=6442450943, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=70, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2953285049, var_1_11=1073741823, var_1_12=8, var_1_15=5, var_1_16=125, var_1_17=4294967294, var_1_18=6442450943, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=70, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=2953285049, var_1_11=1073741823, var_1_12=8, var_1_15=5, var_1_16=125, var_1_17=4294967294, var_1_18=6442450943, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=70, var_1_5=8, var_1_6=8, var_1_7=63, var_1_8=62, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 348 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 340 mSDsluCounter, 1085 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 774 mSDsCounter, 272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1352 IncrementalHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 272 mSolverCounterUnsat, 311 mSDtfsCounter, 1352 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 691 GetRequests, 558 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2562 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=3, InterpolantAutomatonStates: 60, 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, 4 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1153 NumberOfCodeBlocks, 1153 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1001 ConstructedInterpolants, 0 QuantifiedInterpolants, 6821 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1005 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 6699/7084 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-03 18:57:57,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_codestructure_steplocals_file-11.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 ebeb5cc386d7505a158903e5b70d0f6301aafddfa314d0b5e6dafaafd876bfb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:57:58,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:57:58,911 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 18:57:58,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:57:58,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:57:58,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:57:58,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:57:58,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:57:58,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:57:58,944 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:57:58,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:57:58,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:57:58,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:57:58,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:57:58,945 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:57:58,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:57:58,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:57:58,946 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:57:58,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:57:58,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:57:58,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:57:58,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:57:58,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:57:58,946 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:57:58,946 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:57:58,946 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:57:58,946 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:57:58,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:57:58,947 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:57:58,947 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:57:58,947 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:57:58,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:57:58,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:57:58,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:57:58,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:57:58,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:57:58,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:57:58,948 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:57:58,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:57:58,948 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:57:58,948 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:57:58,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:57:58,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:57:58,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:57:58,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:57:58,948 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 -> ebeb5cc386d7505a158903e5b70d0f6301aafddfa314d0b5e6dafaafd876bfb3 [2025-03-03 18:57:59,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:57:59,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:57:59,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:57:59,209 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:57:59,209 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:57:59,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i [2025-03-03 18:58:00,424 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fec798f11/42aa912f12404f89981793f26bfde6cf/FLAGfb62dcf0f [2025-03-03 18:58:00,623 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:58:00,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-11.i [2025-03-03 18:58:00,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fec798f11/42aa912f12404f89981793f26bfde6cf/FLAGfb62dcf0f [2025-03-03 18:58:00,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fec798f11/42aa912f12404f89981793f26bfde6cf [2025-03-03 18:58:00,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:58:00,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:58:00,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:58:00,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:58:01,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:58:01,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:58:00" (1/1) ... [2025-03-03 18:58:01,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198bf93f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:58:01, skipping insertion in model container [2025-03-03 18:58:01,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:58:00" (1/1) ... [2025-03-03 18:58:01,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:58:01,118 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_codestructure_steplocals_file-11.i[917,930] [2025-03-03 18:58:01,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:58:01,168 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:58:01,175 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_codestructure_steplocals_file-11.i[917,930] [2025-03-03 18:58:01,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:58:01,209 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:58:01,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:58:01 WrapperNode [2025-03-03 18:58:01,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:58:01,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:58:01,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:58:01,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:58:01,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:58:01" (1/1) ... [2025-03-03 18:58:01,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:58:01" (1/1) ... [2025-03-03 18:58:01,238 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2025-03-03 18:58:01,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:58:01,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:58:01,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:58:01,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:58:01,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:58:01" (1/1) ... [2025-03-03 18:58:01,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:58:01" (1/1) ... [2025-03-03 18:58:01,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:58:01" (1/1) ... [2025-03-03 18:58:01,255 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:58:01,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:58:01" (1/1) ... [2025-03-03 18:58:01,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:58:01" (1/1) ... [2025-03-03 18:58:01,262 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:58:01" (1/1) ... [2025-03-03 18:58:01,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:58:01" (1/1) ... [2025-03-03 18:58:01,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:58:01" (1/1) ... [2025-03-03 18:58:01,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:58:01" (1/1) ... [2025-03-03 18:58:01,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:58:01,267 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:58:01,267 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:58:01,267 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:58:01,268 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:58:01" (1/1) ... [2025-03-03 18:58:01,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:58:01,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:58:01,294 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-03 18:58:01,298 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-03 18:58:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:58:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:58:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:58:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:58:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:58:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:58:01,369 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:58:01,370 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:58:01,614 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 18:58:01,614 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:58:01,621 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:58:01,621 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:58:01,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:58:01 BoogieIcfgContainer [2025-03-03 18:58:01,622 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:58:01,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:58:01,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:58:01,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:58:01,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:58:00" (1/3) ... [2025-03-03 18:58:01,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7565fe04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:58:01, skipping insertion in model container [2025-03-03 18:58:01,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:58:01" (2/3) ... [2025-03-03 18:58:01,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7565fe04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:58:01, skipping insertion in model container [2025-03-03 18:58:01,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:58:01" (3/3) ... [2025-03-03 18:58:01,629 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-11.i [2025-03-03 18:58:01,639 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:58:01,640 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-11.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:58:01,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:58:01,681 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;@de74a88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:58:01,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:58:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 18:58:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 18:58:01,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:58:01,695 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:58:01,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:58:01,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:58:01,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2124740957, now seen corresponding path program 1 times [2025-03-03 18:58:01,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:58:01,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332712081] [2025-03-03 18:58:01,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:58:01,710 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-03 18:58:01,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:58:01,712 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-03 18:58:01,714 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-03 18:58:01,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 18:58:01,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 18:58:01,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:58:01,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:58:01,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:58:01,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:58:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-03-03 18:58:01,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:58:01,989 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:58:01,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332712081] [2025-03-03 18:58:01,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332712081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:58:01,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:58:01,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 18:58:01,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205429843] [2025-03-03 18:58:01,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:58:01,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:58:01,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:58:02,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:58:02,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:58:02,013 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 18:58:02,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:58:02,033 INFO L93 Difference]: Finished difference Result 126 states and 218 transitions. [2025-03-03 18:58:02,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:58:02,035 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2025-03-03 18:58:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:58:02,039 INFO L225 Difference]: With dead ends: 126 [2025-03-03 18:58:02,039 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 18:58:02,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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-03 18:58:02,045 INFO L435 NwaCegarLoop]: 95 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, 95 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-03 18:58:02,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:58:02,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 18:58:02,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-03 18:58:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 18:58:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2025-03-03 18:58:02,082 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 144 [2025-03-03 18:58:02,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:58:02,082 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2025-03-03 18:58:02,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 18:58:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2025-03-03 18:58:02,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 18:58:02,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:58:02,089 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:58:02,096 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-03 18:58:02,292 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-03 18:58:02,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:58:02,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:58:02,294 INFO L85 PathProgramCache]: Analyzing trace with hash 710228064, now seen corresponding path program 1 times [2025-03-03 18:58:02,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:58:02,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978564154] [2025-03-03 18:58:02,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:58:02,295 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-03 18:58:02,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:58:02,297 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-03 18:58:02,298 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-03 18:58:02,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 18:58:02,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 18:58:02,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:58:02,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:58:02,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 18:58:02,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:58:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 18:58:02,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:58:02,486 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:58:02,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978564154] [2025-03-03 18:58:02,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978564154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:58:02,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:58:02,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 18:58:02,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738500200] [2025-03-03 18:58:02,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:58:02,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 18:58:02,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:58:02,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 18:58:02,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:58:02,489 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 18:58:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:58:02,533 INFO L93 Difference]: Finished difference Result 135 states and 202 transitions. [2025-03-03 18:58:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 18:58:02,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 144 [2025-03-03 18:58:02,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:58:02,535 INFO L225 Difference]: With dead ends: 135 [2025-03-03 18:58:02,535 INFO L226 Difference]: Without dead ends: 75 [2025-03-03 18:58:02,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 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-03 18:58:02,536 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 13 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:58:02,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 176 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:58:02,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-03 18:58:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2025-03-03 18:58:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 18:58:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-03-03 18:58:02,551 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 144 [2025-03-03 18:58:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:58:02,552 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-03-03 18:58:02,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 18:58:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-03-03 18:58:02,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 18:58:02,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:58:02,555 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:58:02,561 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-03 18:58:02,755 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-03 18:58:02,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:58:02,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:58:02,756 INFO L85 PathProgramCache]: Analyzing trace with hash 711151585, now seen corresponding path program 1 times [2025-03-03 18:58:02,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:58:02,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157876131] [2025-03-03 18:58:02,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:58:02,758 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-03 18:58:02,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:58:02,760 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-03 18:58:02,762 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-03 18:58:02,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 18:58:02,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 18:58:02,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:58:02,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:58:02,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 18:58:02,911 INFO L279 TraceCheckSpWp]: Computing forward predicates...