./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array13_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array13_pattern.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78699f7813351c3df7f7fcab3bf98fffd7a92c5cc679034a9d139e9169232d7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:36:59,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:36:59,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:36:59,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:36:59,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:36:59,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:36:59,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:36:59,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:36:59,116 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:36:59,116 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:36:59,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:36:59,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:36:59,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:36:59,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:36:59,118 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:36:59,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:36:59,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:36:59,118 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:36:59,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:36:59,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:36:59,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:36:59,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:36:59,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:36:59,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:36:59,119 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:36:59,119 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:36:59,119 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:36:59,119 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:36:59,119 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:36:59,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:36:59,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:36:59,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:36:59,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:36:59,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:36:59,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:36:59,120 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:36:59,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:36:59,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:36:59,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:36:59,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:36:59,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:36:59,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:36:59,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:36:59,120 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 -> 78699f7813351c3df7f7fcab3bf98fffd7a92c5cc679034a9d139e9169232d7e [2025-03-08 00:36:59,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:36:59,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:36:59,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:36:59,342 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:36:59,342 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:36:59,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array13_pattern.c [2025-03-08 00:37:00,443 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/192e69541/10922bcadef248d7b24b1defa21263f3/FLAG0d5639122 [2025-03-08 00:37:00,669 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:37:00,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array13_pattern.c [2025-03-08 00:37:00,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/192e69541/10922bcadef248d7b24b1defa21263f3/FLAG0d5639122 [2025-03-08 00:37:01,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/192e69541/10922bcadef248d7b24b1defa21263f3 [2025-03-08 00:37:01,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:37:01,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:37:01,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:37:01,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:37:01,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:37:01,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:37:01" (1/1) ... [2025-03-08 00:37:01,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762996bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:01, skipping insertion in model container [2025-03-08 00:37:01,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:37:01" (1/1) ... [2025-03-08 00:37:01,038 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:37:01,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array13_pattern.c[1342,1355] [2025-03-08 00:37:01,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:37:01,163 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:37:01,170 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array13_pattern.c[1342,1355] [2025-03-08 00:37:01,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:37:01,197 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:37:01,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:01 WrapperNode [2025-03-08 00:37:01,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:37:01,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:37:01,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:37:01,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:37:01,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:01" (1/1) ... [2025-03-08 00:37:01,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:01" (1/1) ... [2025-03-08 00:37:01,219 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2025-03-08 00:37:01,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:37:01,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:37:01,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:37:01,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:37:01,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:01" (1/1) ... [2025-03-08 00:37:01,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:01" (1/1) ... [2025-03-08 00:37:01,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:01" (1/1) ... [2025-03-08 00:37:01,241 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-08 00:37:01,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:01" (1/1) ... [2025-03-08 00:37:01,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:01" (1/1) ... [2025-03-08 00:37:01,245 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:01" (1/1) ... [2025-03-08 00:37:01,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:01" (1/1) ... [2025-03-08 00:37:01,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:01" (1/1) ... [2025-03-08 00:37:01,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:01" (1/1) ... [2025-03-08 00:37:01,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:37:01,249 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:37:01,249 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:37:01,249 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:37:01,249 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:01" (1/1) ... [2025-03-08 00:37:01,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:37:01,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:01,272 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:37:01,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:37:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:37:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 00:37:01,297 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 00:37:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:37:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:37:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:37:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:37:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:37:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:37:01,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:37:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:37:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:37:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:37:01,356 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:37:01,358 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:37:01,475 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2025-03-08 00:37:01,488 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 00:37:01,488 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:37:01,494 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:37:01,495 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:37:01,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:37:01 BoogieIcfgContainer [2025-03-08 00:37:01,495 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:37:01,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:37:01,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:37:01,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:37:01,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:37:01" (1/3) ... [2025-03-08 00:37:01,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f2c2fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:37:01, skipping insertion in model container [2025-03-08 00:37:01,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:01" (2/3) ... [2025-03-08 00:37:01,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f2c2fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:37:01, skipping insertion in model container [2025-03-08 00:37:01,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:37:01" (3/3) ... [2025-03-08 00:37:01,502 INFO L128 eAbstractionObserver]: Analyzing ICFG array13_pattern.c [2025-03-08 00:37:01,512 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:37:01,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array13_pattern.c that has 2 procedures, 26 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-08 00:37:01,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:37:01,557 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;@29a4fa34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:37:01,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:37:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:37:01,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 00:37:01,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:01,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:01,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:01,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:01,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1686619525, now seen corresponding path program 1 times [2025-03-08 00:37:01,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:01,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649442525] [2025-03-08 00:37:01,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:01,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:01,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 00:37:01,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:37:01,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:01,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:37:01,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:01,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649442525] [2025-03-08 00:37:01,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649442525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:37:01,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:37:01,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:37:01,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631038492] [2025-03-08 00:37:01,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:37:01,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:37:01,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:01,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:37:01,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:37:01,681 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 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 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 00:37:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:01,691 INFO L93 Difference]: Finished difference Result 49 states and 71 transitions. [2025-03-08 00:37:01,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:37:01,692 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-08 00:37:01,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:01,695 INFO L225 Difference]: With dead ends: 49 [2025-03-08 00:37:01,695 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 00:37:01,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:37:01,698 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:01,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:37:01,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 00:37:01,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-08 00:37:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:37:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2025-03-08 00:37:01,729 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 14 [2025-03-08 00:37:01,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:01,729 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-08 00:37:01,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 00:37:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2025-03-08 00:37:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 00:37:01,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:01,730 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:01,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:37:01,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:01,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:01,731 INFO L85 PathProgramCache]: Analyzing trace with hash 835071108, now seen corresponding path program 1 times [2025-03-08 00:37:01,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:01,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589251149] [2025-03-08 00:37:01,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:01,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:01,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 00:37:01,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:37:01,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:01,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:37:01,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:01,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589251149] [2025-03-08 00:37:01,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589251149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:01,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140469031] [2025-03-08 00:37:01,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:01,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:01,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:01,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:01,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:37:02,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 00:37:02,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:37:02,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:02,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:02,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:37:02,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:02,130 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:37:02,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:37:02,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140469031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:37:02,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:37:02,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-08 00:37:02,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650704670] [2025-03-08 00:37:02,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:37:02,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:37:02,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:02,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:37:02,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:37:02,132 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:37:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:02,200 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2025-03-08 00:37:02,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:37:02,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-03-08 00:37:02,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:02,201 INFO L225 Difference]: With dead ends: 51 [2025-03-08 00:37:02,201 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 00:37:02,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:37:02,202 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:02,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 79 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 00:37:02,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2025-03-08 00:37:02,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 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-08 00:37:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2025-03-08 00:37:02,205 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 27 [2025-03-08 00:37:02,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:02,205 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-03-08 00:37:02,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:37:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2025-03-08 00:37:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:37:02,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:02,206 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:02,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:37:02,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:02,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:02,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1595113402, now seen corresponding path program 1 times [2025-03-08 00:37:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:02,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311539471] [2025-03-08 00:37:02,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:02,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:02,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 00:37:02,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:37:02,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:02,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:37:02,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:02,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311539471] [2025-03-08 00:37:02,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311539471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:37:02,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:37:02,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:37:02,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287737992] [2025-03-08 00:37:02,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:37:02,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:37:02,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:02,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:37:02,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:37:02,533 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:37:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:02,580 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2025-03-08 00:37:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:37:02,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-03-08 00:37:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:02,581 INFO L225 Difference]: With dead ends: 46 [2025-03-08 00:37:02,581 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 00:37:02,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:37:02,582 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:02,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 52 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:37:02,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 00:37:02,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-08 00:37:02,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:37:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2025-03-08 00:37:02,585 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 29 [2025-03-08 00:37:02,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:02,585 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-03-08 00:37:02,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:37:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2025-03-08 00:37:02,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:37:02,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:02,586 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:02,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:37:02,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:02,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:02,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1723001289, now seen corresponding path program 1 times [2025-03-08 00:37:02,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:02,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929753813] [2025-03-08 00:37:02,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:02,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:02,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 00:37:02,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:37:02,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:02,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:37:02,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:02,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929753813] [2025-03-08 00:37:02,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929753813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:02,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663836166] [2025-03-08 00:37:02,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:02,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:02,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:02,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:02,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:37:02,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 00:37:02,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:37:02,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:02,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:02,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:37:02,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:37:02,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:37:02,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663836166] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:02,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:02,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 00:37:02,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931291568] [2025-03-08 00:37:02,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:02,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:37:02,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:02,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:37:02,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:37:02,836 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:02,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:02,906 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-03-08 00:37:02,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:37:02,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2025-03-08 00:37:02,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:02,907 INFO L225 Difference]: With dead ends: 35 [2025-03-08 00:37:02,907 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 00:37:02,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:37:02,907 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:02,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 61 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:37:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 00:37:02,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-03-08 00:37:02,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:37:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-08 00:37:02,912 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 30 [2025-03-08 00:37:02,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:02,912 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-08 00:37:02,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:02,912 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-03-08 00:37:02,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 00:37:02,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:02,913 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:02,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:03,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 00:37:03,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:03,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash 866954683, now seen corresponding path program 1 times [2025-03-08 00:37:03,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:03,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084835326] [2025-03-08 00:37:03,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:03,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:03,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 00:37:03,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:37:03,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:03,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:37:03,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:03,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084835326] [2025-03-08 00:37:03,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084835326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:03,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936835045] [2025-03-08 00:37:03,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:03,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:03,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:03,279 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:03,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:37:03,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 00:37:03,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:37:03,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:03,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:03,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 00:37:03,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:37:03,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:37:03,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936835045] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:03,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:03,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11] total 21 [2025-03-08 00:37:03,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486163561] [2025-03-08 00:37:03,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:03,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 00:37:03,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:03,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 00:37:03,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-03-08 00:37:03,653 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 21 states, 18 states have (on average 2.111111111111111) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 00:37:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:04,078 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2025-03-08 00:37:04,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 00:37:04,078 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.111111111111111) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 33 [2025-03-08 00:37:04,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:04,080 INFO L225 Difference]: With dead ends: 124 [2025-03-08 00:37:04,080 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 00:37:04,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=265, Invalid=995, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 00:37:04,082 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 164 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:04,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 198 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:37:04,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 00:37:04,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 62. [2025-03-08 00:37:04,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 52 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 00:37:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2025-03-08 00:37:04,098 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 33 [2025-03-08 00:37:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:04,098 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2025-03-08 00:37:04,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.111111111111111) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 00:37:04,099 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2025-03-08 00:37:04,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 00:37:04,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:04,100 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:04,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:04,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:04,305 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:04,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash 670441178, now seen corresponding path program 1 times [2025-03-08 00:37:04,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:04,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361449396] [2025-03-08 00:37:04,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:04,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:04,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 00:37:04,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:37:04,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:04,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:37:04,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1353773901] [2025-03-08 00:37:04,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:04,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:04,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:04,332 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:04,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:37:04,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 00:37:04,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:37:04,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:04,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:04,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 00:37:04,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:04,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:37:04,672 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2025-03-08 00:37:04,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 24 [2025-03-08 00:37:04,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:37:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:37:04,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:04,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2025-03-08 00:37:04,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2025-03-08 00:37:05,051 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:37:05,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:05,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361449396] [2025-03-08 00:37:05,053 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:37:05,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353773901] [2025-03-08 00:37:05,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353773901] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:05,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:37:05,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2025-03-08 00:37:05,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158655914] [2025-03-08 00:37:05,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:05,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 00:37:05,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:05,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 00:37:05,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:37:05,056 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:37:05,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:05,956 INFO L93 Difference]: Finished difference Result 151 states and 204 transitions. [2025-03-08 00:37:05,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 00:37:05,957 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 33 [2025-03-08 00:37:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:05,958 INFO L225 Difference]: With dead ends: 151 [2025-03-08 00:37:05,958 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 00:37:05,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=388, Invalid=1774, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 00:37:05,959 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 105 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:05,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 178 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:37:05,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 00:37:05,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2025-03-08 00:37:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 86 states have internal predecessors, (114), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 00:37:06,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 136 transitions. [2025-03-08 00:37:06,000 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 136 transitions. Word has length 33 [2025-03-08 00:37:06,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:06,001 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 136 transitions. [2025-03-08 00:37:06,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:37:06,001 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 136 transitions. [2025-03-08 00:37:06,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:37:06,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:06,003 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:06,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:06,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:06,204 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:06,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash -690204692, now seen corresponding path program 2 times [2025-03-08 00:37:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:06,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512852567] [2025-03-08 00:37:06,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:37:06,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:06,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 00:37:06,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:37:06,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:37:06,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:37:06,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:06,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512852567] [2025-03-08 00:37:06,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512852567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:06,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104332397] [2025-03-08 00:37:06,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:37:06,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:06,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:06,289 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:06,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:37:06,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 00:37:06,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:37:06,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:37:06,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:06,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:37:06,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:37:06,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:37:06,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104332397] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:06,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:06,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:37:06,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286052030] [2025-03-08 00:37:06,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:06,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:37:06,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:06,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:37:06,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:37:06,412 INFO L87 Difference]: Start difference. First operand 102 states and 136 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:06,495 INFO L93 Difference]: Finished difference Result 146 states and 190 transitions. [2025-03-08 00:37:06,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:37:06,495 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2025-03-08 00:37:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:06,496 INFO L225 Difference]: With dead ends: 146 [2025-03-08 00:37:06,496 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 00:37:06,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:37:06,497 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:06,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 00:37:06,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-03-08 00:37:06,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 00:37:06,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2025-03-08 00:37:06,514 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 34 [2025-03-08 00:37:06,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:06,514 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2025-03-08 00:37:06,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:06,515 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2025-03-08 00:37:06,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:37:06,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:06,517 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:06,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:06,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:06,718 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:06,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:06,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1967955390, now seen corresponding path program 2 times [2025-03-08 00:37:06,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:06,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988890456] [2025-03-08 00:37:06,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:37:06,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:06,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 00:37:06,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:37:06,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:37:06,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 00:37:06,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:06,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988890456] [2025-03-08 00:37:06,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988890456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:06,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061510233] [2025-03-08 00:37:06,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:37:06,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:06,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:06,829 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:06,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:37:06,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 00:37:06,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:37:06,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:37:06,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:06,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:37:06,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:37:06,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 00:37:06,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061510233] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:06,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:06,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-08 00:37:06,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084954952] [2025-03-08 00:37:06,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:06,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:37:06,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:06,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:37:06,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:37:06,958 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:07,060 INFO L93 Difference]: Finished difference Result 126 states and 176 transitions. [2025-03-08 00:37:07,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:37:07,060 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2025-03-08 00:37:07,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:07,061 INFO L225 Difference]: With dead ends: 126 [2025-03-08 00:37:07,061 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 00:37:07,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:37:07,062 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:07,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 119 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 00:37:07,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2025-03-08 00:37:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 71 states have internal predecessors, (94), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 00:37:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2025-03-08 00:37:07,082 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 34 [2025-03-08 00:37:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:07,082 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. [2025-03-08 00:37:07,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:07,082 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2025-03-08 00:37:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:37:07,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:07,083 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:07,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:07,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:07,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:07,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:07,284 INFO L85 PathProgramCache]: Analyzing trace with hash -318468260, now seen corresponding path program 3 times [2025-03-08 00:37:07,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:07,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482463650] [2025-03-08 00:37:07,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:37:07,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:07,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 7 equivalence classes. [2025-03-08 00:37:07,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 38 statements. [2025-03-08 00:37:07,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:37:07,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:37:07,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:07,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482463650] [2025-03-08 00:37:07,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482463650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:07,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797716371] [2025-03-08 00:37:07,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:37:07,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:07,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:07,446 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:07,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:37:07,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 7 equivalence classes. [2025-03-08 00:37:07,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 38 statements. [2025-03-08 00:37:07,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:37:07,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:07,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 00:37:07,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 00:37:07,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:37:07,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797716371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:07,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:07,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11] total 23 [2025-03-08 00:37:07,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998150466] [2025-03-08 00:37:07,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:07,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 00:37:07,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:07,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 00:37:07,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:37:07,771 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. Second operand has 23 states, 20 states have (on average 2.2) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 00:37:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:08,034 INFO L93 Difference]: Finished difference Result 110 states and 147 transitions. [2025-03-08 00:37:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 00:37:08,035 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.2) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 38 [2025-03-08 00:37:08,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:08,035 INFO L225 Difference]: With dead ends: 110 [2025-03-08 00:37:08,036 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 00:37:08,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2025-03-08 00:37:08,036 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 97 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:08,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 149 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:37:08,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 00:37:08,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2025-03-08 00:37:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 75 states have internal predecessors, (98), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 00:37:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2025-03-08 00:37:08,048 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 38 [2025-03-08 00:37:08,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:08,049 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2025-03-08 00:37:08,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.2) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 00:37:08,049 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2025-03-08 00:37:08,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:37:08,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:08,049 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:08,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 00:37:08,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:08,254 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:08,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:08,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2054465047, now seen corresponding path program 3 times [2025-03-08 00:37:08,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:08,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265882465] [2025-03-08 00:37:08,254 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:37:08,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:08,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 6 equivalence classes. [2025-03-08 00:37:08,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 39 statements. [2025-03-08 00:37:08,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:37:08,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:08,318 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:37:08,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:08,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265882465] [2025-03-08 00:37:08,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265882465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:08,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996503387] [2025-03-08 00:37:08,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:37:08,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:08,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:08,320 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:08,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:37:08,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 6 equivalence classes. [2025-03-08 00:37:08,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 39 statements. [2025-03-08 00:37:08,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:37:08,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:08,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:37:08,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:37:08,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:37:08,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996503387] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:08,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:08,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-08 00:37:08,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396868342] [2025-03-08 00:37:08,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:08,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:37:08,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:08,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:37:08,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:37:08,426 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:37:08,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:08,484 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2025-03-08 00:37:08,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:37:08,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 39 [2025-03-08 00:37:08,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:08,485 INFO L225 Difference]: With dead ends: 95 [2025-03-08 00:37:08,485 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 00:37:08,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:37:08,486 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:08,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 88 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:37:08,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 00:37:08,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2025-03-08 00:37:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:37:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-08 00:37:08,492 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 39 [2025-03-08 00:37:08,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:08,492 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-08 00:37:08,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:37:08,492 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-03-08 00:37:08,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 00:37:08,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:08,492 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:08,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:08,692 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,SelfDestructingSolverStorable9 [2025-03-08 00:37:08,693 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:08,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:08,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1161349772, now seen corresponding path program 4 times [2025-03-08 00:37:08,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:08,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836069468] [2025-03-08 00:37:08,693 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:37:08,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:08,703 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-08 00:37:08,720 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 00:37:08,721 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:37:08,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:37:08,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [655889479] [2025-03-08 00:37:08,723 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:37:08,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:08,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:08,725 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:08,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:37:08,761 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-08 00:37:08,913 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 00:37:08,913 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:37:08,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:08,915 WARN L254 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-08 00:37:08,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:08,971 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 11 treesize of output 7 [2025-03-08 00:37:09,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:37:09,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:37:09,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 00:37:09,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:37:09,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 00:37:09,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:09,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:09,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:09,624 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-08 00:37:09,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 70 treesize of output 61 [2025-03-08 00:37:10,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:10,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:10,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:10,219 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 00:37:10,224 INFO L349 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2025-03-08 00:37:10,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 63 treesize of output 28 [2025-03-08 00:37:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:37:10,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:11,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:11,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836069468] [2025-03-08 00:37:11,119 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:37:11,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655889479] [2025-03-08 00:37:11,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655889479] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:11,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:37:11,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2025-03-08 00:37:11,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331186220] [2025-03-08 00:37:11,119 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:11,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 00:37:11,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:11,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 00:37:11,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1593, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 00:37:11,121 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:37:12,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:12,186 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2025-03-08 00:37:12,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-08 00:37:12,186 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 43 [2025-03-08 00:37:12,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:12,187 INFO L225 Difference]: With dead ends: 118 [2025-03-08 00:37:12,187 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 00:37:12,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=444, Invalid=2862, Unknown=0, NotChecked=0, Total=3306 [2025-03-08 00:37:12,188 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 71 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:12,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 217 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:37:12,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 00:37:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 65. [2025-03-08 00:37:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 56 states have internal predecessors, (69), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 00:37:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2025-03-08 00:37:12,198 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 43 [2025-03-08 00:37:12,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:12,199 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2025-03-08 00:37:12,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:37:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2025-03-08 00:37:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 00:37:12,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:12,199 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:12,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 00:37:12,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:12,400 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:12,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:12,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1626065715, now seen corresponding path program 4 times [2025-03-08 00:37:12,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:12,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918088535] [2025-03-08 00:37:12,400 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:37:12,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:12,405 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-08 00:37:12,418 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 00:37:12,418 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:37:12,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:37:12,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [97628673] [2025-03-08 00:37:12,419 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:37:12,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:12,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:12,421 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:12,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:37:12,456 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-08 00:37:12,614 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 00:37:12,614 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:37:12,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:12,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-08 00:37:12,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:12,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:37:12,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:37:12,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:37:12,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 00:37:12,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-03-08 00:37:13,219 INFO L349 Elim1Store]: treesize reduction 368, result has 13.4 percent of original size [2025-03-08 00:37:13,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 84 treesize of output 94 [2025-03-08 00:37:13,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:37:13,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 42 treesize of output 18 [2025-03-08 00:37:13,513 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:37:13,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:14,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 234 [2025-03-08 00:37:14,704 INFO L349 Elim1Store]: treesize reduction 27, result has 22.9 percent of original size [2025-03-08 00:37:14,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 144491796 treesize of output 139511068 [2025-03-08 00:37:24,585 WARN L286 SmtUtils]: Spent 9.87s on a formula simplification. DAG size of input: 2570 DAG size of output: 619 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 00:37:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:37:47,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:47,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918088535] [2025-03-08 00:37:47,510 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:37:47,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97628673] [2025-03-08 00:37:47,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97628673] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:47,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:37:47,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 45 [2025-03-08 00:37:47,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094027121] [2025-03-08 00:37:47,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:47,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 00:37:47,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:47,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 00:37:47,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 00:37:47,511 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 45 states, 45 states have (on average 1.511111111111111) internal successors, (68), 44 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 00:37:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:51,729 INFO L93 Difference]: Finished difference Result 157 states and 201 transitions. [2025-03-08 00:37:51,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-08 00:37:51,729 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.511111111111111) internal successors, (68), 44 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 43 [2025-03-08 00:37:51,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:51,730 INFO L225 Difference]: With dead ends: 157 [2025-03-08 00:37:51,730 INFO L226 Difference]: Without dead ends: 146 [2025-03-08 00:37:51,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1172, Invalid=5634, Unknown=0, NotChecked=0, Total=6806 [2025-03-08 00:37:51,732 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 159 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:51,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 476 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 00:37:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-08 00:37:51,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 101. [2025-03-08 00:37:51,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 84 states have internal predecessors, (107), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 00:37:51,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 129 transitions. [2025-03-08 00:37:51,755 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 129 transitions. Word has length 43 [2025-03-08 00:37:51,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:51,755 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 129 transitions. [2025-03-08 00:37:51,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.511111111111111) internal successors, (68), 44 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 00:37:51,755 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 129 transitions. [2025-03-08 00:37:51,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:37:51,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:51,756 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:51,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:51,956 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,SelfDestructingSolverStorable11 [2025-03-08 00:37:51,956 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:51,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:51,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1643059834, now seen corresponding path program 5 times [2025-03-08 00:37:51,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:51,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814221544] [2025-03-08 00:37:51,957 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:37:51,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:51,963 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 7 equivalence classes. [2025-03-08 00:37:51,973 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 23 of 44 statements. [2025-03-08 00:37:51,973 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 00:37:51,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:52,038 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 00:37:52,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:52,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814221544] [2025-03-08 00:37:52,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814221544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:52,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087869157] [2025-03-08 00:37:52,038 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:37:52,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:52,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:52,041 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-08 00:37:52,042 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-08 00:37:52,075 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 7 equivalence classes. [2025-03-08 00:37:52,090 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 23 of 44 statements. [2025-03-08 00:37:52,090 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 00:37:52,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:52,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:37:52,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:37:52,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 00:37:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087869157] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:52,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:52,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-08 00:37:52,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484589196] [2025-03-08 00:37:52,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:52,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:37:52,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:52,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:37:52,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:37:52,182 INFO L87 Difference]: Start difference. First operand 101 states and 129 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:52,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:52,301 INFO L93 Difference]: Finished difference Result 197 states and 252 transitions. [2025-03-08 00:37:52,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:37:52,302 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2025-03-08 00:37:52,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:52,303 INFO L225 Difference]: With dead ends: 197 [2025-03-08 00:37:52,303 INFO L226 Difference]: Without dead ends: 131 [2025-03-08 00:37:52,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:37:52,303 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:52,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 124 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:52,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-08 00:37:52,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 119. [2025-03-08 00:37:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.2727272727272727) internal successors, (126), 99 states have internal predecessors, (126), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 00:37:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 152 transitions. [2025-03-08 00:37:52,330 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 152 transitions. Word has length 44 [2025-03-08 00:37:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:52,330 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 152 transitions. [2025-03-08 00:37:52,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 152 transitions. [2025-03-08 00:37:52,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:37:52,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:52,331 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:52,337 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-08 00:37:52,531 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,SelfDestructingSolverStorable12 [2025-03-08 00:37:52,532 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:52,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:52,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1918554831, now seen corresponding path program 6 times [2025-03-08 00:37:52,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:52,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120005112] [2025-03-08 00:37:52,532 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:37:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:52,538 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 7 equivalence classes. [2025-03-08 00:37:52,563 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:37:52,563 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:37:52,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:52,648 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:37:52,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:52,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120005112] [2025-03-08 00:37:52,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120005112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:52,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514715672] [2025-03-08 00:37:52,648 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:37:52,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:52,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:52,651 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-08 00:37:52,652 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-08 00:37:52,685 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 7 equivalence classes. [2025-03-08 00:37:52,967 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:37:52,967 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:37:52,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:52,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:37:52,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:53,018 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 00:37:53,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:37:53,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514715672] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:53,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:53,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-08 00:37:53,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135087874] [2025-03-08 00:37:53,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:53,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:37:53,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:53,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:37:53,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:37:53,065 INFO L87 Difference]: Start difference. First operand 119 states and 152 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:53,250 INFO L93 Difference]: Finished difference Result 171 states and 212 transitions. [2025-03-08 00:37:53,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 00:37:53,250 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2025-03-08 00:37:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:53,251 INFO L225 Difference]: With dead ends: 171 [2025-03-08 00:37:53,251 INFO L226 Difference]: Without dead ends: 168 [2025-03-08 00:37:53,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2025-03-08 00:37:53,252 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:53,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 76 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-08 00:37:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 121. [2025-03-08 00:37:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.25) internal successors, (125), 100 states have internal predecessors, (125), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 00:37:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 151 transitions. [2025-03-08 00:37:53,283 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 151 transitions. Word has length 44 [2025-03-08 00:37:53,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:53,284 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 151 transitions. [2025-03-08 00:37:53,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2025-03-08 00:37:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:37:53,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:53,284 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:53,289 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-08 00:37:53,485 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,SelfDestructingSolverStorable13 [2025-03-08 00:37:53,485 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:53,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:53,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1253481362, now seen corresponding path program 7 times [2025-03-08 00:37:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:53,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035531477] [2025-03-08 00:37:53,485 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:37:53,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:53,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:37:53,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:37:53,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:53,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:37:53,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:53,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035531477] [2025-03-08 00:37:53,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035531477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:53,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313686088] [2025-03-08 00:37:53,572 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:37:53,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:53,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:53,575 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-08 00:37:53,576 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-08 00:37:53,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:37:53,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:37:53,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:53,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:53,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:37:53,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 43 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 00:37:53,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 35 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:37:53,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313686088] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:53,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:53,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-08 00:37:53,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139539466] [2025-03-08 00:37:53,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:53,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:37:53,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:53,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:37:53,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:37:53,749 INFO L87 Difference]: Start difference. First operand 121 states and 151 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:53,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:53,924 INFO L93 Difference]: Finished difference Result 145 states and 175 transitions. [2025-03-08 00:37:53,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 00:37:53,924 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2025-03-08 00:37:53,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:53,925 INFO L225 Difference]: With dead ends: 145 [2025-03-08 00:37:53,925 INFO L226 Difference]: Without dead ends: 114 [2025-03-08 00:37:53,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:37:53,926 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:53,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 107 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-08 00:37:53,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2025-03-08 00:37:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 93 states have (on average 1.2043010752688172) internal successors, (112), 93 states have internal predecessors, (112), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 00:37:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 134 transitions. [2025-03-08 00:37:53,954 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 134 transitions. Word has length 47 [2025-03-08 00:37:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:53,954 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 134 transitions. [2025-03-08 00:37:53,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 134 transitions. [2025-03-08 00:37:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 00:37:53,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:53,954 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:53,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:54,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 00:37:54,155 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:54,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:54,156 INFO L85 PathProgramCache]: Analyzing trace with hash 890051146, now seen corresponding path program 8 times [2025-03-08 00:37:54,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:54,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149565430] [2025-03-08 00:37:54,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:37:54,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:54,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-08 00:37:54,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:37:54,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:37:54,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:54,255 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 00:37:54,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:54,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149565430] [2025-03-08 00:37:54,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149565430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:54,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261248620] [2025-03-08 00:37:54,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:37:54,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:54,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:54,257 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:54,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 00:37:54,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-08 00:37:54,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:37:54,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:37:54,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:54,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:37:54,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:54,383 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 00:37:54,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 00:37:54,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261248620] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:54,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:54,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-08 00:37:54,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202515635] [2025-03-08 00:37:54,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:54,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 00:37:54,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:54,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 00:37:54,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:37:54,444 INFO L87 Difference]: Start difference. First operand 111 states and 134 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:54,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:54,625 INFO L93 Difference]: Finished difference Result 167 states and 205 transitions. [2025-03-08 00:37:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:37:54,626 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-03-08 00:37:54,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:54,626 INFO L225 Difference]: With dead ends: 167 [2025-03-08 00:37:54,626 INFO L226 Difference]: Without dead ends: 128 [2025-03-08 00:37:54,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:37:54,627 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:54,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 173 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:54,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-08 00:37:54,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2025-03-08 00:37:54,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 98 states have internal predecessors, (118), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 00:37:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 140 transitions. [2025-03-08 00:37:54,658 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 140 transitions. Word has length 49 [2025-03-08 00:37:54,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:54,658 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 140 transitions. [2025-03-08 00:37:54,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:37:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2025-03-08 00:37:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 00:37:54,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:54,659 INFO L218 NwaCegarLoop]: trace histogram [9, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:54,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:54,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:54,859 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:54,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:54,859 INFO L85 PathProgramCache]: Analyzing trace with hash -898709137, now seen corresponding path program 9 times [2025-03-08 00:37:54,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:54,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81955870] [2025-03-08 00:37:54,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:37:54,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:54,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 11 equivalence classes. [2025-03-08 00:37:54,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 43 of 54 statements. [2025-03-08 00:37:54,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 00:37:54,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:54,942 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 00:37:54,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:54,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81955870] [2025-03-08 00:37:54,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81955870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:54,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476169133] [2025-03-08 00:37:54,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:37:54,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:54,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:54,944 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:54,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 00:37:54,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 11 equivalence classes. [2025-03-08 00:37:55,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 43 of 54 statements. [2025-03-08 00:37:55,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 00:37:55,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:55,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:37:55,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:55,371 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 00:37:55,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 00:37:55,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476169133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:37:55,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:37:55,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-03-08 00:37:55,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044679481] [2025-03-08 00:37:55,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:55,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:37:55,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:55,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:37:55,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:37:55,405 INFO L87 Difference]: Start difference. First operand 116 states and 140 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:37:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:37:55,520 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2025-03-08 00:37:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:37:55,520 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 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 54 [2025-03-08 00:37:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:37:55,521 INFO L225 Difference]: With dead ends: 122 [2025-03-08 00:37:55,521 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 00:37:55,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 104 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:37:55,521 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:37:55,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 83 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:37:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 00:37:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-08 00:37:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.1797752808988764) internal successors, (105), 89 states have internal predecessors, (105), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 00:37:55,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2025-03-08 00:37:55,546 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 54 [2025-03-08 00:37:55,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:37:55,546 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2025-03-08 00:37:55,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:37:55,546 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2025-03-08 00:37:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 00:37:55,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:37:55,546 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:37:55,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-08 00:37:55,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 00:37:55,747 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:37:55,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:37:55,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1095474348, now seen corresponding path program 1 times [2025-03-08 00:37:55,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:37:55,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762833745] [2025-03-08 00:37:55,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:55,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:37:55,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 00:37:55,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:37:55,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:55,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:37:55,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [799898296] [2025-03-08 00:37:55,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:37:55,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:37:55,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:37:55,765 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:37:55,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 00:37:55,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 00:37:56,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:37:56,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:37:56,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:37:56,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-08 00:37:56,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:37:56,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:37:56,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:37:56,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:37:56,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 00:37:56,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 00:37:56,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:56,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:56,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:56,698 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-08 00:37:56,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 70 treesize of output 61 [2025-03-08 00:37:57,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:57,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:57,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:57,258 INFO L349 Elim1Store]: treesize reduction 330, result has 14.5 percent of original size [2025-03-08 00:37:57,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 83 treesize of output 90 [2025-03-08 00:37:57,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:57,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:57,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:37:57,821 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 00:37:57,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:37:57,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 79 treesize of output 56 [2025-03-08 00:37:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 59 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:37:57,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:37:59,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:37:59,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762833745] [2025-03-08 00:37:59,125 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:37:59,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799898296] [2025-03-08 00:37:59,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799898296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:37:59,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:37:59,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2025-03-08 00:37:59,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558588841] [2025-03-08 00:37:59,125 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:37:59,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 00:37:59,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:37:59,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 00:37:59,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1862, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 00:37:59,126 INFO L87 Difference]: Start difference. First operand 107 states and 127 transitions. Second operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 29 states have internal predecessors, (41), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 00:38:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:00,369 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2025-03-08 00:38:00,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-08 00:38:00,370 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.28125) internal successors, (41), 29 states have internal predecessors, (41), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 57 [2025-03-08 00:38:00,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:00,374 INFO L225 Difference]: With dead ends: 133 [2025-03-08 00:38:00,374 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 00:38:00,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=641, Invalid=3781, Unknown=0, NotChecked=0, Total=4422 [2025-03-08 00:38:00,375 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 52 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:00,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 145 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:38:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 00:38:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-08 00:38:00,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.170731707317073) internal successors, (96), 82 states have internal predecessors, (96), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 00:38:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2025-03-08 00:38:00,399 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 57 [2025-03-08 00:38:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:00,399 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2025-03-08 00:38:00,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.28125) internal successors, (41), 29 states have internal predecessors, (41), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 00:38:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2025-03-08 00:38:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 00:38:00,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:00,400 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:00,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 00:38:00,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 00:38:00,600 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:00,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:00,601 INFO L85 PathProgramCache]: Analyzing trace with hash 281024236, now seen corresponding path program 2 times [2025-03-08 00:38:00,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:00,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897352628] [2025-03-08 00:38:00,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:38:00,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:00,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-08 00:38:00,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:38:00,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:38:00,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:38:00,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730403650] [2025-03-08 00:38:00,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:38:00,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:00,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:38:00,629 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:38:00,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 00:38:00,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-08 00:38:01,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:38:01,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:38:01,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:01,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-03-08 00:38:01,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:38:01,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:38:01,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:38:01,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:01,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:01,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:01,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 00:38:01,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:01,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:01,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:01,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:01,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:01,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-08 00:38:01,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:01,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:01,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:01,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:01,656 INFO L349 Elim1Store]: treesize reduction 156, result has 18.3 percent of original size [2025-03-08 00:38:01,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 66 treesize of output 62 [2025-03-08 00:38:02,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,044 INFO L349 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size [2025-03-08 00:38:02,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 30 case distinctions, treesize of input 88 treesize of output 120 [2025-03-08 00:38:02,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:02,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:03,040 INFO L349 Elim1Store]: treesize reduction 28, result has 65.9 percent of original size [2025-03-08 00:38:03,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 116 treesize of output 107 [2025-03-08 00:38:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 44 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 00:38:03,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:38:04,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:04,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897352628] [2025-03-08 00:38:04,513 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:38:04,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730403650] [2025-03-08 00:38:04,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730403650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:38:04,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:38:04,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2025-03-08 00:38:04,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504415286] [2025-03-08 00:38:04,513 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:38:04,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 00:38:04,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:04,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 00:38:04,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1649, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 00:38:04,514 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:38:05,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:05,991 INFO L93 Difference]: Finished difference Result 163 states and 194 transitions. [2025-03-08 00:38:05,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-08 00:38:05,991 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2025-03-08 00:38:05,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:05,992 INFO L225 Difference]: With dead ends: 163 [2025-03-08 00:38:05,992 INFO L226 Difference]: Without dead ends: 150 [2025-03-08 00:38:05,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=368, Invalid=2494, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 00:38:05,993 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 68 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:05,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 297 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 00:38:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-08 00:38:06,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 99. [2025-03-08 00:38:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 84 states have internal predecessors, (98), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 00:38:06,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 116 transitions. [2025-03-08 00:38:06,025 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 116 transitions. Word has length 57 [2025-03-08 00:38:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:06,025 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 116 transitions. [2025-03-08 00:38:06,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:38:06,025 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2025-03-08 00:38:06,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 00:38:06,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:06,025 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:06,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 00:38:06,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:06,226 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:06,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:06,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2084035589, now seen corresponding path program 10 times [2025-03-08 00:38:06,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:06,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866279764] [2025-03-08 00:38:06,226 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:38:06,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:06,232 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 57 statements into 2 equivalence classes. [2025-03-08 00:38:06,246 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:38:06,246 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:38:06,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:38:06,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [389776910] [2025-03-08 00:38:06,247 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:38:06,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:06,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:38:06,250 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:38:06,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 00:38:06,303 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 57 statements into 2 equivalence classes. [2025-03-08 00:38:08,184 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:38:08,185 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:38:08,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:08,188 WARN L254 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 142 conjuncts are in the unsatisfiable core [2025-03-08 00:38:08,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:38:08,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:38:08,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:38:08,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:08,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 00:38:08,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:08,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-08 00:38:08,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:08,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2025-03-08 00:38:08,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:08,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 58 [2025-03-08 00:38:08,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:08,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 68 [2025-03-08 00:38:08,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:08,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 78 [2025-03-08 00:38:08,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:08,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 68 treesize of output 88 [2025-03-08 00:38:09,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:09,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:09,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:09,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:09,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:09,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:09,597 INFO L349 Elim1Store]: treesize reduction 204, result has 27.9 percent of original size [2025-03-08 00:38:09,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 42 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 159 case distinctions, treesize of input 144 treesize of output 230 [2025-03-08 00:38:11,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:11,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 133 treesize of output 57 [2025-03-08 00:38:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 8 proven. 144 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:38:11,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:38:13,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:38:13,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866279764] [2025-03-08 00:38:13,980 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:38:13,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389776910] [2025-03-08 00:38:13,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389776910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:38:13,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:38:13,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2025-03-08 00:38:13,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402633856] [2025-03-08 00:38:13,980 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:38:13,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-08 00:38:13,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:38:13,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-08 00:38:13,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=3604, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 00:38:13,982 INFO L87 Difference]: Start difference. First operand 99 states and 116 transitions. Second operand has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 40 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:38:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:38:15,317 INFO L93 Difference]: Finished difference Result 161 states and 196 transitions. [2025-03-08 00:38:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-08 00:38:15,317 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 40 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 57 [2025-03-08 00:38:15,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:38:15,318 INFO L225 Difference]: With dead ends: 161 [2025-03-08 00:38:15,318 INFO L226 Difference]: Without dead ends: 158 [2025-03-08 00:38:15,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1769 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=474, Invalid=4218, Unknown=0, NotChecked=0, Total=4692 [2025-03-08 00:38:15,319 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 75 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:38:15,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 407 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 00:38:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-08 00:38:15,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 137. [2025-03-08 00:38:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.1932773109243697) internal successors, (142), 119 states have internal predecessors, (142), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 00:38:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 164 transitions. [2025-03-08 00:38:15,369 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 164 transitions. Word has length 57 [2025-03-08 00:38:15,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:38:15,369 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 164 transitions. [2025-03-08 00:38:15,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 40 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:38:15,369 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 164 transitions. [2025-03-08 00:38:15,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 00:38:15,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:38:15,369 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:38:15,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-08 00:38:15,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:15,570 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:38:15,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:38:15,570 INFO L85 PathProgramCache]: Analyzing trace with hash 172875418, now seen corresponding path program 5 times [2025-03-08 00:38:15,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:38:15,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038497462] [2025-03-08 00:38:15,570 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:38:15,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:38:15,578 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 57 statements into 11 equivalence classes. [2025-03-08 00:38:15,610 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:38:15,610 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 00:38:15,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:38:15,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [537790492] [2025-03-08 00:38:15,611 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:38:15,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:38:15,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:38:15,613 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:38:15,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 00:38:15,668 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 57 statements into 11 equivalence classes. [2025-03-08 00:38:16,891 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:38:16,891 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 00:38:16,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:38:16,894 WARN L254 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-03-08 00:38:16,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:38:16,939 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 11 treesize of output 7 [2025-03-08 00:38:16,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:38:16,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:16,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 00:38:17,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:17,065 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2025-03-08 00:38:17,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 40 [2025-03-08 00:38:17,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:17,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:17,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:17,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:17,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:17,099 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 00:38:17,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 54 [2025-03-08 00:38:17,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:17,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:17,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:17,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:17,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:17,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:17,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:17,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:17,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:38:17,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:17,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-03-08 00:38:17,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:17,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 68 [2025-03-08 00:38:17,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:17,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 78 [2025-03-08 00:38:17,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:17,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 68 treesize of output 88 [2025-03-08 00:38:17,937 INFO L349 Elim1Store]: treesize reduction 324, result has 16.5 percent of original size [2025-03-08 00:38:17,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 54 case distinctions, treesize of input 91 treesize of output 104 [2025-03-08 00:38:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 150 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:38:18,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:38:27,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 785 treesize of output 767 [2025-03-08 00:38:28,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:38:28,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 713444443260871 treesize of output 676061047916487