./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/mlceu2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/mlceu2.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 5f6dc88ffbc484195ca6ca04cd67e8542305d5e0e0d9b35d5440f9c4d427d3ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:24:10,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:24:10,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:24:10,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:24:10,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:24:10,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:24:10,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:24:10,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:24:10,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:24:10,233 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:24:10,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:24:10,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:24:10,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:24:10,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:24:10,234 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:24:10,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:24:10,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:24:10,235 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:24:10,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:24:10,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:24:10,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:24:10,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:24:10,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:24:10,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:24:10,236 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:24:10,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:24:10,236 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:24:10,236 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:24:10,236 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:24:10,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:24:10,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:24:10,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:24:10,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:24:10,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:24:10,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:24:10,237 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:24:10,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:24:10,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:24:10,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:24:10,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:24:10,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:24:10,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:24:10,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:24:10,238 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 -> 5f6dc88ffbc484195ca6ca04cd67e8542305d5e0e0d9b35d5440f9c4d427d3ec [2025-03-08 00:24:10,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:24:10,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:24:10,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:24:10,460 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:24:10,461 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:24:10,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mlceu2.c [2025-03-08 00:24:11,591 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7784c7cfb/716216283f794cdb9fe8ab7d714ddb9a/FLAG9154fd6ab [2025-03-08 00:24:11,811 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:24:11,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mlceu2.c [2025-03-08 00:24:11,822 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7784c7cfb/716216283f794cdb9fe8ab7d714ddb9a/FLAG9154fd6ab [2025-03-08 00:24:12,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7784c7cfb/716216283f794cdb9fe8ab7d714ddb9a [2025-03-08 00:24:12,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:24:12,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:24:12,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:24:12,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:24:12,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:24:12,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:24:12" (1/1) ... [2025-03-08 00:24:12,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548803b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:12, skipping insertion in model container [2025-03-08 00:24:12,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:24:12" (1/1) ... [2025-03-08 00:24:12,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:24:12,296 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-tiling/mlceu2.c[397,410] [2025-03-08 00:24:12,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:24:12,319 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:24:12,326 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-tiling/mlceu2.c[397,410] [2025-03-08 00:24:12,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:24:12,343 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:24:12,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:12 WrapperNode [2025-03-08 00:24:12,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:24:12,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:24:12,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:24:12,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:24:12,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:12" (1/1) ... [2025-03-08 00:24:12,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:12" (1/1) ... [2025-03-08 00:24:12,367 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 44 [2025-03-08 00:24:12,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:24:12,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:24:12,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:24:12,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:24:12,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:12" (1/1) ... [2025-03-08 00:24:12,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:12" (1/1) ... [2025-03-08 00:24:12,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:12" (1/1) ... [2025-03-08 00:24:12,389 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-08 00:24:12,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:12" (1/1) ... [2025-03-08 00:24:12,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:12" (1/1) ... [2025-03-08 00:24:12,396 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:12" (1/1) ... [2025-03-08 00:24:12,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:12" (1/1) ... [2025-03-08 00:24:12,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:12" (1/1) ... [2025-03-08 00:24:12,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:12" (1/1) ... [2025-03-08 00:24:12,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:24:12,403 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:24:12,404 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:24:12,404 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:24:12,405 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:12" (1/1) ... [2025-03-08 00:24:12,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:24:12,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:12,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:24:12,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:24:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:24:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:24:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:24:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:24:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:24:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 00:24:12,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:24:12,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:24:12,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:24:12,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:24:12,498 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:24:12,500 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:24:12,611 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 00:24:12,611 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:24:12,617 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:24:12,618 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:24:12,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:24:12 BoogieIcfgContainer [2025-03-08 00:24:12,618 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:24:12,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:24:12,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:24:12,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:24:12,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:24:12" (1/3) ... [2025-03-08 00:24:12,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260513c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:24:12, skipping insertion in model container [2025-03-08 00:24:12,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:12" (2/3) ... [2025-03-08 00:24:12,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260513c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:24:12, skipping insertion in model container [2025-03-08 00:24:12,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:24:12" (3/3) ... [2025-03-08 00:24:12,627 INFO L128 eAbstractionObserver]: Analyzing ICFG mlceu2.c [2025-03-08 00:24:12,638 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:24:12,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mlceu2.c that has 1 procedures, 15 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 00:24:12,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:24:12,696 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;@366a9dfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:24:12,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:24:12,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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-08 00:24:12,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 00:24:12,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:12,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:12,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:12,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:12,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1038862573, now seen corresponding path program 1 times [2025-03-08 00:24:12,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:12,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614316208] [2025-03-08 00:24:12,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:12,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:12,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 00:24:12,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 00:24:12,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:12,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:12,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:12,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:12,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614316208] [2025-03-08 00:24:12,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614316208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:24:12,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:24:12,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:24:12,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503103473] [2025-03-08 00:24:12,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:24:12,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:24:12,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:12,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:24:12,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:24:12,938 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-08 00:24:12,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:12,985 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2025-03-08 00:24:12,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:24:12,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-08 00:24:12,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:12,992 INFO L225 Difference]: With dead ends: 30 [2025-03-08 00:24:12,992 INFO L226 Difference]: Without dead ends: 14 [2025-03-08 00:24:12,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:24:12,998 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:12,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:24:13,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-08 00:24:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-08 00:24:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-08 00:24:13,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-03-08 00:24:13,018 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2025-03-08 00:24:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:13,018 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-03-08 00:24:13,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-08 00:24:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-03-08 00:24:13,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 00:24:13,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:13,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:13,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:24:13,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:13,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:13,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1406036581, now seen corresponding path program 1 times [2025-03-08 00:24:13,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:13,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969815350] [2025-03-08 00:24:13,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:13,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:13,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:24:13,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:24:13,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:13,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:13,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:13,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969815350] [2025-03-08 00:24:13,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969815350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:13,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637492697] [2025-03-08 00:24:13,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:13,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:13,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:13,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:13,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:24:13,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:24:13,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:24:13,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:13,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:13,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:24:13,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:13,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:13,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:13,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637492697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:13,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:13,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:24:13,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279827167] [2025-03-08 00:24:13,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:13,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:24:13,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:13,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:24:13,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:24:13,288 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-08 00:24:13,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:13,323 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2025-03-08 00:24:13,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:24:13,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-08 00:24:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:13,324 INFO L225 Difference]: With dead ends: 25 [2025-03-08 00:24:13,324 INFO L226 Difference]: Without dead ends: 17 [2025-03-08 00:24:13,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:24:13,325 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:13,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 14 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:24:13,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-08 00:24:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-03-08 00:24:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 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-08 00:24:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-03-08 00:24:13,328 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2025-03-08 00:24:13,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:13,328 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-03-08 00:24:13,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-08 00:24:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-03-08 00:24:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 00:24:13,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:13,329 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:13,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:24:13,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:13,532 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:13,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash 953639469, now seen corresponding path program 2 times [2025-03-08 00:24:13,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:13,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502378872] [2025-03-08 00:24:13,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:13,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:13,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-08 00:24:13,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:24:13,565 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:13,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:13,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:13,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502378872] [2025-03-08 00:24:13,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502378872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:13,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855126409] [2025-03-08 00:24:13,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:13,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:13,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:13,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:13,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:24:13,939 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-08 00:24:13,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:24:13,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:13,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:13,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:24:13,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:13,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:24:14,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:24:14,039 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 21 treesize of output 20 [2025-03-08 00:24:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:14,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:14,247 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 14 treesize of output 12 [2025-03-08 00:24:14,251 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 14 treesize of output 12 [2025-03-08 00:24:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:24:14,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855126409] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:14,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:14,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2025-03-08 00:24:14,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870471300] [2025-03-08 00:24:14,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:14,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:24:14,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:14,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:24:14,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:24:14,267 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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-08 00:24:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:14,629 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-03-08 00:24:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:24:14,629 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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 13 [2025-03-08 00:24:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:14,630 INFO L225 Difference]: With dead ends: 32 [2025-03-08 00:24:14,630 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 00:24:14,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:24:14,631 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 43 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:14,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 26 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:24:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 00:24:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2025-03-08 00:24:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-08 00:24:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-03-08 00:24:14,636 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2025-03-08 00:24:14,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:14,637 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-03-08 00:24:14,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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-08 00:24:14,637 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-03-08 00:24:14,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 00:24:14,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:14,638 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:14,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:24:14,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 00:24:14,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:14,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:14,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1334369250, now seen corresponding path program 1 times [2025-03-08 00:24:14,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:14,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897241299] [2025-03-08 00:24:14,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:14,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:14,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 00:24:14,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:24:14,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:14,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:15,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:15,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897241299] [2025-03-08 00:24:15,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897241299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:15,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177054537] [2025-03-08 00:24:15,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:15,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:15,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:15,008 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:15,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:24:15,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 00:24:15,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:24:15,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:15,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:15,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 00:24:15,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:15,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:24:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:15,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:15,222 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 16 treesize of output 14 [2025-03-08 00:24:15,225 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 16 treesize of output 12 [2025-03-08 00:24:15,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:15,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177054537] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:15,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:15,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2025-03-08 00:24:15,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682411349] [2025-03-08 00:24:15,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:15,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:24:15,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:15,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:24:15,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:24:15,234 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 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-08 00:24:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:15,338 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2025-03-08 00:24:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:24:15,338 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 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-08 00:24:15,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:15,339 INFO L225 Difference]: With dead ends: 26 [2025-03-08 00:24:15,339 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 00:24:15,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:24:15,340 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:15,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 44 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:24:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 00:24:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2025-03-08 00:24:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-08 00:24:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2025-03-08 00:24:15,343 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2025-03-08 00:24:15,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:15,343 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-03-08 00:24:15,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 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-08 00:24:15,344 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2025-03-08 00:24:15,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 00:24:15,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:15,344 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:15,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 00:24:15,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:15,549 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:15,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:15,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2023837837, now seen corresponding path program 2 times [2025-03-08 00:24:15,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:15,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532600942] [2025-03-08 00:24:15,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:15,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:15,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-08 00:24:15,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:24:15,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:15,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:15,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:15,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532600942] [2025-03-08 00:24:15,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532600942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:15,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129463604] [2025-03-08 00:24:15,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:15,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:15,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:15,646 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:15,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:24:15,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-08 00:24:15,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:24:15,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:15,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:15,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:24:15,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:15,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:15,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129463604] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:15,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:15,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-08 00:24:15,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510980618] [2025-03-08 00:24:15,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:15,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:24:15,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:15,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:24:15,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:24:15,792 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 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-08 00:24:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:15,845 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2025-03-08 00:24:15,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:24:15,845 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 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-08 00:24:15,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:15,846 INFO L225 Difference]: With dead ends: 51 [2025-03-08 00:24:15,846 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 00:24:15,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:24:15,846 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:15,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 28 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:24:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 00:24:15,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2025-03-08 00:24:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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-08 00:24:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-03-08 00:24:15,850 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2025-03-08 00:24:15,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:15,850 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-03-08 00:24:15,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 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-08 00:24:15,850 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-03-08 00:24:15,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 00:24:15,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:15,851 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:15,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 00:24:16,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:16,052 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:16,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:16,052 INFO L85 PathProgramCache]: Analyzing trace with hash 765691963, now seen corresponding path program 3 times [2025-03-08 00:24:16,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:16,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360627502] [2025-03-08 00:24:16,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:24:16,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:16,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 4 equivalence classes. [2025-03-08 00:24:16,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:24:16,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:24:16,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:16,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:16,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360627502] [2025-03-08 00:24:16,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360627502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:16,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925598115] [2025-03-08 00:24:16,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:24:16,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:16,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:16,319 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:16,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:24:16,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 4 equivalence classes. [2025-03-08 00:24:16,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:24:16,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:24:16,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:16,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 00:24:16,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:16,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:24:16,571 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:16,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:16,657 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 16 treesize of output 14 [2025-03-08 00:24:16,659 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 16 treesize of output 12 [2025-03-08 00:24:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:16,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925598115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:16,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:16,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-08 00:24:16,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071205264] [2025-03-08 00:24:16,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:16,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 00:24:16,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:16,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 00:24:16,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:24:16,706 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 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-08 00:24:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:17,126 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2025-03-08 00:24:17,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 00:24:17,126 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 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 22 [2025-03-08 00:24:17,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:17,127 INFO L225 Difference]: With dead ends: 66 [2025-03-08 00:24:17,127 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 00:24:17,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=341, Invalid=1551, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 00:24:17,129 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 42 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:17,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 43 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:24:17,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 00:24:17,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2025-03-08 00:24:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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-08 00:24:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2025-03-08 00:24:17,134 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 22 [2025-03-08 00:24:17,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:17,135 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2025-03-08 00:24:17,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 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-08 00:24:17,136 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2025-03-08 00:24:17,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 00:24:17,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:17,136 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:17,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 00:24:17,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:17,337 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:17,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash -533669762, now seen corresponding path program 4 times [2025-03-08 00:24:17,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:17,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454315671] [2025-03-08 00:24:17,338 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:24:17,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:17,346 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 00:24:17,364 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:24:17,364 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:24:17,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:17,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:17,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454315671] [2025-03-08 00:24:17,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454315671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:17,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632242101] [2025-03-08 00:24:17,579 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:24:17,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:17,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:17,582 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:17,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:24:17,614 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 00:24:17,626 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:24:17,626 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:24:17,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:17,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 00:24:17,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:17,644 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 13 treesize of output 9 [2025-03-08 00:24:17,747 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:17,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:17,785 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 16 treesize of output 14 [2025-03-08 00:24:17,790 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 16 treesize of output 12 [2025-03-08 00:24:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:17,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632242101] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:17,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:17,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2025-03-08 00:24:17,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440719544] [2025-03-08 00:24:17,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:17,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 00:24:17,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:17,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 00:24:17,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:24:17,801 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 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-08 00:24:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:17,988 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2025-03-08 00:24:17,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 00:24:17,988 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 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 28 [2025-03-08 00:24:17,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:17,989 INFO L225 Difference]: With dead ends: 38 [2025-03-08 00:24:17,989 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 00:24:17,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:24:17,990 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:17,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 62 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:24:17,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 00:24:17,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2025-03-08 00:24:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.09375) internal successors, (35), 32 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-08 00:24:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2025-03-08 00:24:17,993 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 28 [2025-03-08 00:24:17,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:17,993 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2025-03-08 00:24:17,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 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-08 00:24:17,994 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2025-03-08 00:24:17,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:24:17,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:17,994 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:18,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 00:24:18,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:18,195 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:18,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:18,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1413922861, now seen corresponding path program 5 times [2025-03-08 00:24:18,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:18,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055763854] [2025-03-08 00:24:18,196 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:24:18,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:18,203 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 5 equivalence classes. [2025-03-08 00:24:18,220 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:24:18,220 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 00:24:18,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:18,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:18,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055763854] [2025-03-08 00:24:18,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055763854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:18,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669620383] [2025-03-08 00:24:18,335 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:24:18,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:18,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:18,338 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:18,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:24:18,371 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 5 equivalence classes. [2025-03-08 00:24:18,388 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:24:18,388 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 00:24:18,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:18,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:24:18,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:18,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:18,554 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:18,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669620383] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:18,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:18,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-03-08 00:24:18,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910440791] [2025-03-08 00:24:18,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:18,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:24:18,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:18,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:24:18,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:24:18,556 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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-08 00:24:18,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:18,641 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2025-03-08 00:24:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:24:18,642 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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) Word has length 31 [2025-03-08 00:24:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:18,642 INFO L225 Difference]: With dead ends: 75 [2025-03-08 00:24:18,642 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 00:24:18,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:24:18,643 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 38 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:18,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 39 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:24:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 00:24:18,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2025-03-08 00:24:18,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 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-08 00:24:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-03-08 00:24:18,650 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 31 [2025-03-08 00:24:18,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:18,650 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-03-08 00:24:18,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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-08 00:24:18,651 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-03-08 00:24:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:24:18,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:18,651 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:18,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 00:24:18,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:18,852 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:18,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:18,853 INFO L85 PathProgramCache]: Analyzing trace with hash -641932581, now seen corresponding path program 6 times [2025-03-08 00:24:18,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:18,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901714246] [2025-03-08 00:24:18,853 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:24:18,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:18,859 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 6 equivalence classes. [2025-03-08 00:24:18,883 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:24:18,883 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:24:18,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 9 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:19,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:19,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901714246] [2025-03-08 00:24:19,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901714246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:19,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689138013] [2025-03-08 00:24:19,168 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:24:19,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:19,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:19,169 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:19,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:24:19,205 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 6 equivalence classes. [2025-03-08 00:24:19,223 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:24:19,223 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:24:19,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:19,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 00:24:19,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:19,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-08 00:24:19,508 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:24:19,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 23 [2025-03-08 00:24:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 22 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:19,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:19,792 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 18 treesize of output 16 [2025-03-08 00:24:19,799 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 18 treesize of output 12 [2025-03-08 00:24:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 18 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:19,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689138013] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:19,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:19,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2025-03-08 00:24:19,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833046929] [2025-03-08 00:24:19,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:19,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 00:24:19,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:19,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 00:24:19,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2025-03-08 00:24:19,849 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 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-08 00:24:21,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-08 00:24:26,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-08 00:24:30,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 00:24:35,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-08 00:24:40,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-08 00:24:48,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-08 00:24:49,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:49,076 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2025-03-08 00:24:49,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-08 00:24:49,077 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 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-08 00:24:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:49,077 INFO L225 Difference]: With dead ends: 107 [2025-03-08 00:24:49,077 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 00:24:49,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=736, Invalid=3296, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 00:24:49,079 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 99 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 63 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:49,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 86 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 271 Invalid, 28 Unknown, 0 Unchecked, 28.5s Time] [2025-03-08 00:24:49,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 00:24:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2025-03-08 00:24:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 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-08 00:24:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2025-03-08 00:24:49,085 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 34 [2025-03-08 00:24:49,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:49,085 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2025-03-08 00:24:49,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 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-08 00:24:49,085 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2025-03-08 00:24:49,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 00:24:49,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:49,088 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:49,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 00:24:49,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 00:24:49,292 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:49,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:49,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1056333956, now seen corresponding path program 1 times [2025-03-08 00:24:49,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:49,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788472163] [2025-03-08 00:24:49,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:49,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:49,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 00:24:49,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 00:24:49,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:49,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 00:24:49,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:49,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788472163] [2025-03-08 00:24:49,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788472163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:49,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473198439] [2025-03-08 00:24:49,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:49,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:49,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:49,390 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:49,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:24:49,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 00:24:49,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 00:24:49,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:49,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:49,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:24:49,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 00:24:49,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 00:24:49,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473198439] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:49,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:49,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-08 00:24:49,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326970784] [2025-03-08 00:24:49,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:49,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:24:49,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:49,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:24:49,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:24:49,572 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 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-08 00:24:49,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:49,683 INFO L93 Difference]: Finished difference Result 137 states and 150 transitions. [2025-03-08 00:24:49,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:24:49,684 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 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 40 [2025-03-08 00:24:49,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:49,684 INFO L225 Difference]: With dead ends: 137 [2025-03-08 00:24:49,685 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 00:24:49,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:24:49,685 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 132 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:49,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 48 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:24:49,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 00:24:49,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 66. [2025-03-08 00:24:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 65 states have internal predecessors, (69), 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-08 00:24:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2025-03-08 00:24:49,692 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 40 [2025-03-08 00:24:49,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:49,692 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2025-03-08 00:24:49,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 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-08 00:24:49,692 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2025-03-08 00:24:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 00:24:49,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:49,693 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:49,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 00:24:49,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:24:49,894 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:49,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:49,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1625782908, now seen corresponding path program 2 times [2025-03-08 00:24:49,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:49,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822548105] [2025-03-08 00:24:49,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:49,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:49,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-08 00:24:49,911 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 00:24:49,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:49,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 00:24:50,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:50,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822548105] [2025-03-08 00:24:50,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822548105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:50,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234903704] [2025-03-08 00:24:50,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:50,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:50,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:50,147 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:50,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:24:50,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-08 00:24:50,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 00:24:50,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:50,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:50,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:24:50,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:50,263 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 00:24:50,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 00:24:50,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234903704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:50,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:50,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2025-03-08 00:24:50,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731791573] [2025-03-08 00:24:50,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:50,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 00:24:50,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:50,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 00:24:50,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 00:24:50,608 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 33 states, 33 states have (on average 3.121212121212121) internal successors, (103), 33 states have internal predecessors, (103), 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-08 00:24:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:50,895 INFO L93 Difference]: Finished difference Result 265 states and 286 transitions. [2025-03-08 00:24:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 00:24:50,895 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.121212121212121) internal successors, (103), 33 states have internal predecessors, (103), 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 64 [2025-03-08 00:24:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:50,896 INFO L225 Difference]: With dead ends: 265 [2025-03-08 00:24:50,896 INFO L226 Difference]: Without dead ends: 246 [2025-03-08 00:24:50,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 00:24:50,897 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 346 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:50,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 100 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:24:50,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-08 00:24:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 114. [2025-03-08 00:24:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.0353982300884956) internal successors, (117), 113 states have internal predecessors, (117), 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-08 00:24:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2025-03-08 00:24:50,915 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 64 [2025-03-08 00:24:50,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:50,915 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2025-03-08 00:24:50,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.121212121212121) internal successors, (103), 33 states have internal predecessors, (103), 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-08 00:24:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2025-03-08 00:24:50,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 00:24:50,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:50,917 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 30, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:50,924 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-08 00:24:51,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 00:24:51,119 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:51,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:51,119 INFO L85 PathProgramCache]: Analyzing trace with hash 339751036, now seen corresponding path program 3 times [2025-03-08 00:24:51,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:51,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126942322] [2025-03-08 00:24:51,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:24:51,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:51,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 112 statements into 32 equivalence classes. [2025-03-08 00:24:51,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 112 statements. [2025-03-08 00:24:51,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:24:51,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 61 proven. 30 refuted. 0 times theorem prover too weak. 1361 trivial. 0 not checked. [2025-03-08 00:24:51,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:51,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126942322] [2025-03-08 00:24:51,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126942322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:51,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896845722] [2025-03-08 00:24:51,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:24:51,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:51,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:51,163 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:51,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 00:24:51,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 112 statements into 32 equivalence classes. [2025-03-08 00:24:51,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 112 statements. [2025-03-08 00:24:51,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:24:51,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:51,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:24:51,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 61 proven. 30 refuted. 0 times theorem prover too weak. 1361 trivial. 0 not checked. [2025-03-08 00:24:51,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 61 proven. 30 refuted. 0 times theorem prover too weak. 1361 trivial. 0 not checked. [2025-03-08 00:24:51,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896845722] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:51,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:51,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:24:51,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474898180] [2025-03-08 00:24:51,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:51,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:24:51,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:51,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:24:51,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:24:51,415 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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-08 00:24:51,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:51,442 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2025-03-08 00:24:51,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:24:51,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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 112 [2025-03-08 00:24:51,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:51,443 INFO L225 Difference]: With dead ends: 114 [2025-03-08 00:24:51,443 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 00:24:51,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:24:51,443 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:51,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:24:51,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 00:24:51,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 00:24:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-08 00:24:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 00:24:51,444 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2025-03-08 00:24:51,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:51,444 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 00:24:51,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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-08 00:24:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 00:24:51,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 00:24:51,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:24:51,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 00:24:51,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 00:24:51,650 INFO L422 BasicCegarLoop]: Path program histogram: [6, 3, 2, 1] [2025-03-08 00:24:51,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 00:24:52,766 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:24:52,773 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2025-03-08 00:24:52,775 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,775 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,775 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,775 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,775 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,775 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,775 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2025-03-08 00:24:52,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-08 00:24:52,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,777 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,777 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,777 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,777 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2025-03-08 00:24:52,777 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,777 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,777 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,777 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2025-03-08 00:24:52,777 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,777 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,777 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,778 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,778 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,778 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,778 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,778 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,778 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,778 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2025-03-08 00:24:52,781 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2025-03-08 00:24:52,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-08 00:24:52,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,782 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2025-03-08 00:24:52,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2025-03-08 00:24:52,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-08 00:24:52,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-08 00:24:52,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2025-03-08 00:24:52,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2025-03-08 00:24:52,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2025-03-08 00:24:52,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2025-03-08 00:24:52,788 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,788 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,788 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,788 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,788 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,788 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,788 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 00:24:52,788 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 00:24:52,788 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-08 00:24:52,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:24:52 BoogieIcfgContainer [2025-03-08 00:24:52,789 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:24:52,789 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:24:52,790 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:24:52,790 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:24:52,790 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:24:12" (3/4) ... [2025-03-08 00:24:52,792 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 00:24:52,801 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-08 00:24:52,802 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 00:24:52,802 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 00:24:52,802 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 00:24:52,868 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:24:52,869 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:24:52,869 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:24:52,871 INFO L158 Benchmark]: Toolchain (without parser) took 40689.08ms. Allocated memory was 201.3MB in the beginning and 327.2MB in the end (delta: 125.8MB). Free memory was 158.4MB in the beginning and 244.3MB in the end (delta: -85.9MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2025-03-08 00:24:52,871 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:24:52,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.94ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 147.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:24:52,871 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.59ms. Allocated memory is still 201.3MB. Free memory was 147.0MB in the beginning and 145.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:24:52,871 INFO L158 Benchmark]: Boogie Preprocessor took 33.04ms. Allocated memory is still 201.3MB. Free memory was 145.9MB in the beginning and 144.8MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:24:52,871 INFO L158 Benchmark]: IcfgBuilder took 215.76ms. Allocated memory is still 201.3MB. Free memory was 144.8MB in the beginning and 132.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:24:52,871 INFO L158 Benchmark]: TraceAbstraction took 40168.33ms. Allocated memory was 201.3MB in the beginning and 327.2MB in the end (delta: 125.8MB). Free memory was 132.0MB in the beginning and 250.4MB in the end (delta: -118.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-08 00:24:52,872 INFO L158 Benchmark]: Witness Printer took 79.26ms. Allocated memory is still 327.2MB. Free memory was 250.4MB in the beginning and 244.3MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:24:52,874 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.94ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 147.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.59ms. Allocated memory is still 201.3MB. Free memory was 147.0MB in the beginning and 145.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.04ms. Allocated memory is still 201.3MB. Free memory was 145.9MB in the beginning and 144.8MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 215.76ms. Allocated memory is still 201.3MB. Free memory was 144.8MB in the beginning and 132.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 40168.33ms. Allocated memory was 201.3MB in the beginning and 327.2MB in the end (delta: 125.8MB). Free memory was 132.0MB in the beginning and 250.4MB in the end (delta: -118.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Witness Printer took 79.26ms. Allocated memory is still 327.2MB. Free memory was 250.4MB in the beginning and 244.3MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 19 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.0s, OverallIterations: 12, TraceHistogramMax: 31, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 31.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 28 mSolverCounterUnknown, 769 SdHoareTripleChecker+Valid, 29.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 769 mSDsluCounter, 514 SdHoareTripleChecker+Invalid, 29.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 416 mSDsCounter, 288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1514 IncrementalHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 288 mSolverCounterUnsat, 98 mSDtfsCounter, 1514 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 944 GetRequests, 667 SyntacticMatches, 22 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2260 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=11, InterpolantAutomatonStates: 192, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 235 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 785 NumberOfCodeBlocks, 599 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 1140 ConstructedInterpolants, 31 QuantifiedInterpolants, 5137 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1252 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 34 InterpolantComputations, 1 PerfectInterpolantSequences, 4694/6282 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Location Invariant Derived location invariant: (((((((2 == i) && (SIZE <= 99999)) && (MAX <= 100000)) || ((((1 <= i) && (SIZE <= 99999)) && (((i >= 0) ? (i / 65536) : ((i / 65536) - 1)) <= 250)) && (MAX <= 100000))) || ((((2 <= SIZE) && (i == 1)) && (SIZE <= 99999)) && (MAX <= 100000))) || (((3 == i) && (SIZE <= 99999)) && (MAX <= 100000))) || ((((i == 0) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000))) - InvariantResult [Line: 37]: Location Invariant Derived location invariant: (((((((i == 0) || ((1 <= i) && (SIZE <= ((long long) 2 + i)))) || (1 <= i)) || ((SIZE <= 2) && (i == 1))) || ((SIZE <= 2) && (i == 0))) || ((SIZE <= 2) && (2 == i))) || ((i == 0) && (SIZE <= 3))) RESULT: Ultimate proved your program to be correct! [2025-03-08 00:24:52,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE