./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_operatoramount_amount25_file-21.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 37b4b79db92bc49aa9cdfceca437d05e7b12666dbe0c3dacb1ef78b459e8fefa --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:30:28,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:30:28,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:30:28,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:30:28,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:30:28,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:30:28,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:30:28,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:30:28,771 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:30:28,771 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:30:28,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:30:28,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:30:28,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:30:28,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:30:28,771 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:30:28,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:30:28,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:30:28,772 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:30:28,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:30:28,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:30:28,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:30:28,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:30:28,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:30:28,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:30:28,772 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:30:28,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:30:28,772 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:30:28,773 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:30:28,773 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:30:28,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:30:28,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:30:28,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:30:28,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:30:28,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:30:28,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:30:28,773 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:30:28,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:30:28,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:30:28,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:30:28,774 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:30:28,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:30:28,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:30:28,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:30:28,774 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 -> 37b4b79db92bc49aa9cdfceca437d05e7b12666dbe0c3dacb1ef78b459e8fefa [2025-03-08 15:30:28,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:30:29,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:30:29,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:30:29,007 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:30:29,007 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:30:29,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-21.i [2025-03-08 15:30:30,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/030354c2f/64a5bdf525a240ed9c5ee8bd2acf91ee/FLAGe0de06424 [2025-03-08 15:30:30,374 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:30:30,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-21.i [2025-03-08 15:30:30,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/030354c2f/64a5bdf525a240ed9c5ee8bd2acf91ee/FLAGe0de06424 [2025-03-08 15:30:30,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/030354c2f/64a5bdf525a240ed9c5ee8bd2acf91ee [2025-03-08 15:30:30,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:30:30,392 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:30:30,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:30:30,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:30:30,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:30:30,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:30:30" (1/1) ... [2025-03-08 15:30:30,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e02eb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:30, skipping insertion in model container [2025-03-08 15:30:30,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:30:30" (1/1) ... [2025-03-08 15:30:30,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:30:30,502 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-21.i[915,928] [2025-03-08 15:30:30,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:30:30,542 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:30:30,548 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-21.i[915,928] [2025-03-08 15:30:30,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:30:30,568 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:30:30,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:30 WrapperNode [2025-03-08 15:30:30,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:30:30,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:30:30,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:30:30,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:30:30,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:30" (1/1) ... [2025-03-08 15:30:30,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:30" (1/1) ... [2025-03-08 15:30:30,605 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2025-03-08 15:30:30,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:30:30,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:30:30,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:30:30,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:30:30,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:30" (1/1) ... [2025-03-08 15:30:30,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:30" (1/1) ... [2025-03-08 15:30:30,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:30" (1/1) ... [2025-03-08 15:30:30,624 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-08 15:30:30,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:30" (1/1) ... [2025-03-08 15:30:30,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:30" (1/1) ... [2025-03-08 15:30:30,627 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:30" (1/1) ... [2025-03-08 15:30:30,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:30" (1/1) ... [2025-03-08 15:30:30,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:30" (1/1) ... [2025-03-08 15:30:30,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:30" (1/1) ... [2025-03-08 15:30:30,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:30:30,630 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:30:30,631 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:30:30,631 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:30:30,631 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:30" (1/1) ... [2025-03-08 15:30:30,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:30:30,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:30:30,661 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-08 15:30:30,663 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-08 15:30:30,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:30:30,681 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:30:30,681 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:30:30,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:30:30,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:30:30,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:30:30,728 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:30:30,730 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:30:30,884 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 15:30:30,887 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:30:30,894 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:30:30,894 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:30:30,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:30:30 BoogieIcfgContainer [2025-03-08 15:30:30,895 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:30:30,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:30:30,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:30:30,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:30:30,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:30:30" (1/3) ... [2025-03-08 15:30:30,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54470d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:30:30, skipping insertion in model container [2025-03-08 15:30:30,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:30" (2/3) ... [2025-03-08 15:30:30,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54470d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:30:30, skipping insertion in model container [2025-03-08 15:30:30,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:30:30" (3/3) ... [2025-03-08 15:30:30,901 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-21.i [2025-03-08 15:30:30,911 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:30:30,912 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-21.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:30:30,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:30:30,965 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;@380dbc5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:30:30,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:30:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 15:30:30,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 15:30:30,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:30:30,977 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:30:30,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:30:30,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:30:30,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1307823667, now seen corresponding path program 1 times [2025-03-08 15:30:30,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:30:30,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51973109] [2025-03-08 15:30:30,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:30:30,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:30:31,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 15:30:31,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 15:30:31,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:30:31,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:30:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-08 15:30:31,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:30:31,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51973109] [2025-03-08 15:30:31,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51973109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:30:31,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890803187] [2025-03-08 15:30:31,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:30:31,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:30:31,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:30:31,149 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-08 15:30:31,151 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-08 15:30:31,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 15:30:31,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 15:30:31,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:30:31,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:30:31,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:30:31,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:30:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-08 15:30:31,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:30:31,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890803187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:30:31,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:30:31,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:30:31,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437712471] [2025-03-08 15:30:31,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:30:31,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:30:31,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:30:31,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:30:31,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:30:31,276 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 15:30:31,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:30:31,288 INFO L93 Difference]: Finished difference Result 74 states and 116 transitions. [2025-03-08 15:30:31,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:30:31,289 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2025-03-08 15:30:31,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:30:31,293 INFO L225 Difference]: With dead ends: 74 [2025-03-08 15:30:31,293 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 15:30:31,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-08 15:30:31,296 INFO L435 NwaCegarLoop]: 51 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, 51 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-08 15:30:31,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:30:31,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 15:30:31,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 15:30:31,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 15:30:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2025-03-08 15:30:31,319 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 64 [2025-03-08 15:30:31,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:30:31,319 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2025-03-08 15:30:31,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 15:30:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2025-03-08 15:30:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 15:30:31,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:30:31,324 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:30:31,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:30:31,528 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-08 15:30:31,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:30:31,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:30:31,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2118536880, now seen corresponding path program 1 times [2025-03-08 15:30:31,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:30:31,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988109533] [2025-03-08 15:30:31,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:30:31,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:30:31,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 15:30:31,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 15:30:31,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:30:31,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:30:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 15:30:31,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:30:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988109533] [2025-03-08 15:30:31,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988109533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:30:31,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:30:31,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:30:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125091498] [2025-03-08 15:30:31,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:30:31,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:30:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:30:31,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:30:31,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:30:31,667 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 15:30:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:30:31,686 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2025-03-08 15:30:31,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:30:31,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2025-03-08 15:30:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:30:31,689 INFO L225 Difference]: With dead ends: 71 [2025-03-08 15:30:31,689 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 15:30:31,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:30:31,689 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:30:31,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:30:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 15:30:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 15:30:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 15:30:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2025-03-08 15:30:31,697 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 64 [2025-03-08 15:30:31,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:30:31,698 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-03-08 15:30:31,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 15:30:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2025-03-08 15:30:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 15:30:31,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:30:31,698 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:30:31,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:30:31,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:30:31,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:30:31,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2147166031, now seen corresponding path program 1 times [2025-03-08 15:30:31,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:30:31,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892547270] [2025-03-08 15:30:31,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:30:31,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:30:31,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 15:30:31,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 15:30:31,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:30:31,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:30:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 15:30:32,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:30:32,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892547270] [2025-03-08 15:30:32,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892547270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:30:32,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:30:32,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:30:32,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646867132] [2025-03-08 15:30:32,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:30:32,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:30:32,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:30:32,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:30:32,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:30:32,964 INFO L87 Difference]: Start difference. First operand 37 states and 50 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 15:30:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:30:33,138 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2025-03-08 15:30:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:30:33,138 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2025-03-08 15:30:33,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:30:33,140 INFO L225 Difference]: With dead ends: 84 [2025-03-08 15:30:33,141 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 15:30:33,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-08 15:30:33,142 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 48 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:30:33,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 320 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:30:33,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 15:30:33,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 69. [2025-03-08 15:30:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.183673469387755) internal successors, (58), 50 states have internal predecessors, (58), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 15:30:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2025-03-08 15:30:33,158 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 64 [2025-03-08 15:30:33,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:30:33,158 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2025-03-08 15:30:33,158 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 15:30:33,158 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2025-03-08 15:30:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 15:30:33,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:30:33,159 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:30:33,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:30:33,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:30:33,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:30:33,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2126792041, now seen corresponding path program 1 times [2025-03-08 15:30:33,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:30:33,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594938622] [2025-03-08 15:30:33,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:30:33,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:30:33,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 15:30:33,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 15:30:33,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:30:33,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:30:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 15:30:33,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:30:33,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594938622] [2025-03-08 15:30:33,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594938622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:30:33,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:30:33,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:30:33,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013990221] [2025-03-08 15:30:33,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:30:33,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:30:33,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:30:33,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:30:33,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:30:33,745 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 15:30:33,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:30:33,961 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2025-03-08 15:30:33,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:30:33,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 65 [2025-03-08 15:30:33,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:30:33,963 INFO L225 Difference]: With dead ends: 88 [2025-03-08 15:30:33,963 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 15:30:33,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:30:33,963 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 62 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:30:33,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 299 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:30:33,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 15:30:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2025-03-08 15:30:33,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.173913043478261) internal successors, (54), 47 states have internal predecessors, (54), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 15:30:33,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2025-03-08 15:30:33,975 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 65 [2025-03-08 15:30:33,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:30:33,975 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2025-03-08 15:30:33,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 15:30:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2025-03-08 15:30:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 15:30:33,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:30:33,976 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:30:33,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:30:33,977 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:30:33,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:30:33,977 INFO L85 PathProgramCache]: Analyzing trace with hash -312286956, now seen corresponding path program 1 times [2025-03-08 15:30:33,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:30:33,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418006051] [2025-03-08 15:30:33,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:30:33,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:30:33,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 15:30:34,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 15:30:34,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:30:34,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:30:34,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [558268013] [2025-03-08 15:30:34,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:30:34,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:30:34,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:30:34,008 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:30:34,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:30:34,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 15:30:34,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 15:30:34,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:30:34,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:30:34,080 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:30:34,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 15:30:34,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 15:30:34,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:30:34,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:30:34,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:30:34,125 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:30:34,126 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:30:34,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:30:34,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:30:34,330 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 15:30:34,356 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:30:34,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:30:34 BoogieIcfgContainer [2025-03-08 15:30:34,360 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:30:34,360 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:30:34,360 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:30:34,360 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:30:34,361 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:30:30" (3/4) ... [2025-03-08 15:30:34,362 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:30:34,363 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:30:34,363 INFO L158 Benchmark]: Toolchain (without parser) took 3971.21ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 155.0MB in the beginning and 185.1MB in the end (delta: -30.1MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2025-03-08 15:30:34,363 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:30:34,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.96ms. Allocated memory is still 201.3MB. Free memory was 155.0MB in the beginning and 142.2MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:30:34,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.25ms. Allocated memory is still 201.3MB. Free memory was 142.2MB in the beginning and 140.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:30:34,364 INFO L158 Benchmark]: Boogie Preprocessor took 24.22ms. Allocated memory is still 201.3MB. Free memory was 140.5MB in the beginning and 138.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:30:34,364 INFO L158 Benchmark]: IcfgBuilder took 264.14ms. Allocated memory is still 201.3MB. Free memory was 138.0MB in the beginning and 122.9MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 15:30:34,364 INFO L158 Benchmark]: TraceAbstraction took 3463.48ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 122.5MB in the beginning and 185.2MB in the end (delta: -62.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:30:34,364 INFO L158 Benchmark]: Witness Printer took 2.56ms. Allocated memory is still 243.3MB. Free memory was 185.2MB in the beginning and 185.1MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:30:34,365 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 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.96ms. Allocated memory is still 201.3MB. Free memory was 155.0MB in the beginning and 142.2MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.25ms. Allocated memory is still 201.3MB. Free memory was 142.2MB in the beginning and 140.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.22ms. Allocated memory is still 201.3MB. Free memory was 140.5MB in the beginning and 138.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 264.14ms. Allocated memory is still 201.3MB. Free memory was 138.0MB in the beginning and 122.9MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3463.48ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 122.5MB in the beginning and 185.2MB in the end (delta: -62.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.56ms. Allocated memory is still 243.3MB. Free memory was 185.2MB in the beginning and 185.1MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned char var_1_7 = 1; [L24] signed char var_1_8 = -32; [L25] signed char var_1_9 = -8; [L26] unsigned char var_1_10 = 2; [L27] double var_1_11 = 15.6; [L28] double var_1_12 = 15.4; [L29] double var_1_13 = 32.2; [L30] unsigned char var_1_14 = 5; [L31] unsigned short int last_1_var_1_1 = 32; [L32] signed char last_1_var_1_8 = -32; [L33] unsigned char last_1_var_1_10 = 2; VAL [isInitial=0, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L89] isInitial = 1 [L90] FCALL initially() [L91] COND TRUE 1 [L92] CALL updateLastVariables() [L80] last_1_var_1_1 = var_1_1 [L81] last_1_var_1_8 = var_1_8 [L82] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L92] RET updateLastVariables() [L93] CALL updateVariables() [L63] var_1_7 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_8=-32, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_8=-32, var_1_9=-8] [L64] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_8=-32, var_1_9=-8] [L65] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L65] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L66] var_1_9 = __VERIFIER_nondet_char() [L67] CALL assume_abort_if_not(var_1_9 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L67] RET assume_abort_if_not(var_1_9 >= -126) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L68] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L69] var_1_11 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L70] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L71] var_1_12 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L72] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L73] var_1_13 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L74] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L75] var_1_14 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L76] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=1, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=1, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L77] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=1, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L93] RET updateVariables() [L94] CALL step() [L37] signed long int stepLocal_2 = (((last_1_var_1_8) < (last_1_var_1_8)) ? (last_1_var_1_8) : (last_1_var_1_8)); [L38] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_1=1, stepLocal_2=-32, var_1_10=2, var_1_14=1, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L39] COND TRUE ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) <= var_1_13 VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_1=1, stepLocal_2=-32, var_1_10=2, var_1_14=1, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L40] COND FALSE !(stepLocal_1 && (last_1_var_1_8 >= var_1_9)) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_2=-32, var_1_10=2, var_1_14=1, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L48] signed long int stepLocal_0 = ((((- last_1_var_1_10)) > (last_1_var_1_10)) ? ((- last_1_var_1_10)) : (last_1_var_1_10)); VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_0=2, stepLocal_2=-32, var_1_10=2, var_1_14=1, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L49] COND FALSE !(last_1_var_1_10 < stepLocal_0) [L52] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_2=-32, var_1_10=2, var_1_14=1, var_1_1=32, var_1_7=1, var_1_8=0, var_1_9=0] [L54] COND FALSE !((var_1_10 + ((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) < (var_1_10 * var_1_8)) [L59] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_2=-32, var_1_10=2, var_1_14=1, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0] [L94] RET step() [L95] CALL, EXPR property() [L85-L86] return ((((var_1_10 + ((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) < (var_1_10 * var_1_8)) ? (var_1_7 ? (var_1_1 == ((unsigned short int) var_1_10)) : 1) : (var_1_1 == ((unsigned short int) var_1_10))) && ((last_1_var_1_10 < (((((- last_1_var_1_10)) > (last_1_var_1_10)) ? ((- last_1_var_1_10)) : (last_1_var_1_10)))) ? (var_1_8 == ((signed char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_8 == ((signed char) var_1_9)))) && ((((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) <= var_1_13) ? ((var_1_7 && (last_1_var_1_8 >= var_1_9)) ? ((last_1_var_1_1 <= ((((last_1_var_1_8) < (last_1_var_1_8)) ? (last_1_var_1_8) : (last_1_var_1_8)))) ? (var_1_10 == ((unsigned char) var_1_14)) : 1) : 1) : (var_1_10 == ((unsigned char) var_1_14))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=1, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0] [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=1, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=1, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 65 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 763 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 513 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181 IncrementalHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 250 mSDtfsCounter, 181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=3, InterpolantAutomatonStates: 20, 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, 33 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 172 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 704/720 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-08 15:30:34,380 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_operatoramount_amount25_file-21.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 37b4b79db92bc49aa9cdfceca437d05e7b12666dbe0c3dacb1ef78b459e8fefa --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:30:36,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:30:36,291 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:30:36,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:30:36,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:30:36,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:30:36,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:30:36,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:30:36,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:30:36,321 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:30:36,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:30:36,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:30:36,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:30:36,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:30:36,322 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:30:36,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:30:36,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:30:36,323 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:30:36,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:30:36,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:30:36,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:30:36,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:30:36,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:30:36,323 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:30:36,323 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:30:36,323 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:30:36,323 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:30:36,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:30:36,324 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:30:36,324 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:30:36,324 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:30:36,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:30:36,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:30:36,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:30:36,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:30:36,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:30:36,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:30:36,325 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:30:36,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:30:36,325 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:30:36,325 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:30:36,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:30:36,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:30:36,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:30:36,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:30:36,325 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 -> 37b4b79db92bc49aa9cdfceca437d05e7b12666dbe0c3dacb1ef78b459e8fefa [2025-03-08 15:30:36,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:30:36,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:30:36,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:30:36,597 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:30:36,597 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:30:36,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-21.i [2025-03-08 15:30:37,750 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad30c88dc/8667b472706743c3851e2fc19d1815cc/FLAG51a817f71 [2025-03-08 15:30:37,920 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:30:37,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-21.i [2025-03-08 15:30:37,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad30c88dc/8667b472706743c3851e2fc19d1815cc/FLAG51a817f71 [2025-03-08 15:30:38,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad30c88dc/8667b472706743c3851e2fc19d1815cc [2025-03-08 15:30:38,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:30:38,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:30:38,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:30:38,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:30:38,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:30:38,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:30:38" (1/1) ... [2025-03-08 15:30:38,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f5a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:38, skipping insertion in model container [2025-03-08 15:30:38,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:30:38" (1/1) ... [2025-03-08 15:30:38,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:30:38,413 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-21.i[915,928] [2025-03-08 15:30:38,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:30:38,466 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:30:38,473 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-21.i[915,928] [2025-03-08 15:30:38,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:30:38,497 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:30:38,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:38 WrapperNode [2025-03-08 15:30:38,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:30:38,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:30:38,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:30:38,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:30:38,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:38" (1/1) ... [2025-03-08 15:30:38,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:38" (1/1) ... [2025-03-08 15:30:38,523 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2025-03-08 15:30:38,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:30:38,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:30:38,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:30:38,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:30:38,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:38" (1/1) ... [2025-03-08 15:30:38,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:38" (1/1) ... [2025-03-08 15:30:38,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:38" (1/1) ... [2025-03-08 15:30:38,539 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-08 15:30:38,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:38" (1/1) ... [2025-03-08 15:30:38,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:38" (1/1) ... [2025-03-08 15:30:38,544 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:38" (1/1) ... [2025-03-08 15:30:38,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:38" (1/1) ... [2025-03-08 15:30:38,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:38" (1/1) ... [2025-03-08 15:30:38,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:38" (1/1) ... [2025-03-08 15:30:38,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:30:38,550 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:30:38,550 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:30:38,550 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:30:38,550 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:38" (1/1) ... [2025-03-08 15:30:38,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:30:38,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:30:38,577 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-08 15:30:38,579 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-08 15:30:38,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:30:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:30:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:30:38,599 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:30:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:30:38,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:30:38,661 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:30:38,662 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:30:38,899 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 15:30:38,899 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:30:38,906 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:30:38,908 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:30:38,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:30:38 BoogieIcfgContainer [2025-03-08 15:30:38,908 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:30:38,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:30:38,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:30:38,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:30:38,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:30:38" (1/3) ... [2025-03-08 15:30:38,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@caa39b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:30:38, skipping insertion in model container [2025-03-08 15:30:38,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:30:38" (2/3) ... [2025-03-08 15:30:38,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@caa39b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:30:38, skipping insertion in model container [2025-03-08 15:30:38,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:30:38" (3/3) ... [2025-03-08 15:30:38,919 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-21.i [2025-03-08 15:30:38,930 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:30:38,931 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-21.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:30:38,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:30:38,992 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;@38264d90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:30:38,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:30:38,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 15:30:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 15:30:39,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:30:39,003 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:30:39,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:30:39,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:30:39,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1307823667, now seen corresponding path program 1 times [2025-03-08 15:30:39,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:30:39,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115563715] [2025-03-08 15:30:39,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:30:39,020 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-08 15:30:39,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:30:39,023 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-08 15:30:39,025 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-08 15:30:39,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 15:30:39,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 15:30:39,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:30:39,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:30:39,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:30:39,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:30:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 15:30:39,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:30:39,183 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:30:39,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115563715] [2025-03-08 15:30:39,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115563715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:30:39,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:30:39,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:30:39,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875388127] [2025-03-08 15:30:39,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:30:39,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:30:39,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:30:39,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:30:39,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:30:39,202 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 15:30:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:30:39,214 INFO L93 Difference]: Finished difference Result 74 states and 116 transitions. [2025-03-08 15:30:39,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:30:39,216 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2025-03-08 15:30:39,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:30:39,219 INFO L225 Difference]: With dead ends: 74 [2025-03-08 15:30:39,219 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 15:30:39,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 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-08 15:30:39,223 INFO L435 NwaCegarLoop]: 51 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, 51 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-08 15:30:39,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:30:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 15:30:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 15:30:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 15:30:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2025-03-08 15:30:39,248 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 64 [2025-03-08 15:30:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:30:39,248 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2025-03-08 15:30:39,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 15:30:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2025-03-08 15:30:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 15:30:39,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:30:39,250 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:30:39,256 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-08 15:30:39,450 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-08 15:30:39,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:30:39,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:30:39,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2118536880, now seen corresponding path program 1 times [2025-03-08 15:30:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:30:39,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077746926] [2025-03-08 15:30:39,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:30:39,452 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-08 15:30:39,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:30:39,455 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-08 15:30:39,456 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-08 15:30:39,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 15:30:39,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 15:30:39,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:30:39,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:30:39,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 15:30:39,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:30:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 15:30:39,736 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:30:39,736 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:30:39,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077746926] [2025-03-08 15:30:39,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077746926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:30:39,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:30:39,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:30:39,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800253480] [2025-03-08 15:30:39,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:30:39,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:30:39,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:30:39,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:30:39,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:30:39,739 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 15:30:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:30:39,947 INFO L93 Difference]: Finished difference Result 116 states and 161 transitions. [2025-03-08 15:30:39,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:30:39,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2025-03-08 15:30:39,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:30:39,949 INFO L225 Difference]: With dead ends: 116 [2025-03-08 15:30:39,949 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 15:30:39,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:30:39,950 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 45 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:30:39,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 167 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:30:39,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 15:30:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2025-03-08 15:30:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 15:30:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2025-03-08 15:30:39,963 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 64 [2025-03-08 15:30:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:30:39,964 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2025-03-08 15:30:39,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 15:30:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2025-03-08 15:30:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 15:30:39,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:30:39,965 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:30:39,971 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-08 15:30:40,171 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-08 15:30:40,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:30:40,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:30:40,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2147166031, now seen corresponding path program 1 times [2025-03-08 15:30:40,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:30:40,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294335892] [2025-03-08 15:30:40,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:30:40,173 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-08 15:30:40,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:30:40,174 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-08 15:30:40,176 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-08 15:30:40,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 15:30:40,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 15:30:40,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:30:40,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:30:40,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 15:30:40,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:31:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 15:31:29,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:31:29,455 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:31:29,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294335892] [2025-03-08 15:31:29,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294335892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:31:29,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:31:29,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:31:29,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69894667] [2025-03-08 15:31:29,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:31:29,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:31:29,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:31:29,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:31:29,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:31:29,457 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 15:31:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:31:29,753 INFO L93 Difference]: Finished difference Result 124 states and 167 transitions. [2025-03-08 15:31:29,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:31:29,756 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2025-03-08 15:31:29,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:31:29,758 INFO L225 Difference]: With dead ends: 124 [2025-03-08 15:31:29,758 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 15:31:29,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:31:29,759 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 47 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:31:29,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 243 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:31:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 15:31:29,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 102. [2025-03-08 15:31:29,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 15:31:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2025-03-08 15:31:29,782 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 64 [2025-03-08 15:31:29,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:31:29,782 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2025-03-08 15:31:29,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 15:31:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2025-03-08 15:31:29,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 15:31:29,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:31:29,784 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:31:29,788 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-08 15:31:29,984 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-08 15:31:29,984 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:31:29,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:31:29,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2126792041, now seen corresponding path program 1 times [2025-03-08 15:31:29,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:31:29,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505087215] [2025-03-08 15:31:29,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:31:29,985 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-08 15:31:29,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:31:29,987 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-08 15:31:29,989 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-08 15:31:30,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 15:31:30,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 15:31:30,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:31:30,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:31:30,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 15:31:30,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:31:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 15:31:41,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:31:41,216 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:31:41,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505087215] [2025-03-08 15:31:41,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505087215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:31:41,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:31:41,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:31:41,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712457890] [2025-03-08 15:31:41,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:31:41,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:31:41,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:31:41,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:31:41,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:31:41,218 INFO L87 Difference]: Start difference. First operand 102 states and 143 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 15:31:41,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:31:41,600 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2025-03-08 15:31:41,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:31:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 65 [2025-03-08 15:31:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:31:41,603 INFO L225 Difference]: With dead ends: 127 [2025-03-08 15:31:41,603 INFO L226 Difference]: Without dead ends: 125 [2025-03-08 15:31:41,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:31:41,604 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 50 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:31:41,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 251 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:31:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-08 15:31:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 102. [2025-03-08 15:31:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 15:31:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2025-03-08 15:31:41,616 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 65 [2025-03-08 15:31:41,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:31:41,616 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2025-03-08 15:31:41,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 15:31:41,616 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2025-03-08 15:31:41,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 15:31:41,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:31:41,617 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:31:41,622 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-08 15:31:41,820 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-08 15:31:41,821 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:31:41,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:31:41,821 INFO L85 PathProgramCache]: Analyzing trace with hash -312286956, now seen corresponding path program 1 times [2025-03-08 15:31:41,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:31:41,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657584666] [2025-03-08 15:31:41,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:31:41,822 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-08 15:31:41,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:31:41,824 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:31:41,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 15:31:41,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 15:31:41,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 15:31:41,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:31:41,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:31:41,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 15:31:41,895 INFO L279 TraceCheckSpWp]: Computing forward predicates...