./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/rewrev.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/rewrev.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 40cb4a1cdff0a4e27345697e0d771f8cc035da7ed4f2bd40d71a1d68f6e99f3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:17:09,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:17:09,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:17:09,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:17:09,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:17:09,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:17:09,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:17:09,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:17:09,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:17:09,454 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:17:09,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:17:09,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:17:09,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:17:09,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:17:09,456 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:17:09,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:17:09,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:17:09,456 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:17:09,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:17:09,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:17:09,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:17:09,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:17:09,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:17:09,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:17:09,457 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:17:09,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:17:09,457 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:17:09,457 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:17:09,457 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:17:09,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:17:09,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:17:09,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:17:09,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:17:09,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:17:09,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:17:09,458 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:17:09,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:17:09,458 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:17:09,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:17:09,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:17:09,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:17:09,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:17:09,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:17:09,458 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 -> 40cb4a1cdff0a4e27345697e0d771f8cc035da7ed4f2bd40d71a1d68f6e99f3f [2025-03-03 09:17:09,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:17:09,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:17:09,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:17:09,710 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:17:09,711 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:17:09,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/rewrev.c [2025-03-03 09:17:10,842 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f54bc2902/6237496b1a5c4f3285b869e79f133f00/FLAGa102da24b [2025-03-03 09:17:11,050 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:17:11,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/rewrev.c [2025-03-03 09:17:11,057 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f54bc2902/6237496b1a5c4f3285b869e79f133f00/FLAGa102da24b [2025-03-03 09:17:11,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f54bc2902/6237496b1a5c4f3285b869e79f133f00 [2025-03-03 09:17:11,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:17:11,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:17:11,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:17:11,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:17:11,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:17:11,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:17:11" (1/1) ... [2025-03-03 09:17:11,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@366d24cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:17:11, skipping insertion in model container [2025-03-03 09:17:11,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:17:11" (1/1) ... [2025-03-03 09:17:11,433 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:17:11,516 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/rewrev.c[397,410] [2025-03-03 09:17:11,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:17:11,532 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:17:11,538 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/rewrev.c[397,410] [2025-03-03 09:17:11,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:17:11,552 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:17:11,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:17:11 WrapperNode [2025-03-03 09:17:11,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:17:11,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:17:11,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:17:11,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:17:11,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:17:11" (1/1) ... [2025-03-03 09:17:11,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:17:11" (1/1) ... [2025-03-03 09:17:11,573 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2025-03-03 09:17:11,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:17:11,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:17:11,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:17:11,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:17:11,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:17:11" (1/1) ... [2025-03-03 09:17:11,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:17:11" (1/1) ... [2025-03-03 09:17:11,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:17:11" (1/1) ... [2025-03-03 09:17:11,586 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-03 09:17:11,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:17:11" (1/1) ... [2025-03-03 09:17:11,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:17:11" (1/1) ... [2025-03-03 09:17:11,589 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:17:11" (1/1) ... [2025-03-03 09:17:11,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:17:11" (1/1) ... [2025-03-03 09:17:11,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:17:11" (1/1) ... [2025-03-03 09:17:11,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:17:11" (1/1) ... [2025-03-03 09:17:11,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:17:11,592 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:17:11,592 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:17:11,592 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:17:11,593 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:17:11" (1/1) ... [2025-03-03 09:17:11,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:17:11,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:11,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:17:11,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:17:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:17:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:17:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:17:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:17:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:17:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 09:17:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:17:11,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:17:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:17:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:17:11,683 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:17:11,684 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:17:11,780 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-03 09:17:11,780 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:17:11,787 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:17:11,787 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:17:11,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:17:11 BoogieIcfgContainer [2025-03-03 09:17:11,788 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:17:11,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:17:11,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:17:11,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:17:11,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:17:11" (1/3) ... [2025-03-03 09:17:11,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7948d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:17:11, skipping insertion in model container [2025-03-03 09:17:11,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:17:11" (2/3) ... [2025-03-03 09:17:11,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7948d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:17:11, skipping insertion in model container [2025-03-03 09:17:11,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:17:11" (3/3) ... [2025-03-03 09:17:11,796 INFO L128 eAbstractionObserver]: Analyzing ICFG rewrev.c [2025-03-03 09:17:11,807 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:17:11,808 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rewrev.c that has 1 procedures, 15 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 09:17:11,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:17:11,859 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;@2d9093e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:17:11,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:17:11,862 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-03 09:17:11,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-03 09:17:11,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:11,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:11,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:11,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:11,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1038862573, now seen corresponding path program 1 times [2025-03-03 09:17:11,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:11,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286342450] [2025-03-03 09:17:11,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:17:11,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:11,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-03 09:17:11,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-03 09:17:11,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:17:11,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:12,029 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-03 09:17:12,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:12,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286342450] [2025-03-03 09:17:12,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286342450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:17:12,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:17:12,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:17:12,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222686086] [2025-03-03 09:17:12,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:17:12,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:17:12,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:12,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:17:12,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:17:12,045 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-03 09:17:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:12,074 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2025-03-03 09:17:12,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:17:12,075 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-03 09:17:12,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:12,079 INFO L225 Difference]: With dead ends: 30 [2025-03-03 09:17:12,080 INFO L226 Difference]: Without dead ends: 14 [2025-03-03 09:17:12,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:17:12,085 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:12,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:17:12,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-03 09:17:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-03 09:17:12,101 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-03 09:17:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-03-03 09:17:12,104 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2025-03-03 09:17:12,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:12,104 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-03-03 09:17:12,104 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-03 09:17:12,104 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-03-03 09:17:12,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 09:17:12,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:12,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:12,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:17:12,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:12,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:12,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1434665732, now seen corresponding path program 1 times [2025-03-03 09:17:12,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:12,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586738477] [2025-03-03 09:17:12,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:17:12,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:12,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 09:17:12,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 09:17:12,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:17:12,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:12,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:12,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586738477] [2025-03-03 09:17:12,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586738477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:17:12,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:17:12,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:17:12,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015731369] [2025-03-03 09:17:12,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:17:12,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:17:12,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:12,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:17:12,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:17:12,207 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:12,235 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2025-03-03 09:17:12,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:17:12,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 09:17:12,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:12,237 INFO L225 Difference]: With dead ends: 20 [2025-03-03 09:17:12,237 INFO L226 Difference]: Without dead ends: 15 [2025-03-03 09:17:12,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:17:12,238 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:12,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:17:12,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-03 09:17:12,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-03 09:17:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-03 09:17:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-03-03 09:17:12,240 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2025-03-03 09:17:12,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:12,240 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-03-03 09:17:12,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2025-03-03 09:17:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 09:17:12,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:12,241 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:12,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:17:12,241 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:12,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:12,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1533873364, now seen corresponding path program 1 times [2025-03-03 09:17:12,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:12,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870446338] [2025-03-03 09:17:12,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:17:12,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:12,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 09:17:12,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 09:17:12,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:17:12,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:12,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:12,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870446338] [2025-03-03 09:17:12,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870446338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:17:12,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999425190] [2025-03-03 09:17:12,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:17:12,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:12,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:12,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:17:12,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:17:12,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 09:17:12,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 09:17:12,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:17:12,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:12,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 09:17:12,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:17:12,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:17:12,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:17:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:17:12,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:17:13,026 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 17 treesize of output 15 [2025-03-03 09:17:13,030 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 26 treesize of output 24 [2025-03-03 09:17:13,112 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-03 09:17:13,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999425190] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:17:13,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:17:13,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2025-03-03 09:17:13,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483790596] [2025-03-03 09:17:13,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:17:13,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 09:17:13,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:13,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 09:17:13,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:17:13,115 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 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-03 09:17:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:13,272 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2025-03-03 09:17:13,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:17:13,273 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 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) Word has length 13 [2025-03-03 09:17:13,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:13,274 INFO L225 Difference]: With dead ends: 22 [2025-03-03 09:17:13,274 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 09:17:13,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2025-03-03 09:17:13,275 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 54 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:13,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 30 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:17:13,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 09:17:13,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2025-03-03 09:17:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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-03 09:17:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-03-03 09:17:13,279 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2025-03-03 09:17:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:13,279 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-03-03 09:17:13,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 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-03 09:17:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-03-03 09:17:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 09:17:13,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:13,279 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:13,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:17:13,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:13,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:13,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:13,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1463451969, now seen corresponding path program 1 times [2025-03-03 09:17:13,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:13,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172815109] [2025-03-03 09:17:13,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:17:13,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:13,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 09:17:13,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:17:13,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:17:13,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:13,751 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-03 09:17:13,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:13,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172815109] [2025-03-03 09:17:13,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172815109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:17:13,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587323672] [2025-03-03 09:17:13,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:17:13,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:13,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:13,754 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:17:13,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:17:13,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 09:17:13,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:17:13,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:17:13,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:13,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 09:17:13,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:17:13,848 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 23 treesize of output 1 [2025-03-03 09:17:13,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:17:13,982 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 35 treesize of output 15 [2025-03-03 09:17:14,262 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:17:14,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:17:14,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:17:14,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 13 [2025-03-03 09:17:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:14,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:17:14,505 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 19 treesize of output 17 [2025-03-03 09:17:14,508 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 24 treesize of output 20 [2025-03-03 09:17:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:14,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587323672] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:17:14,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:17:14,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 28 [2025-03-03 09:17:14,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317559378] [2025-03-03 09:17:14,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:17:14,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 09:17:14,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:14,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 09:17:14,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2025-03-03 09:17:14,559 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 28 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 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-03 09:17:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:15,149 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2025-03-03 09:17:15,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:17:15,150 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 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-03 09:17:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:15,150 INFO L225 Difference]: With dead ends: 25 [2025-03-03 09:17:15,150 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 09:17:15,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=344, Invalid=1138, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 09:17:15,151 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 52 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:15,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 29 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:17:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 09:17:15,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2025-03-03 09:17:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-03-03 09:17:15,158 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2025-03-03 09:17:15,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:15,158 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-03-03 09:17:15,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 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-03 09:17:15,158 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-03-03 09:17:15,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 09:17:15,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:15,159 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:15,165 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-03 09:17:15,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 09:17:15,364 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:15,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:15,365 INFO L85 PathProgramCache]: Analyzing trace with hash 516286028, now seen corresponding path program 2 times [2025-03-03 09:17:15,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:15,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598204246] [2025-03-03 09:17:15,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:17:15,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:15,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-03 09:17:15,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:17:15,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:17:15,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:15,449 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-03 09:17:15,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:15,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598204246] [2025-03-03 09:17:15,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598204246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:17:15,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45192124] [2025-03-03 09:17:15,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:17:15,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:15,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:15,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:17:15,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:17:15,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-03 09:17:15,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:17:15,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:17:15,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:15,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:17:15,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:17:15,546 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-03 09:17:15,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:17:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:15,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45192124] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:17:15,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:17:15,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-03 09:17:15,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999097729] [2025-03-03 09:17:15,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:17:15,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:17:15,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:15,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:17:15,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:17:15,594 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:15,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:15,662 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2025-03-03 09:17:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:17:15,663 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-03 09:17:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:15,663 INFO L225 Difference]: With dead ends: 41 [2025-03-03 09:17:15,664 INFO L226 Difference]: Without dead ends: 24 [2025-03-03 09:17:15,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:17:15,665 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:15,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 29 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:17:15,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-03 09:17:15,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-03-03 09:17:15,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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-03 09:17:15,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-03-03 09:17:15,673 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 19 [2025-03-03 09:17:15,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:15,673 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-03-03 09:17:15,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:15,674 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-03-03 09:17:15,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 09:17:15,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:15,674 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:15,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 09:17:15,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:15,877 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:15,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:15,878 INFO L85 PathProgramCache]: Analyzing trace with hash 255212507, now seen corresponding path program 3 times [2025-03-03 09:17:15,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:15,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585904655] [2025-03-03 09:17:15,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:17:15,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:15,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 4 equivalence classes. [2025-03-03 09:17:15,911 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:17:15,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:17:15,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:16,312 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-03 09:17:16,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:16,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585904655] [2025-03-03 09:17:16,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585904655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:17:16,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891742167] [2025-03-03 09:17:16,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:17:16,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:16,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:16,315 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:17:16,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:17:16,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 4 equivalence classes. [2025-03-03 09:17:16,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:17:16,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:17:16,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:16,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 09:17:16,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:17:16,379 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 16 treesize of output 12 [2025-03-03 09:17:16,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 16 [2025-03-03 09:17:16,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 16 [2025-03-03 09:17:16,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-03 09:17:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:16,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:17:16,825 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:16,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891742167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:17:16,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:17:16,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2025-03-03 09:17:16,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822369314] [2025-03-03 09:17:16,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:17:16,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 09:17:16,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:16,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 09:17:16,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:17:16,827 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 30 states have internal predecessors, (59), 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-03 09:17:17,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:17,706 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2025-03-03 09:17:17,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-03 09:17:17,706 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 30 states have internal predecessors, (59), 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-03 09:17:17,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:17,706 INFO L225 Difference]: With dead ends: 52 [2025-03-03 09:17:17,706 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 09:17:17,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=684, Invalid=2976, Unknown=0, NotChecked=0, Total=3660 [2025-03-03 09:17:17,708 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 97 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:17,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 56 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:17:17,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 09:17:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2025-03-03 09:17:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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-03 09:17:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-03-03 09:17:17,718 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2025-03-03 09:17:17,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:17,718 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-03-03 09:17:17,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 30 states have internal predecessors, (59), 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-03 09:17:17,718 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-03-03 09:17:17,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 09:17:17,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:17,719 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:17,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:17:17,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:17,919 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:17,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash 319058431, now seen corresponding path program 4 times [2025-03-03 09:17:17,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:17,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422395435] [2025-03-03 09:17:17,920 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:17:17,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:17,925 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-03 09:17:17,932 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-03-03 09:17:17,932 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:17:17,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:18,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:18,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422395435] [2025-03-03 09:17:18,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422395435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:17:18,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096493091] [2025-03-03 09:17:18,456 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:17:18,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:18,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:18,458 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:17:18,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:17:18,488 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-03 09:17:18,496 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-03-03 09:17:18,497 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:17:18,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:18,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-03 09:17:18,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:17:18,504 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 25 treesize of output 1 [2025-03-03 09:17:18,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 16 [2025-03-03 09:17:18,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 47 treesize of output 25 [2025-03-03 09:17:18,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:17:18,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 28 [2025-03-03 09:17:18,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:17:18,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 28 [2025-03-03 09:17:18,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:17:18,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2025-03-03 09:17:18,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:17:18,796 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 34 treesize of output 10 [2025-03-03 09:17:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:18,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:17:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:19,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096493091] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:17:19,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:17:19,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 37 [2025-03-03 09:17:19,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106441539] [2025-03-03 09:17:19,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:17:19,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 09:17:19,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:19,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 09:17:19,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1165, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 09:17:19,099 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 37 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:39,869 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-03 09:17:43,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 09:17:48,327 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-03 09:17:52,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 09:17:56,462 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-03 09:18:00,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 09:18:04,983 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse2 (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (and (or (< 0 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse0 (+ .cse1 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) |c_ULTIMATE.start_main_~val2~0#1|)) (= .cse2 (select .cse0 .cse3)) (forall ((v_ArrVal_137 Int)) (let ((.cse4 (store .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_137))) (< (select .cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ (select .cse4 .cse3) 1)))) (= .cse2 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)))) is different from false [2025-03-03 09:18:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:18:05,002 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2025-03-03 09:18:05,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 09:18:05,003 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-03 09:18:05,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:18:05,003 INFO L225 Difference]: With dead ends: 52 [2025-03-03 09:18:05,003 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 09:18:05,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=598, Invalid=3186, Unknown=2, NotChecked=120, Total=3906 [2025-03-03 09:18:05,005 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 20 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:18:05,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 68 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 531 Invalid, 6 Unknown, 36 Unchecked, 25.0s Time] [2025-03-03 09:18:05,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 09:18:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2025-03-03 09:18:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:18:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-03-03 09:18:05,011 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2025-03-03 09:18:05,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:18:05,011 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-03-03 09:18:05,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:18:05,011 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-03-03 09:18:05,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:18:05,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:18:05,012 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:18:05,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:18:05,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:18:05,213 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:18:05,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:18:05,213 INFO L85 PathProgramCache]: Analyzing trace with hash 307964684, now seen corresponding path program 5 times [2025-03-03 09:18:05,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:18:05,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603106070] [2025-03-03 09:18:05,213 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:18:05,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:18:05,220 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 5 equivalence classes. [2025-03-03 09:18:05,229 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:18:05,229 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:18:05,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:05,372 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-03 09:18:05,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:18:05,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603106070] [2025-03-03 09:18:05,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603106070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:18:05,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236335853] [2025-03-03 09:18:05,372 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:18:05,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:18:05,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:18:05,375 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:18:05,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:18:05,415 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 5 equivalence classes. [2025-03-03 09:18:05,447 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:18:05,447 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:18:05,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:05,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 09:18:05,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:18:05,615 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-03 09:18:05,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:18:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:05,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236335853] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:18:05,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:18:05,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 18 [2025-03-03 09:18:05,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027421408] [2025-03-03 09:18:05,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:18:05,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:18:05,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:18:05,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:18:05,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=175, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:18:05,759 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 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-03 09:18:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:18:05,915 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2025-03-03 09:18:05,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 09:18:05,915 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 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-03 09:18:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:18:05,916 INFO L225 Difference]: With dead ends: 67 [2025-03-03 09:18:05,916 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 09:18:05,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:18:05,917 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:18:05,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 37 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:18:05,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 09:18:05,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2025-03-03 09:18:05,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:18:05,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2025-03-03 09:18:05,922 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 31 [2025-03-03 09:18:05,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:18:05,922 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2025-03-03 09:18:05,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 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-03 09:18:05,923 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2025-03-03 09:18:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 09:18:05,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:18:05,923 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:18:05,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 09:18:06,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:18:06,124 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:18:06,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:18:06,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1759206885, now seen corresponding path program 6 times [2025-03-03 09:18:06,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:18:06,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950748409] [2025-03-03 09:18:06,124 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:18:06,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:18:06,131 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 6 equivalence classes. [2025-03-03 09:18:06,148 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 09:18:06,149 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-03 09:18:06,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:06,959 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-03 09:18:06,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:18:06,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950748409] [2025-03-03 09:18:06,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950748409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:18:06,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485143872] [2025-03-03 09:18:06,959 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:18:06,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:18:06,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:18:06,961 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:18:06,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:18:06,994 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 6 equivalence classes. [2025-03-03 09:18:07,018 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 09:18:07,018 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-03 09:18:07,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:07,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-03 09:18:07,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:18:07,064 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-03 09:18:07,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:07,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:07,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:07,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:07,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:07,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:07,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:18:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:07,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:18:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 7 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:08,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485143872] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:18:08,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:18:08,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 42 [2025-03-03 09:18:08,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233221463] [2025-03-03 09:18:08,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:18:08,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-03 09:18:08,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:18:08,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-03 09:18:08,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1502, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 09:18:08,412 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 42 states, 42 states have (on average 2.261904761904762) internal successors, (95), 42 states have internal predecessors, (95), 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-03 09:18:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:18:11,048 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2025-03-03 09:18:11,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-03 09:18:11,048 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.261904761904762) internal successors, (95), 42 states have internal predecessors, (95), 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-03 09:18:11,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:18:11,049 INFO L225 Difference]: With dead ends: 70 [2025-03-03 09:18:11,049 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 09:18:11,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1063, Invalid=5417, Unknown=0, NotChecked=0, Total=6480 [2025-03-03 09:18:11,051 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 122 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:18:11,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 100 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 09:18:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 09:18:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2025-03-03 09:18:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 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-03 09:18:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2025-03-03 09:18:11,057 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2025-03-03 09:18:11,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:18:11,057 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-03-03 09:18:11,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.261904761904762) internal successors, (95), 42 states have internal predecessors, (95), 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-03 09:18:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2025-03-03 09:18:11,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 09:18:11,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:18:11,058 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:18:11,064 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-03 09:18:11,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:18:11,258 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:18:11,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:18:11,259 INFO L85 PathProgramCache]: Analyzing trace with hash -651467457, now seen corresponding path program 7 times [2025-03-03 09:18:11,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:18:11,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305658610] [2025-03-03 09:18:11,259 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:18:11,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:18:11,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 09:18:11,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:18:11,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:18:11,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:12,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:18:12,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305658610] [2025-03-03 09:18:12,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305658610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:18:12,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531939041] [2025-03-03 09:18:12,038 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:18:12,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:18:12,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:18:12,040 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:18:12,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:18:12,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 09:18:12,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:18:12,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:18:12,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:12,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-03 09:18:12,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:18:12,159 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-03 09:18:12,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:12,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:12,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:12,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:12,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:12,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:12,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:12,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 27 treesize of output 26 [2025-03-03 09:18:12,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-03 09:18:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:13,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:18:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 9 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:14,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531939041] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:18:14,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:18:14,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 19] total 48 [2025-03-03 09:18:14,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895531545] [2025-03-03 09:18:14,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:18:14,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-03 09:18:14,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:18:14,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-03 09:18:14,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1967, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 09:18:14,069 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 48 states, 48 states have (on average 2.3541666666666665) internal successors, (113), 48 states have internal predecessors, (113), 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-03 09:18:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:18:16,266 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2025-03-03 09:18:16,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 09:18:16,266 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.3541666666666665) internal successors, (113), 48 states have internal predecessors, (113), 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-03 09:18:16,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:18:16,267 INFO L225 Difference]: With dead ends: 65 [2025-03-03 09:18:16,267 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 09:18:16,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1011, Invalid=4539, Unknown=0, NotChecked=0, Total=5550 [2025-03-03 09:18:16,268 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 183 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:18:16,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 115 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:18:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 09:18:16,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2025-03-03 09:18:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:18:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-03-03 09:18:16,276 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 40 [2025-03-03 09:18:16,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:18:16,276 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-03-03 09:18:16,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.3541666666666665) internal successors, (113), 48 states have internal predecessors, (113), 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-03 09:18:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-03-03 09:18:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 09:18:16,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:18:16,276 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:18:16,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 09:18:16,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 09:18:16,477 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:18:16,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:18:16,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1091071948, now seen corresponding path program 8 times [2025-03-03 09:18:16,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:18:16,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223335329] [2025-03-03 09:18:16,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:18:16,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:18:16,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-03 09:18:16,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:18:16,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:18:16,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:16,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:18:16,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223335329] [2025-03-03 09:18:16,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223335329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:18:16,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410950103] [2025-03-03 09:18:16,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:18:16,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:18:16,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:18:16,699 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:18:16,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:18:16,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-03 09:18:16,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:18:16,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:18:16,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:16,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 09:18:16,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:18:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 57 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:17,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:18:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 68 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:17,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410950103] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:18:17,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:18:17,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 25 [2025-03-03 09:18:17,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599420557] [2025-03-03 09:18:17,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:18:17,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 09:18:17,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:18:17,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 09:18:17,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=356, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:18:17,364 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 25 states, 25 states have (on average 3.4) internal successors, (85), 25 states have internal predecessors, (85), 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-03 09:18:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:18:17,647 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2025-03-03 09:18:17,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 09:18:17,648 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.4) internal successors, (85), 25 states have internal predecessors, (85), 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 43 [2025-03-03 09:18:17,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:18:17,648 INFO L225 Difference]: With dead ends: 85 [2025-03-03 09:18:17,648 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 09:18:17,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=420, Unknown=0, NotChecked=0, Total=702 [2025-03-03 09:18:17,649 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:18:17,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 65 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:18:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 09:18:17,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2025-03-03 09:18:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 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-03 09:18:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2025-03-03 09:18:17,655 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 43 [2025-03-03 09:18:17,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:18:17,656 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2025-03-03 09:18:17,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.4) internal successors, (85), 25 states have internal predecessors, (85), 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-03 09:18:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2025-03-03 09:18:17,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 09:18:17,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:18:17,656 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:18:17,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 09:18:17,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:18:17,857 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:18:17,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:18:17,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1039873957, now seen corresponding path program 9 times [2025-03-03 09:18:17,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:18:17,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588394865] [2025-03-03 09:18:17,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:18:17,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:18:17,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 8 equivalence classes. [2025-03-03 09:18:17,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 09:18:17,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-03 09:18:17,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 30 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:18,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:18:18,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588394865] [2025-03-03 09:18:18,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588394865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:18:18,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121604874] [2025-03-03 09:18:18,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:18:18,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:18:18,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:18:18,959 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:18:18,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:18:19,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 8 equivalence classes. [2025-03-03 09:18:19,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 09:18:19,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-03 09:18:19,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:19,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-03 09:18:19,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:18:19,132 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-03 09:18:19,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:19,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:19,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:19,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:19,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:19,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:19,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:19,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:19,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:19,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:19,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:18:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 18 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:20,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:18:21,051 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 11 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:21,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121604874] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:18:21,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:18:21,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 20] total 50 [2025-03-03 09:18:21,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101004589] [2025-03-03 09:18:21,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:18:21,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-03 09:18:21,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:18:21,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-03 09:18:21,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=2166, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 09:18:21,053 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 50 states, 50 states have (on average 2.62) internal successors, (131), 50 states have internal predecessors, (131), 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-03 09:18:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:18:24,478 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2025-03-03 09:18:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-03 09:18:24,479 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.62) internal successors, (131), 50 states have internal predecessors, (131), 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 46 [2025-03-03 09:18:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:18:24,479 INFO L225 Difference]: With dead ends: 88 [2025-03-03 09:18:24,479 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 09:18:24,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2223 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1399, Invalid=7721, Unknown=0, NotChecked=0, Total=9120 [2025-03-03 09:18:24,481 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 215 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:18:24,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 179 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 09:18:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 09:18:24,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2025-03-03 09:18:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 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-03 09:18:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2025-03-03 09:18:24,493 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 46 [2025-03-03 09:18:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:18:24,493 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2025-03-03 09:18:24,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.62) internal successors, (131), 50 states have internal predecessors, (131), 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-03 09:18:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2025-03-03 09:18:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 09:18:24,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:18:24,493 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:18:24,501 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-03 09:18:24,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 09:18:24,694 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:18:24,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:18:24,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1349363585, now seen corresponding path program 10 times [2025-03-03 09:18:24,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:18:24,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3619659] [2025-03-03 09:18:24,695 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:18:24,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:18:24,702 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-03 09:18:24,713 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 49 of 52 statements. [2025-03-03 09:18:24,713 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:18:24,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:25,951 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 30 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:25,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:18:25,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3619659] [2025-03-03 09:18:25,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3619659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:18:25,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224177415] [2025-03-03 09:18:25,951 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:18:25,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:18:25,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:18:25,953 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:18:25,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:18:26,001 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-03 09:18:26,016 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 49 of 52 statements. [2025-03-03 09:18:26,016 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:18:26,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:26,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-03 09:18:26,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:18:26,027 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 25 treesize of output 1 [2025-03-03 09:18:26,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 16 [2025-03-03 09:18:26,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 16 [2025-03-03 09:18:26,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 16 [2025-03-03 09:18:26,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 16 [2025-03-03 09:18:26,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 16 [2025-03-03 09:18:26,210 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 38 treesize of output 16 [2025-03-03 09:18:26,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:18:26,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 31 [2025-03-03 09:18:26,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:18:26,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2025-03-03 09:18:26,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:18:26,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 31 [2025-03-03 09:18:26,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:18:26,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2025-03-03 09:18:26,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:18:26,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 31 [2025-03-03 09:18:26,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:18:26,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2025-03-03 09:18:26,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:18:26,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 33 [2025-03-03 09:18:27,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:18:27,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 13 [2025-03-03 09:18:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 22 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:27,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:18:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 30 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:28,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224177415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:18:28,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:18:28,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 55 [2025-03-03 09:18:28,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136524093] [2025-03-03 09:18:28,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:18:28,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-03 09:18:28,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:18:28,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-03 09:18:28,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2624, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 09:18:28,291 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 55 states, 55 states have (on average 2.2363636363636363) internal successors, (123), 55 states have internal predecessors, (123), 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-03 09:18:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:18:31,147 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2025-03-03 09:18:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-03 09:18:31,148 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.2363636363636363) internal successors, (123), 55 states have internal predecessors, (123), 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 52 [2025-03-03 09:18:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:18:31,148 INFO L225 Difference]: With dead ends: 91 [2025-03-03 09:18:31,148 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 09:18:31,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 73 SyntacticMatches, 11 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2497 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1337, Invalid=7219, Unknown=0, NotChecked=0, Total=8556 [2025-03-03 09:18:31,150 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 181 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:18:31,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 216 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 09:18:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 09:18:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2025-03-03 09:18:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 states have internal predecessors, (63), 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-03 09:18:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2025-03-03 09:18:31,160 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 52 [2025-03-03 09:18:31,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:18:31,161 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2025-03-03 09:18:31,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.2363636363636363) internal successors, (123), 55 states have internal predecessors, (123), 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-03 09:18:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2025-03-03 09:18:31,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 09:18:31,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:18:31,161 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:18:31,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 09:18:31,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:18:31,362 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:18:31,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:18:31,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2004202636, now seen corresponding path program 11 times [2025-03-03 09:18:31,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:18:31,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405578283] [2025-03-03 09:18:31,362 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:18:31,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:18:31,370 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 9 equivalence classes. [2025-03-03 09:18:31,385 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:18:31,385 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-03 09:18:31,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:31,599 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 100 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:31,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:18:31,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405578283] [2025-03-03 09:18:31,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405578283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:18:31,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660937745] [2025-03-03 09:18:31,599 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:18:31,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:18:31,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:18:31,601 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:18:31,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:18:31,651 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 9 equivalence classes. [2025-03-03 09:18:31,789 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:18:31,789 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-03 09:18:31,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:31,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 09:18:31,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:18:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 100 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:32,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:18:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 115 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:32,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660937745] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:18:32,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:18:32,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 20] total 30 [2025-03-03 09:18:32,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568831912] [2025-03-03 09:18:32,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:18:32,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 09:18:32,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:18:32,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 09:18:32,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=509, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:18:32,379 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 30 states, 30 states have (on average 3.5) internal successors, (105), 30 states have internal predecessors, (105), 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-03 09:18:32,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:18:32,697 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2025-03-03 09:18:32,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 09:18:32,698 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.5) internal successors, (105), 30 states have internal predecessors, (105), 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 55 [2025-03-03 09:18:32,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:18:32,698 INFO L225 Difference]: With dead ends: 103 [2025-03-03 09:18:32,698 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 09:18:32,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 91 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=405, Invalid=587, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:18:32,703 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:18:32,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 92 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:18:32,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 09:18:32,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2025-03-03 09:18:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 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-03 09:18:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2025-03-03 09:18:32,712 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2025-03-03 09:18:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:18:32,713 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2025-03-03 09:18:32,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.5) internal successors, (105), 30 states have internal predecessors, (105), 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-03 09:18:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2025-03-03 09:18:32,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 09:18:32,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:18:32,713 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:18:32,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-03 09:18:32,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 09:18:32,914 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:18:32,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:18:32,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1545687397, now seen corresponding path program 12 times [2025-03-03 09:18:32,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:18:32,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172063965] [2025-03-03 09:18:32,915 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:18:32,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:18:32,922 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 58 statements into 10 equivalence classes. [2025-03-03 09:18:32,944 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 09:18:32,945 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-03 09:18:32,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 63 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:34,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:18:34,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172063965] [2025-03-03 09:18:34,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172063965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:18:34,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059812214] [2025-03-03 09:18:34,237 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:18:34,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:18:34,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:18:34,239 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:18:34,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:18:34,296 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 58 statements into 10 equivalence classes. [2025-03-03 09:18:34,569 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 09:18:34,569 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-03 09:18:34,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:34,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-03-03 09:18:34,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:18:34,619 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-03 09:18:34,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:34,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:34,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:34,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:34,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:34,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:34,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:34,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:34,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:34,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:34,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:35,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:35,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:35,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:35,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:18:36,014 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 24 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:36,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:18:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 15 proven. 202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:37,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059812214] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:18:37,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:18:37,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 25] total 68 [2025-03-03 09:18:37,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839620279] [2025-03-03 09:18:37,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:18:37,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-03 09:18:37,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:18:37,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-03 09:18:37,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=4069, Unknown=0, NotChecked=0, Total=4556 [2025-03-03 09:18:37,209 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 68 states, 68 states have (on average 2.4558823529411766) internal successors, (167), 68 states have internal predecessors, (167), 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-03 09:18:41,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:18:41,638 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2025-03-03 09:18:41,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-03 09:18:41,638 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.4558823529411766) internal successors, (167), 68 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 09:18:41,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:18:41,639 INFO L225 Difference]: With dead ends: 106 [2025-03-03 09:18:41,639 INFO L226 Difference]: Without dead ends: 74 [2025-03-03 09:18:41,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4302 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2142, Invalid=13110, Unknown=0, NotChecked=0, Total=15252 [2025-03-03 09:18:41,640 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 181 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:18:41,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 252 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 09:18:41,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-03 09:18:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2025-03-03 09:18:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 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-03 09:18:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2025-03-03 09:18:41,652 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 58 [2025-03-03 09:18:41,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:18:41,652 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2025-03-03 09:18:41,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.4558823529411766) internal successors, (167), 68 states have internal predecessors, (167), 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-03 09:18:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2025-03-03 09:18:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 09:18:41,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:18:41,652 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:18:41,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 09:18:41,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:18:41,853 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:18:41,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:18:41,853 INFO L85 PathProgramCache]: Analyzing trace with hash -460239937, now seen corresponding path program 13 times [2025-03-03 09:18:41,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:18:41,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370784931] [2025-03-03 09:18:41,853 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:18:41,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:18:41,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 09:18:41,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 09:18:41,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:18:41,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:42,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:18:42,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370784931] [2025-03-03 09:18:42,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370784931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:18:42,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805246793] [2025-03-03 09:18:42,899 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:18:42,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:18:42,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:18:42,900 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:18:42,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 09:18:42,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 09:18:42,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 09:18:42,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:18:42,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:18:42,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-03 09:18:42,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:18:43,057 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 23 treesize of output 1 [2025-03-03 09:18:43,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:43,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:43,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:43,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:43,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:43,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:43,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:43,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:43,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:43,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:43,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:43,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:43,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:43,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:43,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2025-03-03 09:18:43,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 15 [2025-03-03 09:18:43,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:18:44,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:18:44,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-03-03 09:18:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 27 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:44,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:18:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 17 proven. 254 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:18:46,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805246793] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:18:46,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:18:46,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 27, 27] total 68 [2025-03-03 09:18:46,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482672269] [2025-03-03 09:18:46,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:18:46,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-03 09:18:46,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:18:46,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-03 09:18:46,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=4098, Unknown=0, NotChecked=0, Total=4556 [2025-03-03 09:18:46,362 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 68 states, 68 states have (on average 2.7205882352941178) internal successors, (185), 68 states have internal predecessors, (185), 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)