./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array28_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/array28_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 8b49bb3ea989868d96c18ff859c95dc74ebb805f64994c11617c2c5b61c8e87f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 13:49:11,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 13:49:11,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 13:49:11,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 13:49:11,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 13:49:11,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 13:49:11,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 13:49:11,356 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 13:49:11,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 13:49:11,357 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 13:49:11,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 13:49:11,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 13:49:11,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 13:49:11,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 13:49:11,358 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 13:49:11,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 13:49:11,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 13:49:11,359 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 13:49:11,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 13:49:11,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 13:49:11,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 13:49:11,359 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 13:49:11,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 13:49:11,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 13:49:11,360 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 13:49:11,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 13:49:11,360 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 13:49:11,360 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 13:49:11,360 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 13:49:11,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 13:49:11,361 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 13:49:11,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 13:49:11,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:49:11,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 13:49:11,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 13:49:11,361 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 13:49:11,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 13:49:11,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 13:49:11,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 13:49:11,362 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 13:49:11,362 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 13:49:11,362 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 13:49:11,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 13:49:11,362 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 -> 8b49bb3ea989868d96c18ff859c95dc74ebb805f64994c11617c2c5b61c8e87f [2025-03-16 13:49:11,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 13:49:11,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 13:49:11,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 13:49:11,622 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 13:49:11,623 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 13:49:11,624 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array28_pattern.c [2025-03-16 13:49:12,759 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0b59a244/8c8ea973b8a446f791aa234af2b47163/FLAG2d4610bec [2025-03-16 13:49:13,011 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 13:49:13,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array28_pattern.c [2025-03-16 13:49:13,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0b59a244/8c8ea973b8a446f791aa234af2b47163/FLAG2d4610bec [2025-03-16 13:49:13,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0b59a244/8c8ea973b8a446f791aa234af2b47163 [2025-03-16 13:49:13,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 13:49:13,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 13:49:13,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 13:49:13,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 13:49:13,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 13:49:13,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:49:13" (1/1) ... [2025-03-16 13:49:13,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a29f463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:13, skipping insertion in model container [2025-03-16 13:49:13,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:49:13" (1/1) ... [2025-03-16 13:49:13,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 13:49:13,151 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/array28_pattern.c[1246,1259] [2025-03-16 13:49:13,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:49:13,175 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 13:49:13,182 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/array28_pattern.c[1246,1259] [2025-03-16 13:49:13,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:49:13,199 INFO L204 MainTranslator]: Completed translation [2025-03-16 13:49:13,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:13 WrapperNode [2025-03-16 13:49:13,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 13:49:13,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 13:49:13,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 13:49:13,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 13:49:13,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:13" (1/1) ... [2025-03-16 13:49:13,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:13" (1/1) ... [2025-03-16 13:49:13,225 INFO L138 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-03-16 13:49:13,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 13:49:13,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 13:49:13,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 13:49:13,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 13:49:13,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:13" (1/1) ... [2025-03-16 13:49:13,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:13" (1/1) ... [2025-03-16 13:49:13,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:13" (1/1) ... [2025-03-16 13:49:13,247 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 3 writes are split as follows [0, 3]. [2025-03-16 13:49:13,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:13" (1/1) ... [2025-03-16 13:49:13,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:13" (1/1) ... [2025-03-16 13:49:13,252 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:13" (1/1) ... [2025-03-16 13:49:13,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:13" (1/1) ... [2025-03-16 13:49:13,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:13" (1/1) ... [2025-03-16 13:49:13,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:13" (1/1) ... [2025-03-16 13:49:13,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 13:49:13,260 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 13:49:13,260 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 13:49:13,260 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 13:49:13,261 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:13" (1/1) ... [2025-03-16 13:49:13,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:49:13,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:49:13,287 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-16 13:49:13,290 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-16 13:49:13,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 13:49:13,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 13:49:13,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 13:49:13,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 13:49:13,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 13:49:13,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 13:49:13,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 13:49:13,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 13:49:13,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 13:49:13,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 13:49:13,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 13:49:13,357 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 13:49:13,360 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 13:49:13,462 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: 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-16 13:49:13,467 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-16 13:49:13,468 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 13:49:13,473 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 13:49:13,474 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 13:49:13,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:49:13 BoogieIcfgContainer [2025-03-16 13:49:13,474 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 13:49:13,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 13:49:13,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 13:49:13,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 13:49:13,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 01:49:13" (1/3) ... [2025-03-16 13:49:13,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1b3dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:49:13, skipping insertion in model container [2025-03-16 13:49:13,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:13" (2/3) ... [2025-03-16 13:49:13,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1b3dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:49:13, skipping insertion in model container [2025-03-16 13:49:13,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:49:13" (3/3) ... [2025-03-16 13:49:13,482 INFO L128 eAbstractionObserver]: Analyzing ICFG array28_pattern.c [2025-03-16 13:49:13,493 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 13:49:13,494 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array28_pattern.c that has 1 procedures, 17 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-16 13:49:13,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 13:49:13,531 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;@5dc1474b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 13:49:13,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 13:49:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:13,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 13:49:13,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:13,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:13,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:13,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:13,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2077304463, now seen corresponding path program 1 times [2025-03-16 13:49:13,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:13,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584332296] [2025-03-16 13:49:13,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:49:13,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:13,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 13:49:13,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 13:49:13,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:49:13,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:13,632 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-16 13:49:13,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:13,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584332296] [2025-03-16 13:49:13,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584332296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:49:13,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:49:13,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 13:49:13,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212120576] [2025-03-16 13:49:13,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:49:13,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 13:49:13,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:13,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 13:49:13,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 13:49:13,652 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:13,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:13,660 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2025-03-16 13:49:13,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 13:49:13,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-16 13:49:13,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:13,665 INFO L225 Difference]: With dead ends: 32 [2025-03-16 13:49:13,665 INFO L226 Difference]: Without dead ends: 13 [2025-03-16 13:49:13,666 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-16 13:49:13,668 INFO L435 NwaCegarLoop]: 22 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, 22 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-16 13:49:13,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:49:13,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-16 13:49:13,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-16 13:49:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-03-16 13:49:13,686 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 7 [2025-03-16 13:49:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:13,686 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-16 13:49:13,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2025-03-16 13:49:13,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 13:49:13,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:13,686 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:13,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 13:49:13,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:13,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:13,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2048675312, now seen corresponding path program 1 times [2025-03-16 13:49:13,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:13,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056341796] [2025-03-16 13:49:13,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:49:13,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:13,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 13:49:13,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 13:49:13,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:49:13,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:13,814 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-16 13:49:13,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:13,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056341796] [2025-03-16 13:49:13,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056341796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:49:13,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:49:13,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 13:49:13,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123660945] [2025-03-16 13:49:13,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:49:13,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 13:49:13,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:13,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 13:49:13,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:49:13,816 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:13,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:13,839 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2025-03-16 13:49:13,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 13:49:13,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-16 13:49:13,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:13,839 INFO L225 Difference]: With dead ends: 18 [2025-03-16 13:49:13,839 INFO L226 Difference]: Without dead ends: 15 [2025-03-16 13:49:13,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:49:13,840 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:13,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 36 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:49:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-16 13:49:13,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-16 13:49:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:13,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2025-03-16 13:49:13,843 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 7 [2025-03-16 13:49:13,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:13,843 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-03-16 13:49:13,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:13,843 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2025-03-16 13:49:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 13:49:13,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:13,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:13,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 13:49:13,844 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:13,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:13,844 INFO L85 PathProgramCache]: Analyzing trace with hash -511235052, now seen corresponding path program 1 times [2025-03-16 13:49:13,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:13,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369495395] [2025-03-16 13:49:13,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:49:13,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:13,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 13:49:13,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 13:49:13,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:49:13,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 13:49:13,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:13,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369495395] [2025-03-16 13:49:13,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369495395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:49:13,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:49:13,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 13:49:13,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899113552] [2025-03-16 13:49:13,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:49:13,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 13:49:13,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:13,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 13:49:13,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:49:13,932 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:13,976 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2025-03-16 13:49:13,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 13:49:13,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-16 13:49:13,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:13,977 INFO L225 Difference]: With dead ends: 31 [2025-03-16 13:49:13,978 INFO L226 Difference]: Without dead ends: 23 [2025-03-16 13:49:13,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-16 13:49:13,979 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:13,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 14 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:49:13,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-16 13:49:13,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2025-03-16 13:49:13,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:13,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2025-03-16 13:49:13,986 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 10 [2025-03-16 13:49:13,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:13,986 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-03-16 13:49:13,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2025-03-16 13:49:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 13:49:13,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:13,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:13,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 13:49:13,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:13,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:13,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2074478779, now seen corresponding path program 1 times [2025-03-16 13:49:13,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:13,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338903148] [2025-03-16 13:49:13,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:49:13,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:13,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 13:49:14,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 13:49:14,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:49:14,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 13:49:14,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:14,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338903148] [2025-03-16 13:49:14,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338903148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:49:14,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:49:14,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 13:49:14,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441585166] [2025-03-16 13:49:14,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:49:14,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 13:49:14,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:14,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 13:49:14,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:49:14,061 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:14,129 INFO L93 Difference]: Finished difference Result 37 states and 56 transitions. [2025-03-16 13:49:14,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 13:49:14,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-16 13:49:14,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:14,130 INFO L225 Difference]: With dead ends: 37 [2025-03-16 13:49:14,130 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 13:49:14,130 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-16 13:49:14,131 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:14,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 12 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:49:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 13:49:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2025-03-16 13:49:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-03-16 13:49:14,138 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2025-03-16 13:49:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:14,138 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-16 13:49:14,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2025-03-16 13:49:14,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 13:49:14,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:14,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:14,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 13:49:14,140 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:14,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:14,140 INFO L85 PathProgramCache]: Analyzing trace with hash -437375497, now seen corresponding path program 1 times [2025-03-16 13:49:14,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:14,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553244540] [2025-03-16 13:49:14,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:49:14,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:14,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-16 13:49:14,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 13:49:14,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:49:14,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 13:49:14,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6051687] [2025-03-16 13:49:14,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:49:14,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:14,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:49:14,169 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-16 13:49:14,171 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-16 13:49:14,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-16 13:49:14,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 13:49:14,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:49:14,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:14,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 13:49:14,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:49:14,289 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-16 13:49:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:49:14,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:49:14,436 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 21 treesize of output 19 [2025-03-16 13:49:14,439 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 28 treesize of output 26 [2025-03-16 13:49:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:49:14,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:14,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553244540] [2025-03-16 13:49:14,469 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 13:49:14,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6051687] [2025-03-16 13:49:14,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6051687] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:49:14,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 13:49:14,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2025-03-16 13:49:14,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131120444] [2025-03-16 13:49:14,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 13:49:14,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 13:49:14,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:14,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 13:49:14,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-16 13:49:14,471 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:14,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:14,598 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2025-03-16 13:49:14,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 13:49:14,599 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-16 13:49:14,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:14,600 INFO L225 Difference]: With dead ends: 39 [2025-03-16 13:49:14,600 INFO L226 Difference]: Without dead ends: 36 [2025-03-16 13:49:14,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-16 13:49:14,601 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:14,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 41 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:49:14,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-16 13:49:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2025-03-16 13:49:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2025-03-16 13:49:14,606 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 16 [2025-03-16 13:49:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:14,606 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2025-03-16 13:49:14,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2025-03-16 13:49:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 13:49:14,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:14,607 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:14,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 13:49:14,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:14,811 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:14,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:14,812 INFO L85 PathProgramCache]: Analyzing trace with hash -672783249, now seen corresponding path program 2 times [2025-03-16 13:49:14,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:14,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289283391] [2025-03-16 13:49:14,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:49:14,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:14,817 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-16 13:49:14,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 13:49:14,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:49:14,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 13:49:14,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:14,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289283391] [2025-03-16 13:49:14,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289283391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:49:14,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066497625] [2025-03-16 13:49:14,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:49:14,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:14,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:49:14,893 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-16 13:49:14,894 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-16 13:49:14,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-16 13:49:14,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 13:49:14,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:49:14,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:14,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 13:49:14,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:49:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:49:15,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:49:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:49:15,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066497625] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:49:15,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:49:15,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-16 13:49:15,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151230406] [2025-03-16 13:49:15,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:49:15,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 13:49:15,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:15,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 13:49:15,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-16 13:49:15,050 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:15,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:15,256 INFO L93 Difference]: Finished difference Result 120 states and 191 transitions. [2025-03-16 13:49:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 13:49:15,257 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-16 13:49:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:15,257 INFO L225 Difference]: With dead ends: 120 [2025-03-16 13:49:15,257 INFO L226 Difference]: Without dead ends: 99 [2025-03-16 13:49:15,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2025-03-16 13:49:15,258 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 82 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:15,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 27 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:49:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-16 13:49:15,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2025-03-16 13:49:15,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.5789473684210527) internal successors, (120), 76 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:15,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2025-03-16 13:49:15,268 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 17 [2025-03-16 13:49:15,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:15,268 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2025-03-16 13:49:15,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2025-03-16 13:49:15,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 13:49:15,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:15,268 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:15,274 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-16 13:49:15,469 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,SelfDestructingSolverStorable5 [2025-03-16 13:49:15,469 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:15,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:15,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1167053517, now seen corresponding path program 3 times [2025-03-16 13:49:15,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:15,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167946565] [2025-03-16 13:49:15,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:49:15,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:15,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 4 equivalence classes. [2025-03-16 13:49:15,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 13:49:15,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 13:49:15,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:49:15,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:15,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167946565] [2025-03-16 13:49:15,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167946565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:49:15,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261223818] [2025-03-16 13:49:15,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:49:15,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:15,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:49:15,538 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-16 13:49:15,540 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-16 13:49:15,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 4 equivalence classes. [2025-03-16 13:49:15,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 13:49:15,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 13:49:15,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:15,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 13:49:15,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:49:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:49:15,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:49:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:49:15,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261223818] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:49:15,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:49:15,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-16 13:49:15,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484006723] [2025-03-16 13:49:15,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:49:15,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 13:49:15,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:15,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 13:49:15,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 13:49:15,665 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:15,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:15,743 INFO L93 Difference]: Finished difference Result 122 states and 189 transitions. [2025-03-16 13:49:15,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 13:49:15,745 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-16 13:49:15,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:15,747 INFO L225 Difference]: With dead ends: 122 [2025-03-16 13:49:15,747 INFO L226 Difference]: Without dead ends: 110 [2025-03-16 13:49:15,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-16 13:49:15,747 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:15,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 34 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:49:15,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-16 13:49:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 78. [2025-03-16 13:49:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 77 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2025-03-16 13:49:15,761 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 19 [2025-03-16 13:49:15,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:15,761 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2025-03-16 13:49:15,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:15,761 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2025-03-16 13:49:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 13:49:15,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:15,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:15,768 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-16 13:49:15,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:15,962 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:15,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:15,963 INFO L85 PathProgramCache]: Analyzing trace with hash -311128372, now seen corresponding path program 1 times [2025-03-16 13:49:15,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:15,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479459923] [2025-03-16 13:49:15,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:49:15,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:15,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 13:49:15,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 13:49:15,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:49:15,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:49:16,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:16,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479459923] [2025-03-16 13:49:16,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479459923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:49:16,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12775537] [2025-03-16 13:49:16,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:49:16,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:16,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:49:16,051 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-16 13:49:16,052 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-16 13:49:16,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 13:49:16,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 13:49:16,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:49:16,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:16,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 13:49:16,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:49:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:49:16,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:49:16,167 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:49:16,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12775537] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:49:16,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:49:16,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-16 13:49:16,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863537404] [2025-03-16 13:49:16,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:49:16,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 13:49:16,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:16,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 13:49:16,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-16 13:49:16,169 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:16,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:16,297 INFO L93 Difference]: Finished difference Result 163 states and 254 transitions. [2025-03-16 13:49:16,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 13:49:16,298 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-16 13:49:16,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:16,298 INFO L225 Difference]: With dead ends: 163 [2025-03-16 13:49:16,298 INFO L226 Difference]: Without dead ends: 96 [2025-03-16 13:49:16,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2025-03-16 13:49:16,299 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 83 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:16,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 17 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:49:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-16 13:49:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2025-03-16 13:49:16,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2025-03-16 13:49:16,308 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 21 [2025-03-16 13:49:16,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:16,308 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2025-03-16 13:49:16,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2025-03-16 13:49:16,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 13:49:16,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:16,309 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:16,315 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-16 13:49:16,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:16,509 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:16,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:16,510 INFO L85 PathProgramCache]: Analyzing trace with hash 417407695, now seen corresponding path program 1 times [2025-03-16 13:49:16,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:16,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884860407] [2025-03-16 13:49:16,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:49:16,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:16,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 13:49:16,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 13:49:16,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:49:16,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 13:49:16,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:16,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884860407] [2025-03-16 13:49:16,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884860407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:49:16,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028756634] [2025-03-16 13:49:16,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:49:16,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:16,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:49:16,588 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-16 13:49:16,589 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-16 13:49:16,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 13:49:16,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 13:49:16,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:49:16,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:16,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 13:49:16,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:49:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 13:49:16,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:49:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 13:49:16,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028756634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:49:16,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:49:16,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-16 13:49:16,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689928118] [2025-03-16 13:49:16,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:49:16,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 13:49:16,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:16,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 13:49:16,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 13:49:16,720 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:16,810 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2025-03-16 13:49:16,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 13:49:16,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-16 13:49:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:16,811 INFO L225 Difference]: With dead ends: 83 [2025-03-16 13:49:16,811 INFO L226 Difference]: Without dead ends: 71 [2025-03-16 13:49:16,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-16 13:49:16,812 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:16,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 21 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:49:16,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-16 13:49:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2025-03-16 13:49:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2025-03-16 13:49:16,842 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 25 [2025-03-16 13:49:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:16,842 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-03-16 13:49:16,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2025-03-16 13:49:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 13:49:16,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:16,843 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:16,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 13:49:17,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:17,044 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:17,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash 851936282, now seen corresponding path program 2 times [2025-03-16 13:49:17,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:17,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332859175] [2025-03-16 13:49:17,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:49:17,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:17,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-16 13:49:17,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 13:49:17,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:49:17,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 13:49:17,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:17,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332859175] [2025-03-16 13:49:17,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332859175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:49:17,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937812953] [2025-03-16 13:49:17,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:49:17,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:17,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:49:17,152 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-16 13:49:17,153 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-16 13:49:17,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-16 13:49:17,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 13:49:17,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:49:17,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:17,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 13:49:17,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:49:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 13:49:17,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:49:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 13:49:17,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937812953] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:49:17,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:49:17,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2025-03-16 13:49:17,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762043239] [2025-03-16 13:49:17,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:49:17,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 13:49:17,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:17,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 13:49:17,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-16 13:49:17,311 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:17,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:17,687 INFO L93 Difference]: Finished difference Result 137 states and 200 transitions. [2025-03-16 13:49:17,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 13:49:17,687 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-16 13:49:17,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:17,688 INFO L225 Difference]: With dead ends: 137 [2025-03-16 13:49:17,688 INFO L226 Difference]: Without dead ends: 98 [2025-03-16 13:49:17,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=890, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 13:49:17,690 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 76 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:17,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 26 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 13:49:17,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-16 13:49:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 40. [2025-03-16 13:49:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:17,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2025-03-16 13:49:17,698 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 30 [2025-03-16 13:49:17,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:17,698 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2025-03-16 13:49:17,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2025-03-16 13:49:17,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 13:49:17,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:17,699 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:17,707 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-16 13:49:17,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:17,899 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:17,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:17,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1132457667, now seen corresponding path program 3 times [2025-03-16 13:49:17,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:17,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423012236] [2025-03-16 13:49:17,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:49:17,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:17,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 6 equivalence classes. [2025-03-16 13:49:17,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 13:49:17,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-16 13:49:17,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 13:49:17,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [882602282] [2025-03-16 13:49:17,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:49:17,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:17,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:49:17,924 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-16 13:49:17,926 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-16 13:49:17,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 6 equivalence classes. [2025-03-16 13:49:18,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 32 of 34 statements. [2025-03-16 13:49:18,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-16 13:49:18,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:18,068 WARN L254 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-16 13:49:18,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:49:18,127 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-16 13:49:18,212 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 20 [2025-03-16 13:49:18,287 INFO L349 Elim1Store]: treesize reduction 36, result has 46.3 percent of original size [2025-03-16 13:49:18,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2025-03-16 13:49:18,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:18,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:18,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:18,534 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-16 13:49:18,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 69 [2025-03-16 13:49:19,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:19,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:19,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:19,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:19,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:19,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:19,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:19,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:19,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:19,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:19,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:49:19,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 50 [2025-03-16 13:49:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 13:49:19,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:49:19,943 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 75 treesize of output 71 [2025-03-16 13:49:19,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:49:19,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 494 treesize of output 470 [2025-03-16 13:49:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 13:49:20,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:20,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423012236] [2025-03-16 13:49:20,058 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 13:49:20,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882602282] [2025-03-16 13:49:20,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882602282] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:49:20,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 13:49:20,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2025-03-16 13:49:20,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260345921] [2025-03-16 13:49:20,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 13:49:20,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-16 13:49:20,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:20,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-16 13:49:20,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1592, Unknown=0, NotChecked=0, Total=1892 [2025-03-16 13:49:20,061 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 44 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 44 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:24,463 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~row~0#1| 1)) (.cse7 (* |c_ULTIMATE.start_main_~column~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (.cse1 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) (.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse5 (* |c_ULTIMATE.start_main_~row~0#1| 8)) (.cse6 (* |c_ULTIMATE.start_main_~column~0#1| 4)) (.cse9 (+ |c_ULTIMATE.start_main_~column~0#1| 1)) (.cse8 (* |c_ULTIMATE.start_main_~row~0#1| |c_ULTIMATE.start_main_~num~0#1|)) (.cse2 (not (= c_~ARR_SIZE~0 2)))) (and (or (= (+ (select .cse0 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse0 (+ 12 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (select .cse0 (+ 8 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (select .cse0 .cse1)) 0) .cse2 (< |c_ULTIMATE.start_main_~row~0#1| 2)) (or (< |c_ULTIMATE.start_main_~column~0#1| .cse3) .cse2 (= (let ((.cse4 (store .cse0 (+ .cse5 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse6) (+ .cse7 .cse8)))) (+ (select .cse4 |c_ULTIMATE.start_main_~#array~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse4 .cse1) 1)) 0)) (or (< .cse3 c_~ARR_SIZE~0) (not (= c_~ARR_SIZE~0 .cse9)) (= (+ (select .cse0 (+ (* |c_ULTIMATE.start_main_~row~0#1| (* c_~ARR_SIZE~0 4)) |c_ULTIMATE.start_main_~#array~0#1.offset| .cse6)) |c_ULTIMATE.start_main_~sum~0#1|) 0)) (<= 1 c_~ARR_SIZE~0) (or (= (+ |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |c_ULTIMATE.start_main_~row~0#1| 0))) (= (select .cse0 0) 0) (or (and (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse7 |c_ULTIMATE.start_main_~num~0#1| .cse8 1) 0) (= (+ (* |c_ULTIMATE.start_main_~row~0#1| 2) |c_ULTIMATE.start_main_~column~0#1|) 0)) .cse2 (not (= |c_ULTIMATE.start_main_~row~0#1| |c_ULTIMATE.start_main_~column~0#1|))) (= (+ (select .cse0 4) 1) 0) (= |c_ULTIMATE.start_main_~#array~0#1.offset| 0) (= |c_ULTIMATE.start_main_~sum~0#1| 0) (or (= (let ((.cse10 (store .cse0 (+ .cse5 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 .cse6) (+ (* .cse9 |c_ULTIMATE.start_main_~num~0#1|) .cse8)))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select .cse10 .cse1) (select .cse10 |c_ULTIMATE.start_main_~#array~0#1.offset|) 1)) 0) .cse2 (< |c_ULTIMATE.start_main_~column~0#1| |c_ULTIMATE.start_main_~row~0#1|)))) is different from false [2025-03-16 13:49:55,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:55,895 INFO L93 Difference]: Finished difference Result 276 states and 391 transitions. [2025-03-16 13:49:55,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2025-03-16 13:49:55,896 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 44 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-16 13:49:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:55,897 INFO L225 Difference]: With dead ends: 276 [2025-03-16 13:49:55,897 INFO L226 Difference]: Without dead ends: 240 [2025-03-16 13:49:55,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12099 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=5819, Invalid=26046, Unknown=1, NotChecked=354, Total=32220 [2025-03-16 13:49:55,906 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 165 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:55,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 69 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1418 Invalid, 0 Unknown, 38 Unchecked, 1.7s Time] [2025-03-16 13:49:55,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-16 13:49:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 141. [2025-03-16 13:49:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.3714285714285714) internal successors, (192), 140 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 192 transitions. [2025-03-16 13:49:55,935 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 192 transitions. Word has length 34 [2025-03-16 13:49:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:55,935 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 192 transitions. [2025-03-16 13:49:55,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 44 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 192 transitions. [2025-03-16 13:49:55,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 13:49:55,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:55,937 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:55,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 13:49:56,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:56,138 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:56,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:56,139 INFO L85 PathProgramCache]: Analyzing trace with hash -768284999, now seen corresponding path program 4 times [2025-03-16 13:49:56,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:56,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155462606] [2025-03-16 13:49:56,139 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:49:56,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:56,148 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-16 13:49:56,153 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 36 statements. [2025-03-16 13:49:56,153 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 13:49:56,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 13:49:56,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:56,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155462606] [2025-03-16 13:49:56,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155462606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:49:56,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742522768] [2025-03-16 13:49:56,228 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:49:56,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:56,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:49:56,230 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-16 13:49:56,232 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-16 13:49:56,268 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-16 13:49:56,279 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 36 statements. [2025-03-16 13:49:56,279 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 13:49:56,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:56,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 13:49:56,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:49:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 13:49:56,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:49:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 13:49:56,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742522768] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:49:56,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:49:56,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-16 13:49:56,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10863920] [2025-03-16 13:49:56,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:49:56,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 13:49:56,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:56,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 13:49:56,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-16 13:49:56,368 INFO L87 Difference]: Start difference. First operand 141 states and 192 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:56,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:56,482 INFO L93 Difference]: Finished difference Result 311 states and 417 transitions. [2025-03-16 13:49:56,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 13:49:56,483 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-16 13:49:56,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:56,484 INFO L225 Difference]: With dead ends: 311 [2025-03-16 13:49:56,484 INFO L226 Difference]: Without dead ends: 209 [2025-03-16 13:49:56,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 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-16 13:49:56,484 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:56,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 20 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:49:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-16 13:49:56,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 177. [2025-03-16 13:49:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.3352272727272727) internal successors, (235), 176 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 235 transitions. [2025-03-16 13:49:56,526 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 235 transitions. Word has length 36 [2025-03-16 13:49:56,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:56,526 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 235 transitions. [2025-03-16 13:49:56,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 235 transitions. [2025-03-16 13:49:56,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 13:49:56,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:56,528 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:56,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 13:49:56,728 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,SelfDestructingSolverStorable11 [2025-03-16 13:49:56,729 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:56,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:56,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1234427052, now seen corresponding path program 5 times [2025-03-16 13:49:56,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:56,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988281103] [2025-03-16 13:49:56,729 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:49:56,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:56,735 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 6 equivalence classes. [2025-03-16 13:49:56,743 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 34 of 41 statements. [2025-03-16 13:49:56,743 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-16 13:49:56,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:56,802 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 13:49:56,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:56,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988281103] [2025-03-16 13:49:56,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988281103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:49:56,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359429489] [2025-03-16 13:49:56,802 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:49:56,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:56,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:49:56,804 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-16 13:49:56,806 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-16 13:49:56,845 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 6 equivalence classes. [2025-03-16 13:49:57,018 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 34 of 41 statements. [2025-03-16 13:49:57,018 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-16 13:49:57,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:57,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 13:49:57,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:49:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 22 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 13:49:57,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:49:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 22 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 13:49:57,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359429489] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:49:57,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:49:57,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-03-16 13:49:57,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574034633] [2025-03-16 13:49:57,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:49:57,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 13:49:57,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:57,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 13:49:57,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-16 13:49:57,114 INFO L87 Difference]: Start difference. First operand 177 states and 235 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:57,245 INFO L93 Difference]: Finished difference Result 258 states and 346 transitions. [2025-03-16 13:49:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 13:49:57,246 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-16 13:49:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:57,246 INFO L225 Difference]: With dead ends: 258 [2025-03-16 13:49:57,246 INFO L226 Difference]: Without dead ends: 92 [2025-03-16 13:49:57,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2025-03-16 13:49:57,247 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 49 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:57,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 25 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:49:57,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-16 13:49:57,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 70. [2025-03-16 13:49:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.173913043478261) internal successors, (81), 69 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2025-03-16 13:49:57,258 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 41 [2025-03-16 13:49:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:57,258 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2025-03-16 13:49:57,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:57,258 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2025-03-16 13:49:57,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 13:49:57,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:57,259 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:57,265 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-16 13:49:57,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 13:49:57,459 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:57,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:57,459 INFO L85 PathProgramCache]: Analyzing trace with hash -956667244, now seen corresponding path program 6 times [2025-03-16 13:49:57,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:57,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104423382] [2025-03-16 13:49:57,460 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 13:49:57,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:57,465 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 9 equivalence classes. [2025-03-16 13:49:57,484 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 42 of 51 statements. [2025-03-16 13:49:57,484 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-16 13:49:57,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 10 proven. 105 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-16 13:49:57,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:57,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104423382] [2025-03-16 13:49:57,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104423382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:49:57,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247444175] [2025-03-16 13:49:57,605 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 13:49:57,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:57,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:49:57,607 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-16 13:49:57,607 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-16 13:49:57,642 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 9 equivalence classes. [2025-03-16 13:49:57,825 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 42 of 51 statements. [2025-03-16 13:49:57,825 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-16 13:49:57,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:57,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 13:49:57,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:49:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 36 proven. 67 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-16 13:49:57,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:49:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-16 13:49:57,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247444175] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:49:57,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:49:57,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2025-03-16 13:49:57,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314186030] [2025-03-16 13:49:57,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:49:57,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 13:49:57,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:57,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 13:49:57,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-16 13:49:57,988 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:58,275 INFO L93 Difference]: Finished difference Result 124 states and 146 transitions. [2025-03-16 13:49:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-16 13:49:58,275 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-16 13:49:58,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:58,276 INFO L225 Difference]: With dead ends: 124 [2025-03-16 13:49:58,276 INFO L226 Difference]: Without dead ends: 111 [2025-03-16 13:49:58,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 87 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=374, Invalid=1266, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 13:49:58,277 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 124 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:58,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 33 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:49:58,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-16 13:49:58,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 71. [2025-03-16 13:49:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 70 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:58,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2025-03-16 13:49:58,289 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 51 [2025-03-16 13:49:58,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:58,289 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2025-03-16 13:49:58,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:58,290 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2025-03-16 13:49:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 13:49:58,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:58,291 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:58,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 13:49:58,491 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,SelfDestructingSolverStorable13 [2025-03-16 13:49:58,491 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:58,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:58,492 INFO L85 PathProgramCache]: Analyzing trace with hash 357788540, now seen corresponding path program 7 times [2025-03-16 13:49:58,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:58,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329596203] [2025-03-16 13:49:58,492 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 13:49:58,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:58,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 13:49:58,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 13:49:58,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:49:58,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 25 proven. 71 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-16 13:49:58,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:58,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329596203] [2025-03-16 13:49:58,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329596203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:49:58,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238463262] [2025-03-16 13:49:58,610 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 13:49:58,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:58,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:49:58,612 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-16 13:49:58,613 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-16 13:49:58,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 13:49:58,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 13:49:58,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:49:58,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:58,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 13:49:58,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:49:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 30 proven. 66 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-16 13:49:58,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:49:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 30 proven. 66 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-16 13:49:58,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238463262] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:49:58,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:49:58,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-16 13:49:58,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118814534] [2025-03-16 13:49:58,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:49:58,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 13:49:58,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:58,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 13:49:58,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-16 13:49:58,787 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:58,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:58,897 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2025-03-16 13:49:58,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 13:49:58,897 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 13:49:58,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:58,898 INFO L225 Difference]: With dead ends: 83 [2025-03-16 13:49:58,898 INFO L226 Difference]: Without dead ends: 71 [2025-03-16 13:49:58,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 105 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2025-03-16 13:49:58,898 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 44 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:58,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 17 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:49:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-16 13:49:58,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2025-03-16 13:49:58,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:58,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2025-03-16 13:49:58,908 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 58 [2025-03-16 13:49:58,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:58,909 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2025-03-16 13:49:58,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:49:58,909 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2025-03-16 13:49:58,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 13:49:58,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:58,909 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:58,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-16 13:49:59,109 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,SelfDestructingSolverStorable14 [2025-03-16 13:49:59,110 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:59,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:59,110 INFO L85 PathProgramCache]: Analyzing trace with hash -401724722, now seen corresponding path program 8 times [2025-03-16 13:49:59,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:59,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092225717] [2025-03-16 13:49:59,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:49:59,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:59,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-16 13:49:59,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 13:49:59,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:49:59,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 13:49:59,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887087884] [2025-03-16 13:49:59,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:49:59,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:59,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:49:59,130 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-16 13:49:59,131 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-16 13:49:59,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-16 13:49:59,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 13:49:59,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:49:59,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:59,302 WARN L254 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-16 13:49:59,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:49:59,351 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-16 13:49:59,403 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 20 [2025-03-16 13:49:59,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:49:59,485 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 32 [2025-03-16 13:49:59,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:49:59,597 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-16 13:49:59,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:49:59,717 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 50 treesize of output 58 [2025-03-16 13:49:59,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:59,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:49:59,855 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 61 treesize of output 74 [2025-03-16 13:50:00,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:50:00,013 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 72 treesize of output 86 [2025-03-16 13:50:00,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:50:00,191 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 83 treesize of output 100 [2025-03-16 13:50:00,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:00,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:50:00,370 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 94 treesize of output 114 [2025-03-16 13:50:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:50:01,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:50:11,582 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 1323 treesize of output 1305