./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/prefixsum_rec.c --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/verifythis/prefixsum_rec.c -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 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:51:43,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:51:43,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:51:43,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:51:43,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:51:43,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:51:43,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:51:43,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:51:43,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:51:43,984 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:51:43,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:51:43,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:51:43,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:51:43,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:51:43,986 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:51:43,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:51:43,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:51:43,986 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:51:43,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:51:43,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:51:43,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:51:43,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:51:43,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:51:43,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:51:43,986 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:51:43,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:51:43,987 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:51:43,987 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:51:43,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:51:43,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:51:43,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:51:43,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:51:43,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:51:43,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:51:43,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:51:43,988 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:51:43,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:51:43,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:51:43,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:51:43,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:51:43,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:51:43,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:51:43,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:51:43,989 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 -> 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab [2025-03-08 05:51:44,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:51:44,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:51:44,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:51:44,209 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:51:44,210 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:51:44,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_rec.c [2025-03-08 05:51:45,378 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8453834b7/e443b2bcee344a0f9af2c939b5227e60/FLAG0a118178c [2025-03-08 05:51:45,588 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:51:45,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c [2025-03-08 05:51:45,603 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8453834b7/e443b2bcee344a0f9af2c939b5227e60/FLAG0a118178c [2025-03-08 05:51:45,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8453834b7/e443b2bcee344a0f9af2c939b5227e60 [2025-03-08 05:51:45,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:51:45,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:51:45,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:51:45,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:51:45,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:51:45,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:51:45" (1/1) ... [2025-03-08 05:51:45,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e7409f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:45, skipping insertion in model container [2025-03-08 05:51:45,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:51:45" (1/1) ... [2025-03-08 05:51:45,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:51:46,063 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/verifythis/prefixsum_rec.c[525,538] [2025-03-08 05:51:46,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:51:46,103 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:51:46,111 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] [2025-03-08 05:51:46,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:51:46,128 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:51:46,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:46 WrapperNode [2025-03-08 05:51:46,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:51:46,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:51:46,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:51:46,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:51:46,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:46" (1/1) ... [2025-03-08 05:51:46,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:46" (1/1) ... [2025-03-08 05:51:46,155 INFO L138 Inliner]: procedures = 22, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2025-03-08 05:51:46,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:51:46,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:51:46,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:51:46,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:51:46,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:46" (1/1) ... [2025-03-08 05:51:46,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:46" (1/1) ... [2025-03-08 05:51:46,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:46" (1/1) ... [2025-03-08 05:51:46,178 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-03-08 05:51:46,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:46" (1/1) ... [2025-03-08 05:51:46,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:46" (1/1) ... [2025-03-08 05:51:46,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:46" (1/1) ... [2025-03-08 05:51:46,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:46" (1/1) ... [2025-03-08 05:51:46,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:46" (1/1) ... [2025-03-08 05:51:46,190 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:46" (1/1) ... [2025-03-08 05:51:46,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:51:46,192 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:51:46,192 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:51:46,192 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:51:46,192 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:46" (1/1) ... [2025-03-08 05:51:46,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:51:46,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:51:46,219 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 05:51:46,221 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 05:51:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:51:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 05:51:46,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 05:51:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:51:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:51:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2025-03-08 05:51:46,238 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2025-03-08 05:51:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 05:51:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 05:51:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 05:51:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2025-03-08 05:51:46,238 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2025-03-08 05:51:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:51:46,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:51:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 05:51:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 05:51:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-08 05:51:46,239 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-08 05:51:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 05:51:46,317 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:51:46,319 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:51:46,548 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2025-03-08 05:51:46,548 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:51:46,557 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:51:46,557 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:51:46,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:51:46 BoogieIcfgContainer [2025-03-08 05:51:46,557 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:51:46,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:51:46,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:51:46,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:51:46,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:51:45" (1/3) ... [2025-03-08 05:51:46,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383f893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:51:46, skipping insertion in model container [2025-03-08 05:51:46,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:46" (2/3) ... [2025-03-08 05:51:46,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383f893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:51:46, skipping insertion in model container [2025-03-08 05:51:46,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:51:46" (3/3) ... [2025-03-08 05:51:46,564 INFO L128 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2025-03-08 05:51:46,574 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:51:46,576 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG prefixsum_rec.c that has 5 procedures, 48 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 05:51:46,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:51:46,625 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;@22db688d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:51:46,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:51:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 05:51:46,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 05:51:46,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:51:46,634 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:51:46,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:51:46,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:51:46,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1265905883, now seen corresponding path program 1 times [2025-03-08 05:51:46,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:51:46,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776215161] [2025-03-08 05:51:46,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:46,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:51:46,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 05:51:46,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 05:51:46,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:46,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:51:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:51:46,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:51:46,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776215161] [2025-03-08 05:51:46,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776215161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:51:46,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129814317] [2025-03-08 05:51:46,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:46,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:51:46,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:51:46,804 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 05:51:46,805 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 05:51:46,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 05:51:46,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 05:51:46,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:46,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:51:46,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 05:51:46,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:51:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:51:46,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:51:46,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129814317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:51:46,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:51:46,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 05:51:46,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397073591] [2025-03-08 05:51:46,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:51:46,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:51:46,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:51:46,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:51:46,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:51:46,965 INFO L87 Difference]: Start difference. First operand has 48 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:51:46,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:51:46,982 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2025-03-08 05:51:46,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:51:46,984 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2025-03-08 05:51:46,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:51:46,990 INFO L225 Difference]: With dead ends: 93 [2025-03-08 05:51:46,991 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 05:51:46,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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 05:51:46,995 INFO L435 NwaCegarLoop]: 58 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, 58 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 05:51:46,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:51:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 05:51:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-08 05:51:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 05:51:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2025-03-08 05:51:47,025 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 43 [2025-03-08 05:51:47,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:51:47,025 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2025-03-08 05:51:47,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:51:47,026 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2025-03-08 05:51:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 05:51:47,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:51:47,028 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:51:47,035 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 05:51:47,228 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 05:51:47,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:51:47,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:51:47,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1837789529, now seen corresponding path program 1 times [2025-03-08 05:51:47,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:51:47,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093575980] [2025-03-08 05:51:47,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:47,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:51:47,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 05:51:47,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 05:51:47,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:47,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:51:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:51:47,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:51:47,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093575980] [2025-03-08 05:51:47,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093575980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:51:47,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:51:47,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:51:47,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680500670] [2025-03-08 05:51:47,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:51:47,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:51:47,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:51:47,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:51:47,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:51:47,619 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:51:47,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:51:47,676 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2025-03-08 05:51:47,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:51:47,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2025-03-08 05:51:47,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:51:47,678 INFO L225 Difference]: With dead ends: 56 [2025-03-08 05:51:47,678 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 05:51:47,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:51:47,679 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:51:47,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:51:47,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 05:51:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2025-03-08 05:51:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 05:51:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2025-03-08 05:51:47,685 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 43 [2025-03-08 05:51:47,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:51:47,687 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2025-03-08 05:51:47,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:51:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2025-03-08 05:51:47,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 05:51:47,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:51:47,689 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:51:47,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:51:47,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:51:47,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:51:47,689 INFO L85 PathProgramCache]: Analyzing trace with hash -774681750, now seen corresponding path program 1 times [2025-03-08 05:51:47,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:51:47,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389383855] [2025-03-08 05:51:47,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:47,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:51:47,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 05:51:47,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:51:47,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:47,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:51:47,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:51:47,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:51:47,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389383855] [2025-03-08 05:51:47,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389383855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:51:47,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063537633] [2025-03-08 05:51:47,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:47,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:51:47,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:51:47,943 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 05:51:47,944 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 05:51:47,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 05:51:48,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:51:48,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:48,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:51:48,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:51:48,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:51:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:51:48,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:51:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:51:48,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063537633] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:51:48,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:51:48,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-08 05:51:48,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749300538] [2025-03-08 05:51:48,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:51:48,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:51:48,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:51:48,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:51:48,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:51:48,234 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:51:48,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:51:48,317 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2025-03-08 05:51:48,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:51:48,319 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 44 [2025-03-08 05:51:48,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:51:48,320 INFO L225 Difference]: With dead ends: 70 [2025-03-08 05:51:48,320 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 05:51:48,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:51:48,320 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:51:48,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 317 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:51:48,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 05:51:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 05:51:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 05:51:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2025-03-08 05:51:48,327 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 44 [2025-03-08 05:51:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:51:48,327 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2025-03-08 05:51:48,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:51:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2025-03-08 05:51:48,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 05:51:48,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:51:48,329 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:51:48,334 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 05:51:48,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 05:51:48,530 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:51:48,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:51:48,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2116888327, now seen corresponding path program 2 times [2025-03-08 05:51:48,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:51:48,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973539823] [2025-03-08 05:51:48,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:51:48,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:51:48,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-08 05:51:48,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 05:51:48,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:51:48,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:51:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:51:49,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:51:49,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973539823] [2025-03-08 05:51:49,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973539823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:51:49,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387909525] [2025-03-08 05:51:49,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:51:49,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:51:49,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:51:49,632 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:51:49,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:51:49,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-08 05:51:49,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 05:51:49,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:51:49,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:51:49,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-08 05:51:49,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:51:49,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-08 05:51:49,876 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_downsweep_~left_9 Int)) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int#1)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (let ((.cse3 (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_9 4))) (.cse2 (select .cse0 .cse1))) (store (store .cse0 .cse1 (+ .cse2 (select .cse0 .cse3))) .cse3 .cse2))))) (<= |c_downsweep_#in~right| (+ v_downsweep_~left_9 1)) (<= v_downsweep_~left_9 |c_downsweep_#in~left|))) is different from true [2025-03-08 05:51:49,934 INFO L349 Elim1Store]: treesize reduction 36, result has 25.0 percent of original size [2025-03-08 05:51:49,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 27 [2025-03-08 05:51:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:51:50,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:51:50,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387909525] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:51:50,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:51:50,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 25 [2025-03-08 05:51:50,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154935712] [2025-03-08 05:51:50,337 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:51:50,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 05:51:50,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:51:50,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 05:51:50,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=639, Unknown=1, NotChecked=50, Total=756 [2025-03-08 05:51:50,339 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 25 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 21 states have internal predecessors, (50), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 05:51:51,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:51:51,155 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2025-03-08 05:51:51,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 05:51:51,156 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 21 states have internal predecessors, (50), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 45 [2025-03-08 05:51:51,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:51:51,158 INFO L225 Difference]: With dead ends: 60 [2025-03-08 05:51:51,158 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 05:51:51,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=1498, Unknown=1, NotChecked=78, Total=1722 [2025-03-08 05:51:51,160 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:51:51,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 391 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 642 Invalid, 0 Unknown, 72 Unchecked, 0.4s Time] [2025-03-08 05:51:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 05:51:51,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2025-03-08 05:51:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-08 05:51:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2025-03-08 05:51:51,177 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 45 [2025-03-08 05:51:51,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:51:51,177 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2025-03-08 05:51:51,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 21 states have internal predecessors, (50), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 05:51:51,178 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2025-03-08 05:51:51,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 05:51:51,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:51:51,181 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:51:51,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:51:51,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:51:51,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:51:51,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:51:51,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1216233174, now seen corresponding path program 1 times [2025-03-08 05:51:51,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:51:51,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293137853] [2025-03-08 05:51:51,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:51,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:51:51,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 05:51:51,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 05:51:51,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:51,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:51:51,591 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:51:51,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:51:51,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293137853] [2025-03-08 05:51:51,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293137853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:51:51,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660099087] [2025-03-08 05:51:51,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:51,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:51:51,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:51:51,594 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:51:51,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:51:51,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 05:51:51,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 05:51:51,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:51,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:51:51,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-03-08 05:51:51,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:51:51,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 05:51:51,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2025-03-08 05:51:51,929 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-08 05:51:51,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-03-08 05:51:51,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2025-03-08 05:51:52,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-08 05:51:52,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2025-03-08 05:51:52,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-03-08 05:51:52,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2025-03-08 05:51:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:51:52,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:51:52,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660099087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:51:52,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:51:52,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 18] total 23 [2025-03-08 05:51:52,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615852642] [2025-03-08 05:51:52,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:51:52,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 05:51:52,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:51:52,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 05:51:52,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:51:52,484 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 23 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-08 05:51:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:51:53,191 INFO L93 Difference]: Finished difference Result 100 states and 131 transitions. [2025-03-08 05:51:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 05:51:53,192 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 48 [2025-03-08 05:51:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:51:53,193 INFO L225 Difference]: With dead ends: 100 [2025-03-08 05:51:53,193 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 05:51:53,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=1617, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 05:51:53,194 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 60 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:51:53,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 550 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:51:53,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 05:51:53,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2025-03-08 05:51:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 13 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2025-03-08 05:51:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2025-03-08 05:51:53,208 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 48 [2025-03-08 05:51:53,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:51:53,209 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2025-03-08 05:51:53,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-08 05:51:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2025-03-08 05:51:53,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 05:51:53,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:51:53,209 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:51:53,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:51:53,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:51:53,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:51:53,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:51:53,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1198897606, now seen corresponding path program 1 times [2025-03-08 05:51:53,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:51:53,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048910092] [2025-03-08 05:51:53,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:53,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:51:53,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 05:51:53,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 05:51:53,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:53,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:51:55,001 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:51:55,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:51:55,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048910092] [2025-03-08 05:51:55,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048910092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:51:55,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155734654] [2025-03-08 05:51:55,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:55,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:51:55,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:51:55,005 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:51:55,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:51:55,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 05:51:55,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 05:51:55,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:55,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:51:55,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-08 05:51:55,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:51:55,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 05:51:55,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2025-03-08 05:51:55,256 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-08 05:51:55,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-03-08 05:51:55,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2025-03-08 05:51:55,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-08 05:51:55,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2025-03-08 05:51:55,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-03-08 05:51:55,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2025-03-08 05:51:55,569 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_upsweep_~a.offset_10 Int) (v_upsweep_~right_10 Int) (v_upsweep_~left_10 Int)) (and (<= |c_upsweep_#in~right| v_upsweep_~right_10) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_upsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int#1)| |c_upsweep_#in~a.base|)) (.cse1 (+ (* v_upsweep_~right_10 4) v_upsweep_~a.offset_10))) (store .cse0 .cse1 (+ (select .cse0 (+ (* v_upsweep_~left_10 4) v_upsweep_~a.offset_10)) (select .cse0 .cse1)))))) (<= |c_upsweep_#in~a.offset| v_upsweep_~a.offset_10))) is different from true [2025-03-08 05:51:55,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2025-03-08 05:51:55,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2025-03-08 05:51:55,712 WARN L873 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int)) (and (<= downsweep_~left |c_downsweep_#in~left|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int#1)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 (select (select |c_#memory_int#1| |c_downsweep_#in~a.base|) .cse2))))))) is different from true [2025-03-08 05:51:55,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2025-03-08 05:51:55,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 73 [2025-03-08 05:51:55,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 85 [2025-03-08 05:51:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:51:56,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:00,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155734654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:00,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:52:00,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2025-03-08 05:52:00,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049601831] [2025-03-08 05:52:00,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:00,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 05:52:00,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:00,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 05:52:00,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1433, Unknown=3, NotChecked=154, Total=1722 [2025-03-08 05:52:00,425 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 38 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 30 states have internal predecessors, (58), 7 states have call successors, (10), 3 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-08 05:52:02,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:02,042 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2025-03-08 05:52:02,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 05:52:02,043 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 30 states have internal predecessors, (58), 7 states have call successors, (10), 3 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) Word has length 49 [2025-03-08 05:52:02,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:02,044 INFO L225 Difference]: With dead ends: 80 [2025-03-08 05:52:02,044 INFO L226 Difference]: Without dead ends: 78 [2025-03-08 05:52:02,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=239, Invalid=2846, Unknown=3, NotChecked=218, Total=3306 [2025-03-08 05:52:02,045 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 70 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:02,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 469 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 893 Invalid, 0 Unknown, 157 Unchecked, 0.8s Time] [2025-03-08 05:52:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-08 05:52:02,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2025-03-08 05:52:02,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 54 states have internal predecessors, (60), 15 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2025-03-08 05:52:02,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2025-03-08 05:52:02,061 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 49 [2025-03-08 05:52:02,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:02,062 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2025-03-08 05:52:02,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 30 states have internal predecessors, (58), 7 states have call successors, (10), 3 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-08 05:52:02,063 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2025-03-08 05:52:02,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 05:52:02,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:02,063 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:52:02,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:52:02,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:02,264 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:02,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:02,264 INFO L85 PathProgramCache]: Analyzing trace with hash -930354929, now seen corresponding path program 2 times [2025-03-08 05:52:02,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:02,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418127473] [2025-03-08 05:52:02,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:52:02,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:02,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-08 05:52:02,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 05:52:02,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:52:02,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:52:02,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:02,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418127473] [2025-03-08 05:52:02,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418127473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:02,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278933986] [2025-03-08 05:52:02,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:52:02,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:02,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:02,464 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:02,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:52:02,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-08 05:52:02,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 05:52:02,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:52:02,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:02,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 05:52:02,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:52:02,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:52:02,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278933986] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:52:02,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:52:02,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 17 [2025-03-08 05:52:02,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636315996] [2025-03-08 05:52:02,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:02,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 05:52:02,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:02,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 05:52:02,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:52:02,722 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:52:02,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:02,878 INFO L93 Difference]: Finished difference Result 99 states and 129 transitions. [2025-03-08 05:52:02,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:52:02,878 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 50 [2025-03-08 05:52:02,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:02,879 INFO L225 Difference]: With dead ends: 99 [2025-03-08 05:52:02,879 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 05:52:02,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:52:02,880 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:02,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 371 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 05:52:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2025-03-08 05:52:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 54 states have internal predecessors, (60), 15 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2025-03-08 05:52:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2025-03-08 05:52:02,899 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 50 [2025-03-08 05:52:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:02,899 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2025-03-08 05:52:02,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:52:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2025-03-08 05:52:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 05:52:02,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:02,902 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:52:02,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:52:03,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:03,103 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:03,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:03,103 INFO L85 PathProgramCache]: Analyzing trace with hash 590343875, now seen corresponding path program 3 times [2025-03-08 05:52:03,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:03,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058254810] [2025-03-08 05:52:03,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:52:03,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:03,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 3 equivalence classes. [2025-03-08 05:52:03,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 05:52:03,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 05:52:03,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:52:03,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:03,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058254810] [2025-03-08 05:52:03,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058254810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:03,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052126094] [2025-03-08 05:52:03,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:52:03,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:03,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:03,226 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:03,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:52:03,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 3 equivalence classes. [2025-03-08 05:52:03,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 05:52:03,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 05:52:03,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:03,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:52:03,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:03,375 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:52:03,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:03,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:52:03,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052126094] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:52:03,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:52:03,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-08 05:52:03,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022104490] [2025-03-08 05:52:03,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:03,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 05:52:03,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:03,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 05:52:03,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:52:03,435 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:52:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:03,482 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2025-03-08 05:52:03,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:52:03,483 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 52 [2025-03-08 05:52:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:03,484 INFO L225 Difference]: With dead ends: 99 [2025-03-08 05:52:03,484 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 05:52:03,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:52:03,484 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 10 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:03,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 394 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:03,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 05:52:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2025-03-08 05:52:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 59 states have internal predecessors, (67), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (23), 18 states have call predecessors, (23), 16 states have call successors, (23) [2025-03-08 05:52:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2025-03-08 05:52:03,494 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 52 [2025-03-08 05:52:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:03,494 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2025-03-08 05:52:03,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:52:03,494 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2025-03-08 05:52:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 05:52:03,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:03,495 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:52:03,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 05:52:03,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:03,696 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:03,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:03,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1297177478, now seen corresponding path program 1 times [2025-03-08 05:52:03,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:03,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191763618] [2025-03-08 05:52:03,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:03,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:03,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 05:52:03,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 05:52:03,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:03,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:52:03,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:03,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191763618] [2025-03-08 05:52:03,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191763618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:03,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395401155] [2025-03-08 05:52:03,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:03,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:03,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:03,814 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:03,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 05:52:03,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 05:52:03,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 05:52:03,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:03,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:03,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 05:52:03,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:52:03,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:52:04,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395401155] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:52:04,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:52:04,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 19 [2025-03-08 05:52:04,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614727533] [2025-03-08 05:52:04,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:04,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 05:52:04,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:04,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 05:52:04,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:52:04,246 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 6 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 05:52:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:04,452 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2025-03-08 05:52:04,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:52:04,453 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 6 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 57 [2025-03-08 05:52:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:04,453 INFO L225 Difference]: With dead ends: 95 [2025-03-08 05:52:04,454 INFO L226 Difference]: Without dead ends: 85 [2025-03-08 05:52:04,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2025-03-08 05:52:04,454 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 21 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:04,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 386 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-08 05:52:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-08 05:52:04,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 61 states have internal predecessors, (68), 17 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2025-03-08 05:52:04,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2025-03-08 05:52:04,472 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 57 [2025-03-08 05:52:04,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:04,472 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2025-03-08 05:52:04,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 6 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 05:52:04,472 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2025-03-08 05:52:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 05:52:04,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:04,473 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:52:04,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 05:52:04,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 05:52:04,677 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:04,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:04,677 INFO L85 PathProgramCache]: Analyzing trace with hash -285560945, now seen corresponding path program 1 times [2025-03-08 05:52:04,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:04,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865882465] [2025-03-08 05:52:04,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:04,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:04,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 05:52:04,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 05:52:04,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:04,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:52:04,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:04,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865882465] [2025-03-08 05:52:04,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865882465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:04,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583483072] [2025-03-08 05:52:04,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:04,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:04,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:04,775 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:04,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 05:52:04,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 05:52:04,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 05:52:04,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:04,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:04,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 05:52:04,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:52:04,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:52:05,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583483072] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:52:05,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:52:05,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-03-08 05:52:05,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359263060] [2025-03-08 05:52:05,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:05,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 05:52:05,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:05,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 05:52:05,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:52:05,194 INFO L87 Difference]: Start difference. First operand 85 states and 109 transitions. Second operand has 16 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 16 states have internal predecessors, (53), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-08 05:52:05,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:05,290 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2025-03-08 05:52:05,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:52:05,291 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 16 states have internal predecessors, (53), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) Word has length 62 [2025-03-08 05:52:05,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:05,292 INFO L225 Difference]: With dead ends: 96 [2025-03-08 05:52:05,292 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 05:52:05,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:52:05,292 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:05,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 304 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:05,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 05:52:05,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2025-03-08 05:52:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 13 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (18), 14 states have call predecessors, (18), 13 states have call successors, (18) [2025-03-08 05:52:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2025-03-08 05:52:05,303 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 62 [2025-03-08 05:52:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:05,303 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2025-03-08 05:52:05,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 16 states have internal predecessors, (53), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-08 05:52:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2025-03-08 05:52:05,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 05:52:05,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:05,304 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:52:05,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 05:52:05,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:52:05,504 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:05,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:05,506 INFO L85 PathProgramCache]: Analyzing trace with hash -273084710, now seen corresponding path program 2 times [2025-03-08 05:52:05,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:05,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404767607] [2025-03-08 05:52:05,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:52:05,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:05,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-08 05:52:05,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 05:52:05,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:52:05,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:05,688 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:52:05,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:05,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404767607] [2025-03-08 05:52:05,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404767607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:05,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700476417] [2025-03-08 05:52:05,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:52:05,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:05,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:05,690 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:05,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 05:52:05,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-08 05:52:05,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 05:52:05,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:52:05,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:05,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 05:52:05,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:52:05,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:52:06,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700476417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:52:06,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:52:06,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2025-03-08 05:52:06,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871263549] [2025-03-08 05:52:06,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:06,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 05:52:06,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:06,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 05:52:06,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2025-03-08 05:52:06,331 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 29 states, 27 states have (on average 2.814814814814815) internal successors, (76), 29 states have internal predecessors, (76), 10 states have call successors, (22), 2 states have call predecessors, (22), 6 states have return successors, (23), 8 states have call predecessors, (23), 10 states have call successors, (23) [2025-03-08 05:52:06,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:06,807 INFO L93 Difference]: Finished difference Result 108 states and 139 transitions. [2025-03-08 05:52:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 05:52:06,807 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.814814814814815) internal successors, (76), 29 states have internal predecessors, (76), 10 states have call successors, (22), 2 states have call predecessors, (22), 6 states have return successors, (23), 8 states have call predecessors, (23), 10 states have call successors, (23) Word has length 63 [2025-03-08 05:52:06,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:06,808 INFO L225 Difference]: With dead ends: 108 [2025-03-08 05:52:06,808 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 05:52:06,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=1490, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 05:52:06,809 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 29 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:06,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 488 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:52:06,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 05:52:06,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2025-03-08 05:52:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-08 05:52:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2025-03-08 05:52:06,817 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 63 [2025-03-08 05:52:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:06,817 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-03-08 05:52:06,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.814814814814815) internal successors, (76), 29 states have internal predecessors, (76), 10 states have call successors, (22), 2 states have call predecessors, (22), 6 states have return successors, (23), 8 states have call predecessors, (23), 10 states have call successors, (23) [2025-03-08 05:52:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2025-03-08 05:52:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 05:52:06,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:06,818 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:52:06,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 05:52:07,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 05:52:07,019 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:07,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:07,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2029188254, now seen corresponding path program 1 times [2025-03-08 05:52:07,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:07,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083386891] [2025-03-08 05:52:07,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:07,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:07,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 05:52:07,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 05:52:07,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:07,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat