./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/bor5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-crafted/bor5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a4987addfe5f74a2ffcc1ac07d342e5a630d26b982b6fa887540d0e2c4f5965 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:29:53,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:29:53,221 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:29:53,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:29:53,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:29:53,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:29:53,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:29:53,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:29:53,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:29:53,248 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:29:53,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:29:53,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:29:53,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:29:53,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:29:53,249 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:29:53,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:29:53,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:29:53,249 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:29:53,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:29:53,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:29:53,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:29:53,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:29:53,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:29:53,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:29:53,250 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:29:53,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:29:53,250 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:29:53,250 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:29:53,250 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:29:53,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:29:53,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:29:53,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:29:53,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:29:53,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:29:53,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:29:53,251 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:29:53,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:29:53,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:29:53,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:29:53,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:29:53,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:29:53,251 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:29:53,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:29:53,251 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 -> 1a4987addfe5f74a2ffcc1ac07d342e5a630d26b982b6fa887540d0e2c4f5965 [2025-03-08 00:29:53,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:29:53,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:29:53,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:29:53,494 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:29:53,495 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:29:53,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bor5.i [2025-03-08 00:29:54,720 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541532049/d4c59247a86e4917a00223ca5a2fc4b3/FLAGf20cd7992 [2025-03-08 00:29:54,944 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:29:54,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bor5.i [2025-03-08 00:29:54,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541532049/d4c59247a86e4917a00223ca5a2fc4b3/FLAGf20cd7992 [2025-03-08 00:29:54,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541532049/d4c59247a86e4917a00223ca5a2fc4b3 [2025-03-08 00:29:54,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:29:54,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:29:54,974 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:29:54,974 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:29:54,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:29:54,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:29:54" (1/1) ... [2025-03-08 00:29:54,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56f39e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:54, skipping insertion in model container [2025-03-08 00:29:54,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:29:54" (1/1) ... [2025-03-08 00:29:54,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:29:55,160 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/array-crafted/bor5.i[1364,1377] [2025-03-08 00:29:55,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:29:55,176 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:29:55,193 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/array-crafted/bor5.i[1364,1377] [2025-03-08 00:29:55,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:29:55,206 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:29:55,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:55 WrapperNode [2025-03-08 00:29:55,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:29:55,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:29:55,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:29:55,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:29:55,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:55" (1/1) ... [2025-03-08 00:29:55,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:55" (1/1) ... [2025-03-08 00:29:55,239 INFO L138 Inliner]: procedures = 16, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 75 [2025-03-08 00:29:55,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:29:55,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:29:55,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:29:55,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:29:55,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:55" (1/1) ... [2025-03-08 00:29:55,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:55" (1/1) ... [2025-03-08 00:29:55,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:55" (1/1) ... [2025-03-08 00:29:55,264 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 5 writes are split as follows [0, 0, 5]. [2025-03-08 00:29:55,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:55" (1/1) ... [2025-03-08 00:29:55,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:55" (1/1) ... [2025-03-08 00:29:55,268 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:55" (1/1) ... [2025-03-08 00:29:55,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:55" (1/1) ... [2025-03-08 00:29:55,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:55" (1/1) ... [2025-03-08 00:29:55,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:55" (1/1) ... [2025-03-08 00:29:55,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:29:55,280 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:29:55,280 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:29:55,281 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:29:55,281 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:55" (1/1) ... [2025-03-08 00:29:55,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:29:55,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:29:55,317 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 00:29:55,326 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 00:29:55,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:29:55,351 INFO L130 BoogieDeclarations]: Found specification of procedure bor [2025-03-08 00:29:55,351 INFO L138 BoogieDeclarations]: Found implementation of procedure bor [2025-03-08 00:29:55,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:29:55,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:29:55,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:29:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:29:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:29:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:29:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:29:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:29:55,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:29:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:29:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:29:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:29:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:29:55,444 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:29:55,446 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:29:55,677 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 00:29:55,679 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:29:55,694 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:29:55,694 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:29:55,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:29:55 BoogieIcfgContainer [2025-03-08 00:29:55,695 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:29:55,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:29:55,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:29:55,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:29:55,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:29:54" (1/3) ... [2025-03-08 00:29:55,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c3ae66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:29:55, skipping insertion in model container [2025-03-08 00:29:55,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:55" (2/3) ... [2025-03-08 00:29:55,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c3ae66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:29:55, skipping insertion in model container [2025-03-08 00:29:55,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:29:55" (3/3) ... [2025-03-08 00:29:55,707 INFO L128 eAbstractionObserver]: Analyzing ICFG bor5.i [2025-03-08 00:29:55,722 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:29:55,724 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bor5.i that has 2 procedures, 27 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:29:55,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:29:55,783 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;@19ab6610, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:29:55,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:29:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:29:55,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:29:55,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:55,793 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:55,794 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:55,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:55,798 INFO L85 PathProgramCache]: Analyzing trace with hash -797157225, now seen corresponding path program 1 times [2025-03-08 00:29:55,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:55,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512892623] [2025-03-08 00:29:55,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:29:55,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:55,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:29:55,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:29:55,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:29:55,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:29:56,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:29:56,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512892623] [2025-03-08 00:29:56,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512892623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:29:56,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:29:56,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:29:56,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447294337] [2025-03-08 00:29:56,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:29:56,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:29:56,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:29:56,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:29:56,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:29:56,132 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:29:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:29:56,176 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2025-03-08 00:29:56,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:29:56,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-03-08 00:29:56,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:29:56,182 INFO L225 Difference]: With dead ends: 51 [2025-03-08 00:29:56,182 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 00:29:56,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:29:56,187 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:29:56,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:29:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 00:29:56,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-08 00:29:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:29:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2025-03-08 00:29:56,213 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 25 [2025-03-08 00:29:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:29:56,214 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2025-03-08 00:29:56,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:29:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2025-03-08 00:29:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:29:56,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:56,216 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:56,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:29:56,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:56,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:56,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2092529177, now seen corresponding path program 1 times [2025-03-08 00:29:56,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:56,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460156672] [2025-03-08 00:29:56,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:29:56,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:56,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 00:29:56,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:29:56,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:29:56,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:29:56,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:29:56,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460156672] [2025-03-08 00:29:56,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460156672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:29:56,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021650080] [2025-03-08 00:29:56,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:29:56,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:56,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:29:56,362 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 00:29:56,363 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 00:29:56,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 00:29:56,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:29:56,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:29:56,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:56,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:29:56,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:29:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:29:56,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:29:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:29:56,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021650080] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:29:56,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:29:56,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-03-08 00:29:56,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276042363] [2025-03-08 00:29:56,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:29:56,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:29:56,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:29:56,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:29:56,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:29:56,547 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:29:56,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:29:56,631 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2025-03-08 00:29:56,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:29:56,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 26 [2025-03-08 00:29:56,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:29:56,632 INFO L225 Difference]: With dead ends: 47 [2025-03-08 00:29:56,632 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 00:29:56,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:29:56,634 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:29:56,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 61 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:29:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 00:29:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2025-03-08 00:29:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:29:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2025-03-08 00:29:56,639 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 26 [2025-03-08 00:29:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:29:56,640 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2025-03-08 00:29:56,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:29:56,640 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2025-03-08 00:29:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 00:29:56,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:56,641 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:56,647 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 00:29:56,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:56,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:56,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:56,842 INFO L85 PathProgramCache]: Analyzing trace with hash 396322400, now seen corresponding path program 1 times [2025-03-08 00:29:56,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:56,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230580080] [2025-03-08 00:29:56,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:29:56,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:56,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 00:29:56,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 00:29:56,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:29:56,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 00:29:56,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:29:56,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230580080] [2025-03-08 00:29:56,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230580080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:29:56,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:29:56,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:29:56,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092462143] [2025-03-08 00:29:56,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:29:56,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:29:56,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:29:56,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:29:56,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:29:56,955 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:29:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:29:56,998 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2025-03-08 00:29:56,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:29:56,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-03-08 00:29:56,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:29:56,999 INFO L225 Difference]: With dead ends: 40 [2025-03-08 00:29:56,999 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 00:29:56,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:29:57,000 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:29:57,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 32 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:29:57,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 00:29:57,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-08 00:29:57,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:29:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-03-08 00:29:57,003 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 36 [2025-03-08 00:29:57,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:29:57,004 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-08 00:29:57,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:29:57,005 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-03-08 00:29:57,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:29:57,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:57,005 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:57,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:29:57,005 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:57,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:57,006 INFO L85 PathProgramCache]: Analyzing trace with hash -379422146, now seen corresponding path program 1 times [2025-03-08 00:29:57,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:57,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732353433] [2025-03-08 00:29:57,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:29:57,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:57,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 00:29:57,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:29:57,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:29:57,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:30:00,707 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:30:00,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:30:00,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732353433] [2025-03-08 00:30:00,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732353433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:30:00,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564561842] [2025-03-08 00:30:00,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:30:00,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:30:00,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:30:00,710 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 00:30:00,712 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 00:30:00,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 00:30:00,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:30:00,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:30:00,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:30:00,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-03-08 00:30:00,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:30:00,872 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 15 treesize of output 1 [2025-03-08 00:30:01,287 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 64 treesize of output 33 [2025-03-08 00:30:02,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:30:02,073 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 1 case distinctions, treesize of input 124 treesize of output 75 [2025-03-08 00:30:02,270 INFO L349 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2025-03-08 00:30:02,270 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 2 case distinctions, treesize of input 103 treesize of output 74 [2025-03-08 00:30:04,524 INFO L349 Elim1Store]: treesize reduction 530, result has 26.9 percent of original size [2025-03-08 00:30:04,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 459 treesize of output 433 [2025-03-08 00:30:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:30:07,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:30:07,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564561842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:30:07,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:30:07,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31] total 55 [2025-03-08 00:30:07,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561220302] [2025-03-08 00:30:07,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:30:07,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-08 00:30:07,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:30:07,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-08 00:30:07,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2985, Unknown=0, NotChecked=0, Total=3192 [2025-03-08 00:30:07,613 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 55 states, 49 states have (on average 1.163265306122449) internal successors, (57), 47 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 00:30:12,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:30:16,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:30:18,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:30:22,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:30:25,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:30:25,068 INFO L93 Difference]: Finished difference Result 107 states and 142 transitions. [2025-03-08 00:30:25,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-08 00:30:25,068 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 49 states have (on average 1.163265306122449) internal successors, (57), 47 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2025-03-08 00:30:25,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:30:25,070 INFO L225 Difference]: With dead ends: 107 [2025-03-08 00:30:25,070 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 00:30:25,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=403, Invalid=5449, Unknown=0, NotChecked=0, Total=5852 [2025-03-08 00:30:25,073 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 122 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 25 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2025-03-08 00:30:25,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 263 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1787 Invalid, 5 Unknown, 0 Unchecked, 15.9s Time] [2025-03-08 00:30:25,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 00:30:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2025-03-08 00:30:25,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.368421052631579) internal successors, (78), 59 states have internal predecessors, (78), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-08 00:30:25,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2025-03-08 00:30:25,085 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 37 [2025-03-08 00:30:25,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:30:25,085 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2025-03-08 00:30:25,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 49 states have (on average 1.163265306122449) internal successors, (57), 47 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 00:30:25,086 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2025-03-08 00:30:25,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:30:25,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:30:25,087 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:30:25,093 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 00:30:25,287 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,SelfDestructingSolverStorable3 [2025-03-08 00:30:25,288 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:30:25,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:30:25,288 INFO L85 PathProgramCache]: Analyzing trace with hash 444733784, now seen corresponding path program 1 times [2025-03-08 00:30:25,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:30:25,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777670027] [2025-03-08 00:30:25,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:30:25,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:30:25,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 00:30:25,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:30:25,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:30:25,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:30:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:30:26,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:30:26,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777670027] [2025-03-08 00:30:26,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777670027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:30:26,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151116908] [2025-03-08 00:30:26,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:30:26,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:30:26,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:30:26,229 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 00:30:26,231 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 00:30:26,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 00:30:26,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:30:26,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:30:26,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:30:26,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-08 00:30:26,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:30:26,324 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 15 treesize of output 1 [2025-03-08 00:30:26,345 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 15 treesize of output 1 [2025-03-08 00:30:26,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:30:26,515 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 1 case distinctions, treesize of input 42 treesize of output 22 [2025-03-08 00:30:26,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:30:26,692 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 1 case distinctions, treesize of input 42 treesize of output 25 [2025-03-08 00:30:26,756 INFO L349 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2025-03-08 00:30:26,757 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 3 case distinctions, treesize of input 58 treesize of output 41 [2025-03-08 00:30:27,360 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:30:27,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:30:27,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151116908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:30:27,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:30:27,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2025-03-08 00:30:27,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314483199] [2025-03-08 00:30:27,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:30:27,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 00:30:27,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:30:27,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 00:30:27,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1462, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 00:30:27,456 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 40 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 00:30:32,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:30:36,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:30:40,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:30:44,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:30:48,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:30:53,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:30:57,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:31:02,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:31:06,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:31:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:06,847 INFO L93 Difference]: Finished difference Result 220 states and 310 transitions. [2025-03-08 00:31:06,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-08 00:31:06,847 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2025-03-08 00:31:06,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:06,849 INFO L225 Difference]: With dead ends: 220 [2025-03-08 00:31:06,849 INFO L226 Difference]: Without dead ends: 181 [2025-03-08 00:31:06,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1990 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=730, Invalid=5912, Unknown=0, NotChecked=0, Total=6642 [2025-03-08 00:31:06,851 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 192 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 114 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:06,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 676 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1378 Invalid, 11 Unknown, 0 Unchecked, 38.3s Time] [2025-03-08 00:31:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-08 00:31:06,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 127. [2025-03-08 00:31:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.380952380952381) internal successors, (145), 109 states have internal predecessors, (145), 12 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (25), 11 states have call predecessors, (25), 12 states have call successors, (25) [2025-03-08 00:31:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 182 transitions. [2025-03-08 00:31:06,869 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 182 transitions. Word has length 38 [2025-03-08 00:31:06,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:06,870 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 182 transitions. [2025-03-08 00:31:06,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 00:31:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 182 transitions. [2025-03-08 00:31:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:31:06,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:06,871 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:06,877 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 00:31:07,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:07,072 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:07,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:07,072 INFO L85 PathProgramCache]: Analyzing trace with hash 283786810, now seen corresponding path program 2 times [2025-03-08 00:31:07,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:07,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588496398] [2025-03-08 00:31:07,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:31:07,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:07,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-08 00:31:07,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:31:07,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:31:07,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:31:08,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:08,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588496398] [2025-03-08 00:31:08,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588496398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:08,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707813476] [2025-03-08 00:31:08,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:31:08,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:08,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:08,285 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 00:31:08,286 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 00:31:08,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-08 00:31:08,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:31:08,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:31:08,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:08,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-03-08 00:31:08,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:08,349 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 15 treesize of output 1 [2025-03-08 00:31:08,596 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 64 treesize of output 33 [2025-03-08 00:31:09,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:31:09,117 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 1 case distinctions, treesize of input 108 treesize of output 71 [2025-03-08 00:31:09,215 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 14 [2025-03-08 00:31:09,561 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 00:31:09,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 82 [2025-03-08 00:31:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:31:09,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:11,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 62 treesize of output 56 [2025-03-08 00:31:11,683 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 33 treesize of output 29 [2025-03-08 00:31:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:31:11,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707813476] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:11,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:11,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31, 29] total 79 [2025-03-08 00:31:11,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297526438] [2025-03-08 00:31:11,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:11,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2025-03-08 00:31:11,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:11,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2025-03-08 00:31:11,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=5766, Unknown=0, NotChecked=0, Total=6162 [2025-03-08 00:31:11,776 INFO L87 Difference]: Start difference. First operand 127 states and 182 transitions. Second operand has 79 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 68 states have internal predecessors, (87), 9 states have call successors, (9), 3 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 00:31:15,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:15,091 INFO L93 Difference]: Finished difference Result 244 states and 337 transitions. [2025-03-08 00:31:15,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-08 00:31:15,092 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 68 states have internal predecessors, (87), 9 states have call successors, (9), 3 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 38 [2025-03-08 00:31:15,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:15,093 INFO L225 Difference]: With dead ends: 244 [2025-03-08 00:31:15,093 INFO L226 Difference]: Without dead ends: 238 [2025-03-08 00:31:15,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3300 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=908, Invalid=12202, Unknown=0, NotChecked=0, Total=13110 [2025-03-08 00:31:15,097 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 235 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 3002 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:15,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 581 Invalid, 3050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 3002 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 00:31:15,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-08 00:31:15,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 127. [2025-03-08 00:31:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.380952380952381) internal successors, (145), 109 states have internal predecessors, (145), 12 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (25), 11 states have call predecessors, (25), 12 states have call successors, (25) [2025-03-08 00:31:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 182 transitions. [2025-03-08 00:31:15,119 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 182 transitions. Word has length 38 [2025-03-08 00:31:15,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:15,119 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 182 transitions. [2025-03-08 00:31:15,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 68 states have internal predecessors, (87), 9 states have call successors, (9), 3 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 00:31:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 182 transitions. [2025-03-08 00:31:15,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:31:15,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:15,120 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:15,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 00:31:15,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:15,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:15,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:15,322 INFO L85 PathProgramCache]: Analyzing trace with hash -585748682, now seen corresponding path program 3 times [2025-03-08 00:31:15,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:15,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250176512] [2025-03-08 00:31:15,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:31:15,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:15,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-08 00:31:15,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:31:15,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:31:15,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:31:15,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:15,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250176512] [2025-03-08 00:31:15,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250176512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:15,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066513059] [2025-03-08 00:31:15,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:31:15,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:15,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:15,957 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 00:31:15,958 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 00:31:15,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-08 00:31:16,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:31:16,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:31:16,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:16,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-08 00:31:16,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:16,023 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 15 treesize of output 1 [2025-03-08 00:31:16,025 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 15 treesize of output 1 [2025-03-08 00:31:16,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:31:16,159 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 1 case distinctions, treesize of input 34 treesize of output 22 [2025-03-08 00:31:16,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:31:16,283 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 1 case distinctions, treesize of input 31 treesize of output 22 [2025-03-08 00:31:16,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:31:16,320 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-08 00:31:16,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2025-03-08 00:31:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:31:16,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:17,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 200 treesize of output 184 [2025-03-08 00:31:17,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:31:17,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 484 treesize of output 464 [2025-03-08 00:31:17,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 125 treesize of output 115 [2025-03-08 00:31:17,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:31:17,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 186 [2025-03-08 00:31:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:31:17,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066513059] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:17,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:17,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 19] total 54 [2025-03-08 00:31:17,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554351597] [2025-03-08 00:31:17,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:17,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-08 00:31:17,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:17,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-08 00:31:17,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=2573, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 00:31:17,558 INFO L87 Difference]: Start difference. First operand 127 states and 182 transitions. Second operand has 54 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 51 states have internal predecessors, (80), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 00:31:23,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:23,429 INFO L93 Difference]: Finished difference Result 445 states and 617 transitions. [2025-03-08 00:31:23,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-03-08 00:31:23,430 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 51 states have internal predecessors, (80), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Word has length 38 [2025-03-08 00:31:23,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:23,431 INFO L225 Difference]: With dead ends: 445 [2025-03-08 00:31:23,432 INFO L226 Difference]: Without dead ends: 354 [2025-03-08 00:31:23,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6493 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2332, Invalid=18548, Unknown=0, NotChecked=0, Total=20880 [2025-03-08 00:31:23,440 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 654 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 2415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:23,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 564 Invalid, 2415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 2186 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 00:31:23,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-08 00:31:23,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 243. [2025-03-08 00:31:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 205 states have (on average 1.3756097560975609) internal successors, (282), 212 states have internal predecessors, (282), 18 states have call successors, (18), 13 states have call predecessors, (18), 19 states have return successors, (41), 17 states have call predecessors, (41), 18 states have call successors, (41) [2025-03-08 00:31:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 341 transitions. [2025-03-08 00:31:23,493 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 341 transitions. Word has length 38 [2025-03-08 00:31:23,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:23,494 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 341 transitions. [2025-03-08 00:31:23,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 51 states have internal predecessors, (80), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 00:31:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 341 transitions. [2025-03-08 00:31:23,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:31:23,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:23,495 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:23,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 00:31:23,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:23,696 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:23,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:23,697 INFO L85 PathProgramCache]: Analyzing trace with hash 409298112, now seen corresponding path program 2 times [2025-03-08 00:31:23,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:23,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100227094] [2025-03-08 00:31:23,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:31:23,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:23,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-08 00:31:23,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:31:23,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:31:23,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 00:31:23,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:23,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100227094] [2025-03-08 00:31:23,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100227094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:23,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643580950] [2025-03-08 00:31:23,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:31:23,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:23,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:23,768 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 00:31:23,769 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 00:31:23,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-08 00:31:23,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:31:23,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:31:23,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:23,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:31:23,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:23,861 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:31:23,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 00:31:23,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643580950] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:23,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:23,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2025-03-08 00:31:23,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979647232] [2025-03-08 00:31:23,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:23,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:31:23,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:23,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:31:23,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:31:23,933 INFO L87 Difference]: Start difference. First operand 243 states and 341 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:31:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:24,112 INFO L93 Difference]: Finished difference Result 588 states and 850 transitions. [2025-03-08 00:31:24,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:31:24,113 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2025-03-08 00:31:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:24,115 INFO L225 Difference]: With dead ends: 588 [2025-03-08 00:31:24,115 INFO L226 Difference]: Without dead ends: 473 [2025-03-08 00:31:24,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:31:24,119 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 93 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:24,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 272 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:31:24,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-08 00:31:24,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 271. [2025-03-08 00:31:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 231 states have (on average 1.3722943722943723) internal successors, (317), 238 states have internal predecessors, (317), 20 states have call successors, (20), 14 states have call predecessors, (20), 19 states have return successors, (45), 18 states have call predecessors, (45), 20 states have call successors, (45) [2025-03-08 00:31:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 382 transitions. [2025-03-08 00:31:24,154 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 382 transitions. Word has length 38 [2025-03-08 00:31:24,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:24,154 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 382 transitions. [2025-03-08 00:31:24,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:31:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 382 transitions. [2025-03-08 00:31:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:31:24,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:24,156 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:24,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 00:31:24,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:24,356 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:24,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:24,357 INFO L85 PathProgramCache]: Analyzing trace with hash -994611739, now seen corresponding path program 1 times [2025-03-08 00:31:24,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:24,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190443820] [2025-03-08 00:31:24,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:31:24,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:24,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 00:31:24,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:31:24,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:24,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:24,891 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:31:24,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:24,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190443820] [2025-03-08 00:31:24,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190443820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:24,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115657565] [2025-03-08 00:31:24,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:31:24,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:24,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:24,893 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 00:31:24,906 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 00:31:24,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 00:31:24,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:31:24,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:24,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:24,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-08 00:31:24,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:25,038 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 22 treesize of output 7 [2025-03-08 00:31:25,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:31:25,202 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 1 case distinctions, treesize of input 43 treesize of output 26 [2025-03-08 00:31:25,242 INFO L349 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2025-03-08 00:31:25,243 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 3 case distinctions, treesize of input 59 treesize of output 42 [2025-03-08 00:31:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:31:25,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:25,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115657565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:25,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:31:25,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2025-03-08 00:31:25,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182400407] [2025-03-08 00:31:25,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:25,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 00:31:25,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:25,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 00:31:25,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1259, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 00:31:25,661 INFO L87 Difference]: Start difference. First operand 271 states and 382 transitions. Second operand has 37 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 34 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 00:31:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:27,048 INFO L93 Difference]: Finished difference Result 428 states and 598 transitions. [2025-03-08 00:31:27,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-08 00:31:27,049 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 34 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2025-03-08 00:31:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:27,050 INFO L225 Difference]: With dead ends: 428 [2025-03-08 00:31:27,050 INFO L226 Difference]: Without dead ends: 353 [2025-03-08 00:31:27,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=413, Invalid=3493, Unknown=0, NotChecked=0, Total=3906 [2025-03-08 00:31:27,051 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 120 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:27,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 436 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 00:31:27,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-08 00:31:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 232. [2025-03-08 00:31:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 198 states have (on average 1.3585858585858586) internal successors, (269), 204 states have internal predecessors, (269), 16 states have call successors, (16), 11 states have call predecessors, (16), 17 states have return successors, (31), 16 states have call predecessors, (31), 16 states have call successors, (31) [2025-03-08 00:31:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 316 transitions. [2025-03-08 00:31:27,085 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 316 transitions. Word has length 39 [2025-03-08 00:31:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:27,085 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 316 transitions. [2025-03-08 00:31:27,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 34 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 00:31:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 316 transitions. [2025-03-08 00:31:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:31:27,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:27,086 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:27,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 00:31:27,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:27,287 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:27,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:27,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1656421536, now seen corresponding path program 4 times [2025-03-08 00:31:27,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:27,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26511774] [2025-03-08 00:31:27,287 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:31:27,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:27,292 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-08 00:31:27,303 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:31:27,303 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:31:27,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat