./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-7.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_loopvsstraightlinecode_25-1loop_file-7.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 648d197bd9e5d325bfbd4ba63b1498edcdaa8a19265c026c3c04bed53d00cdaa --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:12:42,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:12:42,493 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:12:42,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:12:42,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:12:42,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:12:42,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:12:42,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:12:42,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:12:42,523 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:12:42,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:12:42,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:12:42,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:12:42,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:12:42,524 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:12:42,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:12:42,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:12:42,524 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:12:42,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:12:42,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:12:42,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:12:42,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:12:42,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:12:42,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:12:42,525 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:12:42,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:12:42,525 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:12:42,525 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:12:42,525 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:12:42,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:12:42,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:12:42,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:12:42,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:12:42,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:12:42,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:12:42,526 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:12:42,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:12:42,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:12:42,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:12:42,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:12:42,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:12:42,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:12:42,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:12:42,527 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 -> 648d197bd9e5d325bfbd4ba63b1498edcdaa8a19265c026c3c04bed53d00cdaa [2025-03-03 23:12:42,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:12:42,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:12:42,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:12:42,755 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:12:42,756 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:12:42,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-7.i [2025-03-03 23:12:43,887 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25806c58c/d1a9437719ad4c00925e2f5c2806a433/FLAGcfea52f97 [2025-03-03 23:12:44,140 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:12:44,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-7.i [2025-03-03 23:12:44,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25806c58c/d1a9437719ad4c00925e2f5c2806a433/FLAGcfea52f97 [2025-03-03 23:12:44,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25806c58c/d1a9437719ad4c00925e2f5c2806a433 [2025-03-03 23:12:44,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:12:44,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:12:44,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:12:44,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:12:44,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:12:44,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:12:44" (1/1) ... [2025-03-03 23:12:44,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:44, skipping insertion in model container [2025-03-03 23:12:44,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:12:44" (1/1) ... [2025-03-03 23:12:44,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:12:44,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-7.i[914,927] [2025-03-03 23:12:44,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:12:44,592 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:12:44,602 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-7.i[914,927] [2025-03-03 23:12:44,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:12:44,625 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:12:44,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:44 WrapperNode [2025-03-03 23:12:44,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:12:44,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:12:44,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:12:44,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:12:44,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:44" (1/1) ... [2025-03-03 23:12:44,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:44" (1/1) ... [2025-03-03 23:12:44,656 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2025-03-03 23:12:44,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:12:44,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:12:44,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:12:44,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:12:44,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:44" (1/1) ... [2025-03-03 23:12:44,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:44" (1/1) ... [2025-03-03 23:12:44,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:44" (1/1) ... [2025-03-03 23:12:44,682 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 23:12:44,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:44" (1/1) ... [2025-03-03 23:12:44,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:44" (1/1) ... [2025-03-03 23:12:44,689 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:44" (1/1) ... [2025-03-03 23:12:44,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:44" (1/1) ... [2025-03-03 23:12:44,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:44" (1/1) ... [2025-03-03 23:12:44,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:44" (1/1) ... [2025-03-03 23:12:44,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:12:44,697 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:12:44,697 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:12:44,697 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:12:44,698 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:44" (1/1) ... [2025-03-03 23:12:44,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:12:44,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:12:44,730 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 23:12:44,736 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 23:12:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:12:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:12:44,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:12:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:12:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:12:44,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:12:44,794 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:12:44,795 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:12:44,948 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 23:12:44,948 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:12:44,954 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:12:44,954 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:12:44,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:12:44 BoogieIcfgContainer [2025-03-03 23:12:44,955 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:12:44,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:12:44,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:12:44,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:12:44,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:12:44" (1/3) ... [2025-03-03 23:12:44,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b2af44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:12:44, skipping insertion in model container [2025-03-03 23:12:44,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:44" (2/3) ... [2025-03-03 23:12:44,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b2af44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:12:44, skipping insertion in model container [2025-03-03 23:12:44,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:12:44" (3/3) ... [2025-03-03 23:12:44,961 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-7.i [2025-03-03 23:12:44,970 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:12:44,971 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-7.i that has 2 procedures, 36 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:12:45,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:12:45,014 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;@5bf4ff86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:12:45,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:12:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 23:12:45,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 23:12:45,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:12:45,023 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 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 23:12:45,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:12:45,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:12:45,027 INFO L85 PathProgramCache]: Analyzing trace with hash -485224426, now seen corresponding path program 1 times [2025-03-03 23:12:45,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:12:45,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804909941] [2025-03-03 23:12:45,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:12:45,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:12:45,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 23:12:45,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 23:12:45,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:12:45,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:12:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 23:12:45,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:12:45,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804909941] [2025-03-03 23:12:45,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804909941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:12:45,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524097703] [2025-03-03 23:12:45,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:12:45,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:12:45,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:12:45,172 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 23:12:45,174 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 23:12:45,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 23:12:45,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 23:12:45,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:12:45,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:12:45,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:12:45,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:12:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 23:12:45,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:12:45,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524097703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:12:45,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:12:45,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:12:45,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550253757] [2025-03-03 23:12:45,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:12:45,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:12:45,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:12:45,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:12:45,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:12:45,292 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 23:12:45,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:12:45,306 INFO L93 Difference]: Finished difference Result 69 states and 101 transitions. [2025-03-03 23:12:45,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:12:45,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2025-03-03 23:12:45,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:12:45,311 INFO L225 Difference]: With dead ends: 69 [2025-03-03 23:12:45,311 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 23:12:45,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 49 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 23:12:45,318 INFO L435 NwaCegarLoop]: 46 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, 46 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 23:12:45,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:12:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 23:12:45,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-03 23:12:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 23:12:45,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2025-03-03 23:12:45,340 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 48 [2025-03-03 23:12:45,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:12:45,341 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-03-03 23:12:45,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 23:12:45,341 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2025-03-03 23:12:45,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 23:12:45,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:12:45,342 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 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 23:12:45,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:12:45,543 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 23:12:45,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:12:45,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:12:45,544 INFO L85 PathProgramCache]: Analyzing trace with hash 403101879, now seen corresponding path program 1 times [2025-03-03 23:12:45,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:12:45,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383796861] [2025-03-03 23:12:45,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:12:45,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:12:45,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 23:12:45,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 23:12:45,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:12:45,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:12:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 23:12:45,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:12:45,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383796861] [2025-03-03 23:12:45,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383796861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:12:45,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:12:45,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:12:45,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886856673] [2025-03-03 23:12:45,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:12:45,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:12:45,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:12:45,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:12:45,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:12:45,853 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 23:12:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:12:45,936 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2025-03-03 23:12:45,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:12:45,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 48 [2025-03-03 23:12:45,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:12:45,938 INFO L225 Difference]: With dead ends: 79 [2025-03-03 23:12:45,938 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 23:12:45,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:12:45,939 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 41 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:12:45,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 82 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:12:45,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 23:12:45,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2025-03-03 23:12:45,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 23:12:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-03-03 23:12:45,949 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 48 [2025-03-03 23:12:45,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:12:45,949 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-03-03 23:12:45,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 23:12:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-03-03 23:12:45,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 23:12:45,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:12:45,950 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 23:12:45,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:12:45,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:12:45,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:12:45,951 INFO L85 PathProgramCache]: Analyzing trace with hash -416387728, now seen corresponding path program 1 times [2025-03-03 23:12:45,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:12:45,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399878963] [2025-03-03 23:12:45,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:12:45,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:12:45,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 23:12:45,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 23:12:45,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:12:45,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:12:45,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:12:46,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 23:12:46,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 23:12:46,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:12:46,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:12:46,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:12:46,039 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:12:46,039 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:12:46,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:12:46,044 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 23:12:46,065 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:12:46,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:12:46 BoogieIcfgContainer [2025-03-03 23:12:46,067 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:12:46,068 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:12:46,068 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:12:46,068 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:12:46,068 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:12:44" (3/4) ... [2025-03-03 23:12:46,070 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:12:46,070 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:12:46,071 INFO L158 Benchmark]: Toolchain (without parser) took 1613.42ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 61.6MB in the end (delta: 43.2MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2025-03-03 23:12:46,071 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:12:46,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.34ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 93.3MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:12:46,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.60ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 90.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:12:46,071 INFO L158 Benchmark]: Boogie Preprocessor took 36.68ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:12:46,072 INFO L158 Benchmark]: IcfgBuilder took 257.46ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 75.3MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:12:46,072 INFO L158 Benchmark]: TraceAbstraction took 1111.19ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 61.6MB in the end (delta: 12.5MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2025-03-03 23:12:46,072 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 142.6MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:12:46,073 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.34ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 93.3MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.60ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 90.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.68ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 257.46ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 75.3MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1111.19ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 61.6MB in the end (delta: 12.5MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 142.6MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 41.6kB). 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 61, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 34, overapproximation of someBinaryDOUBLEComparisonOperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] float var_1_2 = 200.875; [L24] float var_1_3 = 8.2; [L25] float var_1_4 = 100000000000.4; [L26] unsigned char var_1_5 = 5; [L27] unsigned long int var_1_6 = 100; [L28] double var_1_9 = 4.6; [L29] double var_1_10 = 2.5; [L30] double last_1_var_1_9 = 4.6; VAL [isInitial=0, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_2=1607/8, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L80] isInitial = 1 [L81] FCALL initially() [L82] int k_loop; [L83] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_2=1607/8, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L83] COND TRUE k_loop < 1 [L84] CALL updateLastVariables() [L73] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_2=1607/8, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L84] RET updateLastVariables() [L85] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_float() [L61] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L61] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_3=41/5, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L62] var_1_3 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L63] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_4=500000000002/5, var_1_5=5, var_1_6=100, var_1_9=23/5] [L64] var_1_4 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=5, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=5, var_1_6=100, var_1_9=23/5] [L65] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=5, var_1_6=100, var_1_9=23/5] [L66] var_1_5 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_6=100, var_1_9=23/5] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_6=100, var_1_9=23/5] [L68] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=254, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=254, var_1_6=100, var_1_9=23/5] [L68] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=5/2, var_1_1=1, var_1_5=254, var_1_6=100, var_1_9=23/5] [L69] var_1_10 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_1=1, var_1_5=254, var_1_6=100, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=23/5, var_1_1=1, var_1_5=254, var_1_6=100, var_1_9=23/5] [L70] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=1, var_1_5=254, var_1_6=100, var_1_9=23/5] [L85] RET updateVariables() [L86] CALL step() [L34] COND FALSE !(! (last_1_var_1_9 <= (var_1_3 - var_1_4))) [L45] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=254, var_1_5=254, var_1_6=100, var_1_9=23/5] [L47] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=254, var_1_5=254, var_1_6=100, var_1_9=23/5] [L48] COND FALSE !(stepLocal_0 < 0) [L51] var_1_6 = ((((((var_1_5) > (var_1_1)) ? (var_1_5) : (var_1_1))) + ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) + var_1_1) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=254, var_1_5=254, var_1_6=762, var_1_9=23/5] [L53] COND TRUE var_1_1 <= var_1_6 VAL [isInitial=1, last_1_var_1_9=23/5, var_1_1=254, var_1_5=254, var_1_6=762, var_1_9=23/5] [L54] COND TRUE var_1_2 >= var_1_3 [L55] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=100000000005, var_1_1=254, var_1_5=254, var_1_6=762, var_1_9=100000000005] [L86] RET step() [L87] CALL, EXPR property() [L76-L77] return (((! (last_1_var_1_9 <= (var_1_3 - var_1_4))) ? ((last_1_var_1_9 < var_1_3) ? ((! (var_1_3 > last_1_var_1_9)) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && ((var_1_5 < 0) ? (var_1_6 == ((unsigned long int) var_1_5)) : (var_1_6 == ((unsigned long int) ((((((var_1_5) > (var_1_1)) ? (var_1_5) : (var_1_1))) + ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) + var_1_1))))) && ((var_1_1 <= var_1_6) ? ((var_1_2 >= var_1_3) ? (var_1_9 == ((double) var_1_10)) : 1) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_9=23/5, var_1_10=100000000005, var_1_1=254, var_1_5=254, var_1_6=762, var_1_9=100000000005] [L87] RET, EXPR property() [L87] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=100000000005, var_1_1=254, var_1_5=254, var_1_6=762, var_1_9=100000000005] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=23/5, var_1_10=100000000005, var_1_1=254, var_1_5=254, var_1_6=762, var_1_9=100000000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 98 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 184 SizeOfPredicates, 0 NumberOfNonLiveVariables, 128 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 170/180 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 23:12:46,087 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_loopvsstraightlinecode_25-1loop_file-7.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 648d197bd9e5d325bfbd4ba63b1498edcdaa8a19265c026c3c04bed53d00cdaa --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:12:47,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:12:47,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:12:47,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:12:47,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:12:47,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:12:47,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:12:47,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:12:47,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:12:47,848 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:12:47,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:12:47,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:12:47,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:12:47,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:12:47,848 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:12:47,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:12:47,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:12:47,849 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:12:47,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:12:47,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:12:47,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:12:47,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:12:47,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:12:47,849 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:12:47,849 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:12:47,849 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:12:47,849 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:12:47,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:12:47,849 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:12:47,849 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:12:47,850 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:12:47,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:12:47,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:12:47,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:12:47,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:12:47,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:12:47,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:12:47,850 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:12:47,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:12:47,850 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:12:47,850 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:12:47,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:12:47,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:12:47,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:12:47,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:12:47,851 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 -> 648d197bd9e5d325bfbd4ba63b1498edcdaa8a19265c026c3c04bed53d00cdaa [2025-03-03 23:12:48,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:12:48,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:12:48,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:12:48,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:12:48,062 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:12:48,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-7.i [2025-03-03 23:12:49,164 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45aaf664/f6b6ce20bbac439684005b807893b321/FLAG9654ad2f5 [2025-03-03 23:12:49,354 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:12:49,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-7.i [2025-03-03 23:12:49,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45aaf664/f6b6ce20bbac439684005b807893b321/FLAG9654ad2f5 [2025-03-03 23:12:49,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45aaf664/f6b6ce20bbac439684005b807893b321 [2025-03-03 23:12:49,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:12:49,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:12:49,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:12:49,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:12:49,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:12:49,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:12:49" (1/1) ... [2025-03-03 23:12:49,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f31ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:49, skipping insertion in model container [2025-03-03 23:12:49,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:12:49" (1/1) ... [2025-03-03 23:12:49,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:12:49,842 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-7.i[914,927] [2025-03-03 23:12:49,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:12:49,884 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:12:49,892 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-7.i[914,927] [2025-03-03 23:12:49,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:12:49,919 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:12:49,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:49 WrapperNode [2025-03-03 23:12:49,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:12:49,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:12:49,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:12:49,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:12:49,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:49" (1/1) ... [2025-03-03 23:12:49,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:49" (1/1) ... [2025-03-03 23:12:49,947 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2025-03-03 23:12:49,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:12:49,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:12:49,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:12:49,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:12:49,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:49" (1/1) ... [2025-03-03 23:12:49,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:49" (1/1) ... [2025-03-03 23:12:49,955 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:49" (1/1) ... [2025-03-03 23:12:49,973 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 23:12:49,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:49" (1/1) ... [2025-03-03 23:12:49,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:49" (1/1) ... [2025-03-03 23:12:49,981 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:49" (1/1) ... [2025-03-03 23:12:49,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:49" (1/1) ... [2025-03-03 23:12:49,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:49" (1/1) ... [2025-03-03 23:12:49,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:49" (1/1) ... [2025-03-03 23:12:49,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:12:49,989 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:12:49,989 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:12:49,989 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:12:49,989 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:49" (1/1) ... [2025-03-03 23:12:49,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:12:50,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:12:50,016 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 23:12:50,019 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 23:12:50,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:12:50,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:12:50,036 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:12:50,036 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:12:50,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:12:50,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:12:50,086 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:12:50,087 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:12:50,749 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 23:12:50,749 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:12:50,754 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:12:50,755 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:12:50,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:12:50 BoogieIcfgContainer [2025-03-03 23:12:50,755 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:12:50,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:12:50,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:12:50,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:12:50,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:12:49" (1/3) ... [2025-03-03 23:12:50,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5e36ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:12:50, skipping insertion in model container [2025-03-03 23:12:50,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:49" (2/3) ... [2025-03-03 23:12:50,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5e36ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:12:50, skipping insertion in model container [2025-03-03 23:12:50,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:12:50" (3/3) ... [2025-03-03 23:12:50,762 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-7.i [2025-03-03 23:12:50,771 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:12:50,772 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-7.i that has 2 procedures, 36 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:12:50,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:12:50,810 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;@1b8218f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:12:50,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:12:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 23:12:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 23:12:50,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:12:50,817 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 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 23:12:50,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:12:50,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:12:50,820 INFO L85 PathProgramCache]: Analyzing trace with hash -485224426, now seen corresponding path program 1 times [2025-03-03 23:12:50,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:12:50,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032054631] [2025-03-03 23:12:50,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:12:50,827 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 23:12:50,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:12:50,829 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 23:12:50,830 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 23:12:50,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 23:12:50,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 23:12:50,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:12:50,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:12:50,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:12:51,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:12:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 23:12:51,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:12:51,018 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:12:51,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032054631] [2025-03-03 23:12:51,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032054631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:12:51,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:12:51,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:12:51,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431073712] [2025-03-03 23:12:51,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:12:51,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:12:51,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:12:51,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:12:51,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:12:51,036 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 23:12:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:12:51,050 INFO L93 Difference]: Finished difference Result 69 states and 101 transitions. [2025-03-03 23:12:51,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:12:51,051 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2025-03-03 23:12:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:12:51,056 INFO L225 Difference]: With dead ends: 69 [2025-03-03 23:12:51,056 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 23:12:51,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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 23:12:51,060 INFO L435 NwaCegarLoop]: 46 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, 46 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 23:12:51,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:12:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 23:12:51,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-03 23:12:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 23:12:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2025-03-03 23:12:51,088 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 48 [2025-03-03 23:12:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:12:51,089 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-03-03 23:12:51,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 23:12:51,089 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2025-03-03 23:12:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 23:12:51,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:12:51,091 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 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 23:12:51,100 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 23:12:51,291 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 23:12:51,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:12:51,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:12:51,293 INFO L85 PathProgramCache]: Analyzing trace with hash 403101879, now seen corresponding path program 1 times [2025-03-03 23:12:51,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:12:51,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671971543] [2025-03-03 23:12:51,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:12:51,293 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 23:12:51,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:12:51,295 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 23:12:51,296 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 23:12:51,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 23:12:51,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 23:12:51,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:12:51,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:12:51,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 23:12:51,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:12:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 23:12:51,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:12:51,581 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:12:51,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671971543] [2025-03-03 23:12:51,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671971543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:12:51,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:12:51,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:12:51,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450532905] [2025-03-03 23:12:51,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:12:51,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:12:51,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:12:51,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:12:51,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:12:51,583 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 23:12:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:12:51,987 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2025-03-03 23:12:51,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:12:51,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 48 [2025-03-03 23:12:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:12:51,989 INFO L225 Difference]: With dead ends: 75 [2025-03-03 23:12:51,989 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 23:12:51,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:12:51,990 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 22 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:12:51,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 98 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 23:12:51,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 23:12:51,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-03-03 23:12:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 23:12:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2025-03-03 23:12:52,000 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 48 [2025-03-03 23:12:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:12:52,000 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2025-03-03 23:12:52,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 23:12:52,000 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2025-03-03 23:12:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 23:12:52,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:12:52,001 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 23:12:52,008 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 23:12:52,201 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 23:12:52,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:12:52,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:12:52,202 INFO L85 PathProgramCache]: Analyzing trace with hash -416387728, now seen corresponding path program 1 times [2025-03-03 23:12:52,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:12:52,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530493824] [2025-03-03 23:12:52,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:12:52,203 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 23:12:52,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:12:52,205 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 23:12:52,206 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 23:12:52,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 23:12:52,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 23:12:52,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:12:52,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:12:52,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 23:12:52,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:13:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 23:13:13,705 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:13:13,705 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:13:13,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530493824] [2025-03-03 23:13:13,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530493824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:13:13,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:13:13,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 23:13:13,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874107215] [2025-03-03 23:13:13,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:13:13,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 23:13:13,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:13:13,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 23:13:13,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:13:13,706 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 23:13:15,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:13:15,396 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2025-03-03 23:13:15,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 23:13:15,397 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2025-03-03 23:13:15,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:13:15,398 INFO L225 Difference]: With dead ends: 69 [2025-03-03 23:13:15,398 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 23:13:15,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2025-03-03 23:13:15,399 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 74 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:13:15,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 152 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 23:13:15,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 23:13:15,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2025-03-03 23:13:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 23:13:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-03-03 23:13:15,408 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 49 [2025-03-03 23:13:15,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:13:15,409 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-03-03 23:13:15,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 23:13:15,409 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-03-03 23:13:15,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 23:13:15,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:13:15,409 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 23:13:15,416 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 (4)] Ended with exit code 0 [2025-03-03 23:13:15,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:13:15,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:13:15,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:13:15,611 INFO L85 PathProgramCache]: Analyzing trace with hash -415464207, now seen corresponding path program 1 times [2025-03-03 23:13:15,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:13:15,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299211393] [2025-03-03 23:13:15,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:15,611 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 23:13:15,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:13:15,613 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:13:15,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 23:13:15,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 23:13:15,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 23:13:15,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:15,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:13:15,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 23:13:15,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:13:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 23:13:24,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:13:24,744 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:13:24,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299211393] [2025-03-03 23:13:24,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299211393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:13:24,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:13:24,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 23:13:24,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955323905] [2025-03-03 23:13:24,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:13:24,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:13:24,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:13:24,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:13:24,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:13:24,746 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 23:13:25,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:13:25,122 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2025-03-03 23:13:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 23:13:25,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2025-03-03 23:13:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:13:25,123 INFO L225 Difference]: With dead ends: 55 [2025-03-03 23:13:25,123 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 23:13:25,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:13:25,124 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:13:25,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 185 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:13:25,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 23:13:25,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 23:13:25,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 23:13:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 23:13:25,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2025-03-03 23:13:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:13:25,125 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 23:13:25,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 23:13:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 23:13:25,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 23:13:25,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:13:25,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-03 23:13:25,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:13:25,330 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 23:13:25,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 23:13:25,783 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:13:25,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 23:13:25,792 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 23:13:25,792 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 23:13:25,792 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 23:13:25,792 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-03 23:13:25,792 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 23:13:25,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:13:25 BoogieIcfgContainer [2025-03-03 23:13:25,793 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:13:25,794 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:13:25,794 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:13:25,794 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:13:25,794 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:12:50" (3/4) ... [2025-03-03 23:13:25,796 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 23:13:25,799 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-03 23:13:25,802 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-03 23:13:25,802 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-03 23:13:25,803 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 23:13:25,803 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 23:13:25,858 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 23:13:25,859 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 23:13:25,859 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:13:25,860 INFO L158 Benchmark]: Toolchain (without parser) took 36120.87ms. Allocated memory was 83.9MB in the beginning and 906.0MB in the end (delta: 822.1MB). Free memory was 59.1MB in the beginning and 404.7MB in the end (delta: -345.6MB). Peak memory consumption was 476.0MB. Max. memory is 16.1GB. [2025-03-03 23:13:25,861 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.2MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:13:25,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.79ms. Allocated memory is still 83.9MB. Free memory was 58.5MB in the beginning and 46.3MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:13:25,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.76ms. Allocated memory is still 83.9MB. Free memory was 46.3MB in the beginning and 44.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:13:25,862 INFO L158 Benchmark]: Boogie Preprocessor took 40.44ms. Allocated memory is still 83.9MB. Free memory was 44.4MB in the beginning and 42.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:13:25,862 INFO L158 Benchmark]: IcfgBuilder took 766.23ms. Allocated memory is still 83.9MB. Free memory was 42.6MB in the beginning and 29.7MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:13:25,862 INFO L158 Benchmark]: TraceAbstraction took 35036.22ms. Allocated memory was 83.9MB in the beginning and 906.0MB in the end (delta: 822.1MB). Free memory was 28.9MB in the beginning and 409.1MB in the end (delta: -380.3MB). Peak memory consumption was 434.0MB. Max. memory is 16.1GB. [2025-03-03 23:13:25,862 INFO L158 Benchmark]: Witness Printer took 65.16ms. Allocated memory is still 906.0MB. Free memory was 409.1MB in the beginning and 404.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:13:25,865 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.20ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.2MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.79ms. Allocated memory is still 83.9MB. Free memory was 58.5MB in the beginning and 46.3MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.76ms. Allocated memory is still 83.9MB. Free memory was 46.3MB in the beginning and 44.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.44ms. Allocated memory is still 83.9MB. Free memory was 44.4MB in the beginning and 42.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 766.23ms. Allocated memory is still 83.9MB. Free memory was 42.6MB in the beginning and 29.7MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 35036.22ms. Allocated memory was 83.9MB in the beginning and 906.0MB in the end (delta: 822.1MB). Free memory was 28.9MB in the beginning and 409.1MB in the end (delta: -380.3MB). Peak memory consumption was 434.0MB. Max. memory is 16.1GB. * Witness Printer took 65.16ms. Allocated memory is still 906.0MB. Free memory was 409.1MB in the beginning and 404.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.5s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 481 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 299 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 315 IncrementalHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 182 mSDtfsCounter, 315 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=3, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 601 SizeOfPredicates, 15 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 240/240 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-03 23:13:25,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE