./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/max20-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/reducercommutativity/max20-1.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 da9ac0c3f4abc9a6d9e8b4bf1276cf60fb65e65c55d9f94968d51682bf71ef87 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:11:55,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:11:55,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:11:55,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:11:55,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:11:55,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:11:55,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:11:55,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:11:55,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:11:55,423 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:11:55,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:11:55,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:11:55,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:11:55,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:11:55,425 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:11:55,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:11:55,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:11:55,425 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:11:55,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:11:55,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:11:55,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:11:55,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:11:55,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:11:55,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:11:55,426 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:11:55,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:11:55,426 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:11:55,426 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:11:55,426 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:11:55,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:11:55,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:11:55,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:11:55,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:11:55,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:11:55,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:11:55,427 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:11:55,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:11:55,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:11:55,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:11:55,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:11:55,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:11:55,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:11:55,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:11:55,427 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 -> da9ac0c3f4abc9a6d9e8b4bf1276cf60fb65e65c55d9f94968d51682bf71ef87 [2025-03-03 09:11:55,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:11:55,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:11:55,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:11:55,641 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:11:55,641 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:11:55,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max20-1.i [2025-03-03 09:11:56,774 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6c7c632/b1e96a53d747404b88358c4b47c8495a/FLAG643f39b4b [2025-03-03 09:11:56,998 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:11:56,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max20-1.i [2025-03-03 09:11:57,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6c7c632/b1e96a53d747404b88358c4b47c8495a/FLAG643f39b4b [2025-03-03 09:11:57,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6c7c632/b1e96a53d747404b88358c4b47c8495a [2025-03-03 09:11:57,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:11:57,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:11:57,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:11:57,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:11:57,344 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:11:57,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:11:57" (1/1) ... [2025-03-03 09:11:57,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5824e600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:57, skipping insertion in model container [2025-03-03 09:11:57,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:11:57" (1/1) ... [2025-03-03 09:11:57,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:11:57,465 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/reducercommutativity/max20-1.i[1290,1303] [2025-03-03 09:11:57,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:11:57,478 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:11:57,494 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/reducercommutativity/max20-1.i[1290,1303] [2025-03-03 09:11:57,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:11:57,509 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:11:57,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:57 WrapperNode [2025-03-03 09:11:57,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:11:57,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:11:57,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:11:57,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:11:57,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:57" (1/1) ... [2025-03-03 09:11:57,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:57" (1/1) ... [2025-03-03 09:11:57,532 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2025-03-03 09:11:57,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:11:57,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:11:57,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:11:57,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:11:57,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:57" (1/1) ... [2025-03-03 09:11:57,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:57" (1/1) ... [2025-03-03 09:11:57,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:57" (1/1) ... [2025-03-03 09:11:57,557 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-03 09:11:57,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:57" (1/1) ... [2025-03-03 09:11:57,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:57" (1/1) ... [2025-03-03 09:11:57,562 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:57" (1/1) ... [2025-03-03 09:11:57,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:57" (1/1) ... [2025-03-03 09:11:57,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:57" (1/1) ... [2025-03-03 09:11:57,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:57" (1/1) ... [2025-03-03 09:11:57,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:11:57,572 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:11:57,575 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:11:57,575 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:11:57,576 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:57" (1/1) ... [2025-03-03 09:11:57,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:11:57,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:11:57,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:11:57,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:11:57,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:11:57,624 INFO L130 BoogieDeclarations]: Found specification of procedure max [2025-03-03 09:11:57,624 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2025-03-03 09:11:57,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:11:57,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:11:57,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:11:57,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:11:57,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:11:57,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:11:57,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:11:57,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:11:57,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:11:57,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:11:57,675 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:11:57,677 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:11:57,787 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-03-03 09:11:57,803 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-03 09:11:57,803 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:11:57,812 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:11:57,812 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:11:57,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:11:57 BoogieIcfgContainer [2025-03-03 09:11:57,813 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:11:57,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:11:57,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:11:57,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:11:57,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:11:57" (1/3) ... [2025-03-03 09:11:57,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0b5d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:11:57, skipping insertion in model container [2025-03-03 09:11:57,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:57" (2/3) ... [2025-03-03 09:11:57,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0b5d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:11:57, skipping insertion in model container [2025-03-03 09:11:57,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:11:57" (3/3) ... [2025-03-03 09:11:57,821 INFO L128 eAbstractionObserver]: Analyzing ICFG max20-1.i [2025-03-03 09:11:57,833 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:11:57,835 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG max20-1.i that has 2 procedures, 23 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 09:11:57,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:11:57,880 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;@1bd68e9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:11:57,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:11:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.3529411764705883) 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-03 09:11:57,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:11:57,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:11:57,891 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:11:57,892 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:11:57,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:11:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1825817222, now seen corresponding path program 1 times [2025-03-03 09:11:57,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:11:57,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878503131] [2025-03-03 09:11:57,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:11:57,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:11:57,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:11:57,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:11:57,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:11:57,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:11:58,092 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-03 09:11:58,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:11:58,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878503131] [2025-03-03 09:11:58,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878503131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:11:58,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:11:58,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:11:58,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074468855] [2025-03-03 09:11:58,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:11:58,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:11:58,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:11:58,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:11:58,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:11:58,114 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.3529411764705883) 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) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-03 09:11:58,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:11:58,138 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2025-03-03 09:11:58,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:11:58,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 24 [2025-03-03 09:11:58,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:11:58,146 INFO L225 Difference]: With dead ends: 44 [2025-03-03 09:11:58,146 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 09:11:58,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:11:58,151 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:11:58,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:11:58,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 09:11:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-03 09:11:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-03 09:11:58,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-03 09:11:58,181 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 24 [2025-03-03 09:11:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:11:58,182 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-03 09:11:58,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-03 09:11:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-03-03 09:11:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:11:58,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:11:58,184 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-03 09:11:58,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:11:58,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:11:58,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:11:58,185 INFO L85 PathProgramCache]: Analyzing trace with hash 931786130, now seen corresponding path program 1 times [2025-03-03 09:11:58,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:11:58,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47404206] [2025-03-03 09:11:58,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:11:58,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:11:58,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:11:58,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:11:58,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:11:58,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:11:58,320 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-03 09:11:58,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:11:58,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47404206] [2025-03-03 09:11:58,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47404206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:11:58,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056639611] [2025-03-03 09:11:58,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:11:58,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:11:58,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:11:58,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:11:58,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:11:58,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:11:58,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:11:58,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:11:58,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:11:58,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:11:58,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:11:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:11:58,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:11:58,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056639611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:11:58,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:11:58,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:11:58,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098918570] [2025-03-03 09:11:58,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:11:58,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:11:58,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:11:58,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:11:58,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:11:58,431 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:11:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:11:58,448 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2025-03-03 09:11:58,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:11:58,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-03-03 09:11:58,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:11:58,449 INFO L225 Difference]: With dead ends: 38 [2025-03-03 09:11:58,449 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 09:11:58,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:11:58,450 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:11:58,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 40 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:11:58,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 09:11:58,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-03-03 09:11:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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-03 09:11:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-03-03 09:11:58,456 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 25 [2025-03-03 09:11:58,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:11:58,457 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-03 09:11:58,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:11:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2025-03-03 09:11:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 09:11:58,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:11:58,459 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:11:58,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:11:58,660 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-03 09:11:58,660 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:11:58,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:11:58,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1233153597, now seen corresponding path program 1 times [2025-03-03 09:11:58,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:11:58,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316500103] [2025-03-03 09:11:58,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:11:58,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:11:58,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 09:11:58,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 09:11:58,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:11:58,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:11:58,760 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 09:11:58,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:11:58,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316500103] [2025-03-03 09:11:58,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316500103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:11:58,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555346794] [2025-03-03 09:11:58,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:11:58,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:11:58,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:11:58,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:11:58,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:11:58,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 09:11:58,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 09:11:58,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:11:58,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:11:58,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:11:58,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:11:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:11:58,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:11:58,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555346794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:11:58,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:11:58,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:11:58,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396511426] [2025-03-03 09:11:58,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:11:58,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:11:58,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:11:58,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:11:58,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:11:58,849 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:11:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:11:58,857 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-03-03 09:11:58,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:11:58,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-03-03 09:11:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:11:58,858 INFO L225 Difference]: With dead ends: 34 [2025-03-03 09:11:58,858 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 09:11:58,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:11:58,859 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:11:58,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:11:58,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 09:11:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-03 09:11:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-03 09:11:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-03-03 09:11:58,862 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 34 [2025-03-03 09:11:58,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:11:58,863 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-03 09:11:58,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:11:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2025-03-03 09:11:58,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 09:11:58,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:11:58,864 INFO L218 NwaCegarLoop]: trace histogram [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-03 09:11:58,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:11:59,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 09:11:59,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:11:59,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:11:59,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1894170635, now seen corresponding path program 1 times [2025-03-03 09:11:59,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:11:59,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125767582] [2025-03-03 09:11:59,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:11:59,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:11:59,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 09:11:59,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:11:59,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:11:59,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:11:59,135 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 09:11:59,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:11:59,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125767582] [2025-03-03 09:11:59,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125767582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:11:59,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283838517] [2025-03-03 09:11:59,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:11:59,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:11:59,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:11:59,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:11:59,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:11:59,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 09:11:59,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:11:59,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:11:59,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:11:59,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:11:59,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:11:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 09:11:59,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:11:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 09:11:59,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283838517] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:11:59,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:11:59,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 09:11:59,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804244996] [2025-03-03 09:11:59,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:11:59,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:11:59,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:11:59,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:11:59,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:11:59,272 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:11:59,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:11:59,284 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2025-03-03 09:11:59,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:11:59,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 35 [2025-03-03 09:11:59,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:11:59,285 INFO L225 Difference]: With dead ends: 43 [2025-03-03 09:11:59,286 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 09:11:59,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:11:59,287 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:11:59,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:11:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 09:11:59,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-03 09:11:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-03 09:11:59,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-03-03 09:11:59,290 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 35 [2025-03-03 09:11:59,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:11:59,290 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-03-03 09:11:59,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:11:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-03-03 09:11:59,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 09:11:59,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:11:59,294 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:11:59,302 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-03 09:11:59,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:11:59,494 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:11:59,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:11:59,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1933667363, now seen corresponding path program 2 times [2025-03-03 09:11:59,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:11:59,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518427807] [2025-03-03 09:11:59,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:11:59,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:11:59,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 09:11:59,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:11:59,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:11:59,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:11:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 09:11:59,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:11:59,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518427807] [2025-03-03 09:11:59,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518427807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:11:59,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297301794] [2025-03-03 09:11:59,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:11:59,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:11:59,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:11:59,583 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-03 09:11:59,585 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-03 09:11:59,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 09:11:59,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:11:59,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:11:59,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:11:59,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:11:59,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:11:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 09:11:59,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:11:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 09:11:59,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297301794] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:11:59,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:11:59,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-03 09:11:59,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932682577] [2025-03-03 09:11:59,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:11:59,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:11:59,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:11:59,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:11:59,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:11:59,786 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 09:11:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:11:59,821 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2025-03-03 09:11:59,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 09:11:59,822 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 38 [2025-03-03 09:11:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:11:59,823 INFO L225 Difference]: With dead ends: 54 [2025-03-03 09:11:59,824 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 09:11:59,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:11:59,825 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:11:59,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 93 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:11:59,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 09:11:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-03-03 09:11:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-03 09:11:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-03-03 09:11:59,832 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 38 [2025-03-03 09:11:59,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:11:59,833 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-03-03 09:11:59,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 09:11:59,833 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-03-03 09:11:59,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 09:11:59,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:11:59,833 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:11:59,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:12:00,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:12:00,038 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:12:00,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:12:00,039 INFO L85 PathProgramCache]: Analyzing trace with hash -931593962, now seen corresponding path program 3 times [2025-03-03 09:12:00,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:12:00,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211184574] [2025-03-03 09:12:00,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:12:00,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:12:00,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 6 equivalence classes. [2025-03-03 09:12:00,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 53 statements. [2025-03-03 09:12:00,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:12:00,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-03 09:12:00,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:12:00,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211184574] [2025-03-03 09:12:00,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211184574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:12:00,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861525634] [2025-03-03 09:12:00,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:12:00,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:12:00,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:12:00,097 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-03 09:12:00,099 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-03 09:12:00,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 6 equivalence classes. [2025-03-03 09:12:00,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 53 statements. [2025-03-03 09:12:00,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:12:00,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:00,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:12:00,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:12:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 40 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 09:12:00,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:12:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-03 09:12:00,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861525634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:12:00,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:12:00,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 09:12:00,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220563701] [2025-03-03 09:12:00,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:12:00,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:12:00,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:12:00,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:12:00,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:12:00,199 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:12:00,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:12:00,217 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2025-03-03 09:12:00,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:12:00,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2025-03-03 09:12:00,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:12:00,220 INFO L225 Difference]: With dead ends: 52 [2025-03-03 09:12:00,220 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 09:12:00,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:12:00,221 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:12:00,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:12:00,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 09:12:00,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-03 09:12:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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-03 09:12:00,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-03-03 09:12:00,228 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 53 [2025-03-03 09:12:00,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:12:00,228 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-03 09:12:00,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:12:00,228 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-03-03 09:12:00,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 09:12:00,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:12:00,229 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:12:00,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:12:00,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:12:00,429 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:12:00,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:12:00,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1423900378, now seen corresponding path program 4 times [2025-03-03 09:12:00,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:12:00,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416800146] [2025-03-03 09:12:00,430 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:12:00,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:12:00,447 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-03 09:12:00,456 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 09:12:00,456 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:12:00,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-03 09:12:00,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:12:00,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416800146] [2025-03-03 09:12:00,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416800146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:12:00,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487474064] [2025-03-03 09:12:00,517 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:12:00,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:12:00,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:12:00,519 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-03 09:12:00,520 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-03 09:12:00,570 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-03 09:12:00,611 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 09:12:00,611 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:12:00,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:00,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:12:00,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:12:00,625 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-03 09:12:00,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:12:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-03 09:12:00,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487474064] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:12:00,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:12:00,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 09:12:00,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844735901] [2025-03-03 09:12:00,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:12:00,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:12:00,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:12:00,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:12:00,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:12:00,670 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:12:00,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:12:00,704 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2025-03-03 09:12:00,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:12:00,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-03-03 09:12:00,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:12:00,706 INFO L225 Difference]: With dead ends: 72 [2025-03-03 09:12:00,706 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 09:12:00,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:12:00,706 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:12:00,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 80 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:12:00,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 09:12:00,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 09:12:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 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-03 09:12:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2025-03-03 09:12:00,714 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 56 [2025-03-03 09:12:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:12:00,714 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2025-03-03 09:12:00,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:12:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2025-03-03 09:12:00,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 09:12:00,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:12:00,714 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 10, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:12:00,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 09:12:00,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:12:00,917 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:12:00,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:12:00,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1208008090, now seen corresponding path program 5 times [2025-03-03 09:12:00,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:12:00,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495982133] [2025-03-03 09:12:00,917 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:12:00,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:12:00,933 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 92 statements into 14 equivalence classes. [2025-03-03 09:12:01,008 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 81 of 92 statements. [2025-03-03 09:12:01,008 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-03 09:12:01,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:01,178 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 123 proven. 174 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-03-03 09:12:01,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:12:01,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495982133] [2025-03-03 09:12:01,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495982133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:12:01,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914654752] [2025-03-03 09:12:01,180 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:12:01,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:12:01,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:12:01,182 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-03 09:12:01,185 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-03 09:12:01,255 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 92 statements into 14 equivalence classes. [2025-03-03 09:12:01,458 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 81 of 92 statements. [2025-03-03 09:12:01,459 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-03 09:12:01,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:01,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:12:01,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:12:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 244 proven. 51 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-03 09:12:01,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:12:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-03-03 09:12:01,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914654752] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:12:01,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:12:01,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-03 09:12:01,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219807280] [2025-03-03 09:12:01,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:12:01,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 09:12:01,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:12:01,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 09:12:01,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:12:01,602 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 09:12:01,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:12:01,654 INFO L93 Difference]: Finished difference Result 108 states and 145 transitions. [2025-03-03 09:12:01,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 09:12:01,654 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 92 [2025-03-03 09:12:01,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:12:01,655 INFO L225 Difference]: With dead ends: 108 [2025-03-03 09:12:01,655 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 09:12:01,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:12:01,656 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:12:01,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 124 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:12:01,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 09:12:01,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-03 09:12:01,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.25) internal successors, (85), 68 states have internal predecessors, (85), 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-03 09:12:01,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2025-03-03 09:12:01,661 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 92 [2025-03-03 09:12:01,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:12:01,661 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2025-03-03 09:12:01,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 09:12:01,661 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2025-03-03 09:12:01,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 09:12:01,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:12:01,662 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 10, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:12:01,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 09:12:01,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:12:01,863 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:12:01,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:12:01,863 INFO L85 PathProgramCache]: Analyzing trace with hash 815864602, now seen corresponding path program 6 times [2025-03-03 09:12:01,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:12:01,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124744146] [2025-03-03 09:12:01,863 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:12:01,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:12:01,893 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 164 statements into 30 equivalence classes. [2025-03-03 09:12:01,936 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 52 of 164 statements. [2025-03-03 09:12:01,936 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:12:01,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-03 09:12:02,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:12:02,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124744146] [2025-03-03 09:12:02,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124744146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:12:02,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999924652] [2025-03-03 09:12:02,038 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:12:02,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:12:02,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:12:02,040 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:12:02,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:12:02,125 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 164 statements into 30 equivalence classes. [2025-03-03 09:12:02,171 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 52 of 164 statements. [2025-03-03 09:12:02,171 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:12:02,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:02,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 09:12:02,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:12:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 1250 proven. 10 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2025-03-03 09:12:02,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:12:02,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-03 09:12:02,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999924652] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:12:02,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:12:02,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 14 [2025-03-03 09:12:02,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358583596] [2025-03-03 09:12:02,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:12:02,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:12:02,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:12:02,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:12:02,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:12:02,271 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:12:02,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:12:02,298 INFO L93 Difference]: Finished difference Result 130 states and 168 transitions. [2025-03-03 09:12:02,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:12:02,299 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 164 [2025-03-03 09:12:02,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:12:02,301 INFO L225 Difference]: With dead ends: 130 [2025-03-03 09:12:02,302 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 09:12:02,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:12:02,303 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:12:02,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:12:02,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 09:12:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 09:12:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 74 states have internal predecessors, (91), 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-03 09:12:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2025-03-03 09:12:02,313 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 164 [2025-03-03 09:12:02,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:12:02,313 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2025-03-03 09:12:02,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:12:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2025-03-03 09:12:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 09:12:02,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:12:02,317 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 10, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:12:02,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 09:12:02,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 09:12:02,518 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:12:02,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:12:02,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1974783590, now seen corresponding path program 7 times [2025-03-03 09:12:02,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:12:02,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984774480] [2025-03-03 09:12:02,519 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:12:02,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:12:02,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 09:12:02,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 09:12:02,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:12:02,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-03 09:12:02,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:12:02,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984774480] [2025-03-03 09:12:02,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984774480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:12:02,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102556258] [2025-03-03 09:12:02,923 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:12:02,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:12:02,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:12:02,926 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:12:02,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:12:03,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 09:12:03,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 09:12:03,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:12:03,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:03,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:12:03,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:12:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-03 09:12:03,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:12:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-03 09:12:03,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102556258] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:12:03,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:12:03,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-03-03 09:12:03,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403666229] [2025-03-03 09:12:03,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:12:03,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 09:12:03,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:12:03,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 09:12:03,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:12:03,331 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:12:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:12:03,356 INFO L93 Difference]: Finished difference Result 155 states and 200 transitions. [2025-03-03 09:12:03,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 09:12:03,357 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 170 [2025-03-03 09:12:03,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:12:03,359 INFO L225 Difference]: With dead ends: 155 [2025-03-03 09:12:03,359 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 09:12:03,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 328 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:12:03,361 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 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-03 09:12:03,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:12:03,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 09:12:03,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-03 09:12:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.2023809523809523) internal successors, (101), 84 states have internal predecessors, (101), 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-03 09:12:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2025-03-03 09:12:03,370 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 170 [2025-03-03 09:12:03,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:12:03,370 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2025-03-03 09:12:03,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:12:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2025-03-03 09:12:03,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 09:12:03,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:12:03,372 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 20, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:12:03,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 09:12:03,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 09:12:03,573 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:12:03,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:12:03,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1834221722, now seen corresponding path program 8 times [2025-03-03 09:12:03,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:12:03,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218081158] [2025-03-03 09:12:03,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:12:03,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:12:03,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-03-03 09:12:03,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 09:12:03,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:12:03,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2986 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 1461 trivial. 0 not checked. [2025-03-03 09:12:04,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:12:04,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218081158] [2025-03-03 09:12:04,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218081158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:12:04,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461092188] [2025-03-03 09:12:04,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:12:04,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:12:04,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:12:04,072 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:12:04,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:12:04,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-03-03 09:12:04,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 09:12:04,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:12:04,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:04,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 09:12:04,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:12:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2986 backedges. 1236 proven. 287 refuted. 0 times theorem prover too weak. 1463 trivial. 0 not checked. [2025-03-03 09:12:04,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:12:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2986 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 1461 trivial. 0 not checked. [2025-03-03 09:12:04,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461092188] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:12:04,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:12:04,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-03 09:12:04,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549325055] [2025-03-03 09:12:04,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:12:04,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 09:12:04,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:12:04,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 09:12:04,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:12:04,523 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 23 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:12:04,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:12:04,592 INFO L93 Difference]: Finished difference Result 172 states and 221 transitions. [2025-03-03 09:12:04,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 09:12:04,592 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 180 [2025-03-03 09:12:04,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:12:04,593 INFO L225 Difference]: With dead ends: 172 [2025-03-03 09:12:04,593 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 09:12:04,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 344 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:12:04,594 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 47 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:12:04,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 149 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:12:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 09:12:04,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-03 09:12:04,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 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-03 09:12:04,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2025-03-03 09:12:04,605 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 180 [2025-03-03 09:12:04,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:12:04,605 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2025-03-03 09:12:04,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:12:04,605 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2025-03-03 09:12:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-03 09:12:04,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:12:04,609 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 20, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:12:04,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 09:12:04,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 09:12:04,810 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:12:04,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:12:04,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2021356870, now seen corresponding path program 9 times [2025-03-03 09:12:04,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:12:04,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668084059] [2025-03-03 09:12:04,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:12:04,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:12:04,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 234 statements into 42 equivalence classes. [2025-03-03 09:12:04,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 73 of 234 statements. [2025-03-03 09:12:04,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 09:12:04,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5767 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5712 trivial. 0 not checked. [2025-03-03 09:12:05,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:12:05,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668084059] [2025-03-03 09:12:05,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668084059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:12:05,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44674770] [2025-03-03 09:12:05,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:12:05,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:12:05,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:12:05,063 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:12:05,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:12:05,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 234 statements into 42 equivalence classes. [2025-03-03 09:12:05,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 73 of 234 statements. [2025-03-03 09:12:05,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 09:12:05,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:05,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 09:12:05,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:12:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5767 backedges. 2488 proven. 55 refuted. 0 times theorem prover too weak. 3224 trivial. 0 not checked. [2025-03-03 09:12:05,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:12:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5767 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5712 trivial. 0 not checked. [2025-03-03 09:12:05,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44674770] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:12:05,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:12:05,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2025-03-03 09:12:05,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532168661] [2025-03-03 09:12:05,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:12:05,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 09:12:05,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:12:05,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 09:12:05,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:12:05,910 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:12:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:12:05,933 INFO L93 Difference]: Finished difference Result 185 states and 238 transitions. [2025-03-03 09:12:05,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 09:12:05,935 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 234 [2025-03-03 09:12:05,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:12:05,936 INFO L225 Difference]: With dead ends: 185 [2025-03-03 09:12:05,936 INFO L226 Difference]: Without dead ends: 116 [2025-03-03 09:12:05,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 456 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:12:05,936 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:12:05,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:12:05,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-03 09:12:05,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-03 09:12:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 111 states have internal predecessors, (134), 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-03 09:12:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 140 transitions. [2025-03-03 09:12:05,948 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 140 transitions. Word has length 234 [2025-03-03 09:12:05,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:12:05,948 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 140 transitions. [2025-03-03 09:12:05,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:12:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2025-03-03 09:12:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-03 09:12:05,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:12:05,950 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 20, 19, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:12:05,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 09:12:06,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 09:12:06,150 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:12:06,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:12:06,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1929289462, now seen corresponding path program 10 times [2025-03-03 09:12:06,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:12:06,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151474411] [2025-03-03 09:12:06,151 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:12:06,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:12:06,178 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 243 statements into 2 equivalence classes. [2025-03-03 09:12:06,391 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 243 of 243 statements. [2025-03-03 09:12:06,392 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:12:06,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5902 backedges. 87 proven. 3127 refuted. 0 times theorem prover too weak. 2688 trivial. 0 not checked. [2025-03-03 09:12:08,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:12:08,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151474411] [2025-03-03 09:12:08,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151474411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:12:08,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608256614] [2025-03-03 09:12:08,848 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:12:08,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:12:08,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:12:08,851 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:12:08,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:12:08,998 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 243 statements into 2 equivalence classes. [2025-03-03 09:12:09,120 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 243 of 243 statements. [2025-03-03 09:12:09,120 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:12:09,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:09,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 09:12:09,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:12:09,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:09,343 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 47 treesize of output 20 [2025-03-03 09:12:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5902 backedges. 3542 proven. 380 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2025-03-03 09:12:09,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:12:10,421 INFO L349 Elim1Store]: treesize reduction 19, result has 70.3 percent of original size [2025-03-03 09:12:10,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 55 [2025-03-03 09:12:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5902 backedges. 1256 proven. 2663 refuted. 0 times theorem prover too weak. 1983 trivial. 0 not checked. [2025-03-03 09:12:10,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608256614] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:12:10,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:12:10,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 14] total 35 [2025-03-03 09:12:10,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950797441] [2025-03-03 09:12:10,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:12:10,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 09:12:10,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:12:10,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 09:12:10,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1013, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 09:12:10,492 INFO L87 Difference]: Start difference. First operand 116 states and 140 transitions. Second operand has 35 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 6 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-03 09:12:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:12:10,967 INFO L93 Difference]: Finished difference Result 402 states and 509 transitions. [2025-03-03 09:12:10,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 09:12:10,967 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 6 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 243 [2025-03-03 09:12:10,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:12:10,968 INFO L225 Difference]: With dead ends: 402 [2025-03-03 09:12:10,968 INFO L226 Difference]: Without dead ends: 254 [2025-03-03 09:12:10,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 467 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=1383, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 09:12:10,970 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 44 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:12:10,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 176 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:12:10,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-03 09:12:10,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 246. [2025-03-03 09:12:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 238 states have (on average 1.26890756302521) internal successors, (302), 239 states have internal predecessors, (302), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 09:12:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 313 transitions. [2025-03-03 09:12:10,980 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 313 transitions. Word has length 243 [2025-03-03 09:12:10,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:12:10,981 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 313 transitions. [2025-03-03 09:12:10,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 6 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-03 09:12:10,981 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 313 transitions. [2025-03-03 09:12:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-03 09:12:10,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:12:10,983 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 59, 20, 19, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:12:10,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 09:12:11,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:12:11,183 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:12:11,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:12:11,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1796965717, now seen corresponding path program 1 times [2025-03-03 09:12:11,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:12:11,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345320047] [2025-03-03 09:12:11,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:12:11,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:12:11,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-03-03 09:12:11,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-03-03 09:12:11,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:12:11,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5902 backedges. 1155 proven. 3950 refuted. 0 times theorem prover too weak. 797 trivial. 0 not checked. [2025-03-03 09:12:25,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:12:25,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345320047] [2025-03-03 09:12:25,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345320047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:12:25,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691670458] [2025-03-03 09:12:25,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:12:25,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:12:25,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:12:25,918 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:12:25,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:12:26,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-03-03 09:12:26,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-03-03 09:12:26,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:12:26,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:12:26,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1154 conjuncts, 336 conjuncts are in the unsatisfiable core [2025-03-03 09:12:26,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:12:26,400 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-03 09:12:36,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:36,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 171 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 231 treesize of output 200 [2025-03-03 09:12:42,853 INFO L349 Elim1Store]: treesize reduction 136, result has 0.7 percent of original size [2025-03-03 09:12:42,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 36 select indices, 36 select index equivalence classes, 171 disjoint index pairs (out of 630 index pairs), introduced 36 new quantified variables, introduced 630 case distinctions, treesize of input 465 treesize of output 419 [2025-03-03 09:12:43,430 INFO L349 Elim1Store]: treesize reduction 136, result has 0.7 percent of original size [2025-03-03 09:12:43,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 35 select indices, 35 select index equivalence classes, 171 disjoint index pairs (out of 595 index pairs), introduced 35 new quantified variables, introduced 595 case distinctions, treesize of input 454 treesize of output 416 [2025-03-03 09:12:43,962 INFO L349 Elim1Store]: treesize reduction 136, result has 0.7 percent of original size [2025-03-03 09:12:43,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 35 select indices, 35 select index equivalence classes, 153 disjoint index pairs (out of 595 index pairs), introduced 35 new quantified variables, introduced 595 case distinctions, treesize of input 454 treesize of output 409 [2025-03-03 09:12:44,564 INFO L349 Elim1Store]: treesize reduction 144, result has 12.2 percent of original size [2025-03-03 09:12:44,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 34 select indices, 34 select index equivalence classes, 136 disjoint index pairs (out of 561 index pairs), introduced 34 new quantified variables, introduced 562 case distinctions, treesize of input 441 treesize of output 409 [2025-03-03 09:12:44,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:44,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 120 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 220 treesize of output 186 [2025-03-03 09:12:45,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:45,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 105 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 207 treesize of output 174 [2025-03-03 09:12:45,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:45,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 91 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 194 treesize of output 162 [2025-03-03 09:12:45,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:45,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 181 treesize of output 150 [2025-03-03 09:12:46,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:46,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 66 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 168 treesize of output 138 [2025-03-03 09:12:46,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:46,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 55 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 155 treesize of output 126 [2025-03-03 09:12:46,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:46,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 142 treesize of output 114 [2025-03-03 09:12:46,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:46,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 129 treesize of output 102 [2025-03-03 09:12:46,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:46,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 116 treesize of output 90 [2025-03-03 09:12:47,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:47,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 103 treesize of output 78 [2025-03-03 09:12:47,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:47,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 90 treesize of output 66 [2025-03-03 09:12:47,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:47,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 54 [2025-03-03 09:12:47,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:47,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 42 [2025-03-03 09:12:47,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:47,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 30 [2025-03-03 09:12:47,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:47,981 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 49 treesize of output 25 [2025-03-03 09:12:48,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:12:48,129 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 40 treesize of output 20 [2025-03-03 09:12:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5902 backedges. 23 proven. 5487 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-03 09:12:52,900 INFO L312 TraceCheckSpWp]: Computing backward predicates...