./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/cart.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/cart.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:15:21,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:15:21,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:15:21,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:15:21,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:15:21,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:15:21,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:15:21,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:15:21,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:15:21,432 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:15:21,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:15:21,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:15:21,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:15:21,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:15:21,433 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:15:21,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:15:21,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:15:21,433 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:15:21,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:15:21,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:15:21,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:15:21,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:15:21,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:15:21,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:15:21,434 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:15:21,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:15:21,434 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:15:21,434 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:15:21,434 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:15:21,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:15:21,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:15:21,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:15:21,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:15:21,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:15:21,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:15:21,435 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:15:21,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:15:21,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:15:21,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:15:21,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:15:21,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:15:21,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:15:21,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:15:21,435 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 -> 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af [2025-03-03 13:15:21,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:15:21,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:15:21,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:15:21,701 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:15:21,702 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:15:21,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2025-03-03 13:15:22,836 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9150f85c7/71f82689d7684044a98fdeb3a63bd06a/FLAG9411d2526 [2025-03-03 13:15:23,107 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:15:23,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2025-03-03 13:15:23,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9150f85c7/71f82689d7684044a98fdeb3a63bd06a/FLAG9411d2526 [2025-03-03 13:15:23,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9150f85c7/71f82689d7684044a98fdeb3a63bd06a [2025-03-03 13:15:23,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:15:23,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:15:23,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:15:23,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:15:23,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:15:23,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:15:23" (1/1) ... [2025-03-03 13:15:23,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@242ba109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:23, skipping insertion in model container [2025-03-03 13:15:23,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:15:23" (1/1) ... [2025-03-03 13:15:23,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:15:23,608 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/heap-data/cart.i[23713,23726] [2025-03-03 13:15:23,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:15:23,620 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:15:23,645 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/heap-data/cart.i[23713,23726] [2025-03-03 13:15:23,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:15:23,662 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:15:23,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:23 WrapperNode [2025-03-03 13:15:23,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:15:23,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:15:23,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:15:23,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:15:23,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:23" (1/1) ... [2025-03-03 13:15:23,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:23" (1/1) ... [2025-03-03 13:15:23,683 INFO L138 Inliner]: procedures = 121, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 76 [2025-03-03 13:15:23,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:15:23,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:15:23,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:15:23,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:15:23,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:23" (1/1) ... [2025-03-03 13:15:23,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:23" (1/1) ... [2025-03-03 13:15:23,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:23" (1/1) ... [2025-03-03 13:15:23,697 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 5 writes are split as follows [0, 0, 5]. [2025-03-03 13:15:23,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:23" (1/1) ... [2025-03-03 13:15:23,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:23" (1/1) ... [2025-03-03 13:15:23,700 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:23" (1/1) ... [2025-03-03 13:15:23,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:23" (1/1) ... [2025-03-03 13:15:23,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:23" (1/1) ... [2025-03-03 13:15:23,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:23" (1/1) ... [2025-03-03 13:15:23,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:15:23,708 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:15:23,708 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:15:23,709 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:15:23,709 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:23" (1/1) ... [2025-03-03 13:15:23,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:15:23,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:15:23,737 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 13:15:23,740 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 13:15:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 13:15:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 13:15:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 13:15:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 13:15:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 13:15:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 13:15:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 13:15:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:15:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 13:15:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 13:15:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 13:15:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 13:15:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 13:15:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 13:15:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:15:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 13:15:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 13:15:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:15:23,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:15:23,851 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:15:23,852 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:15:23,976 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 13:15:23,976 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:15:23,982 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:15:23,982 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:15:23,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:15:23 BoogieIcfgContainer [2025-03-03 13:15:23,982 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:15:23,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:15:23,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:15:23,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:15:23,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:15:23" (1/3) ... [2025-03-03 13:15:23,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6438e11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:15:23, skipping insertion in model container [2025-03-03 13:15:23,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:15:23" (2/3) ... [2025-03-03 13:15:23,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6438e11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:15:23, skipping insertion in model container [2025-03-03 13:15:23,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:15:23" (3/3) ... [2025-03-03 13:15:23,989 INFO L128 eAbstractionObserver]: Analyzing ICFG cart.i [2025-03-03 13:15:23,999 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:15:24,001 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cart.i that has 1 procedures, 19 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 13:15:24,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:15:24,042 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;@701da047, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:15:24,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:15:24,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:15:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:15:24,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:15:24,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:15:24,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:15:24,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:15:24,055 INFO L85 PathProgramCache]: Analyzing trace with hash 746453873, now seen corresponding path program 1 times [2025-03-03 13:15:24,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:15:24,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096768988] [2025-03-03 13:15:24,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:15:24,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:15:24,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:15:24,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:15:24,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:15:24,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:24,141 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 13:15:24,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:15:24,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096768988] [2025-03-03 13:15:24,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096768988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:15:24,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:15:24,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 13:15:24,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554212764] [2025-03-03 13:15:24,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:15:24,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:15:24,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:15:24,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:15:24,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:15:24,159 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 13:15:24,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:15:24,167 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2025-03-03 13:15:24,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:15:24,168 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2025-03-03 13:15:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:15:24,172 INFO L225 Difference]: With dead ends: 32 [2025-03-03 13:15:24,172 INFO L226 Difference]: Without dead ends: 16 [2025-03-03 13:15:24,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:15:24,175 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:15:24,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:15:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-03 13:15:24,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-03 13:15:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:15:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-03-03 13:15:24,197 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 8 [2025-03-03 13:15:24,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:15:24,198 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-03 13:15:24,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 13:15:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2025-03-03 13:15:24,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 13:15:24,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:15:24,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:15:24,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:15:24,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:15:24,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:15:24,201 INFO L85 PathProgramCache]: Analyzing trace with hash -848545452, now seen corresponding path program 1 times [2025-03-03 13:15:24,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:15:24,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919732456] [2025-03-03 13:15:24,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:15:24,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:15:24,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 13:15:24,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 13:15:24,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:15:24,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:24,347 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 13:15:24,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:15:24,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919732456] [2025-03-03 13:15:24,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919732456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:15:24,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:15:24,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:15:24,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028485753] [2025-03-03 13:15:24,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:15:24,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:15:24,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:15:24,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:15:24,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:15:24,349 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:15:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:15:24,400 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2025-03-03 13:15:24,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:15:24,401 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 13:15:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:15:24,401 INFO L225 Difference]: With dead ends: 32 [2025-03-03 13:15:24,401 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 13:15:24,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:15:24,402 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:15:24,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:15:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 13:15:24,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-03 13:15:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:15:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2025-03-03 13:15:24,407 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 10 [2025-03-03 13:15:24,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:15:24,407 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2025-03-03 13:15:24,407 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 13:15:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2025-03-03 13:15:24,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 13:15:24,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:15:24,408 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:15:24,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:15:24,408 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:15:24,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:15:24,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1888127375, now seen corresponding path program 1 times [2025-03-03 13:15:24,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:15:24,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672770905] [2025-03-03 13:15:24,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:15:24,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:15:24,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 13:15:24,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 13:15:24,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:15:24,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:15:24,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:15:24,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672770905] [2025-03-03 13:15:24,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672770905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:15:24,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:15:24,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:15:24,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677761976] [2025-03-03 13:15:24,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:15:24,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:15:24,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:15:24,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:15:24,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:15:24,521 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 13:15:24,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:15:24,562 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2025-03-03 13:15:24,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:15:24,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-03-03 13:15:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:15:24,563 INFO L225 Difference]: With dead ends: 34 [2025-03-03 13:15:24,563 INFO L226 Difference]: Without dead ends: 29 [2025-03-03 13:15:24,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:15:24,563 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:15:24,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 43 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:15:24,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-03 13:15:24,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2025-03-03 13:15:24,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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 13:15:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2025-03-03 13:15:24,568 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 14 [2025-03-03 13:15:24,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:15:24,568 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2025-03-03 13:15:24,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 13:15:24,569 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2025-03-03 13:15:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:15:24,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:15:24,569 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:15:24,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:15:24,570 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:15:24,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:15:24,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2005346733, now seen corresponding path program 1 times [2025-03-03 13:15:24,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:15:24,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607713060] [2025-03-03 13:15:24,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:15:24,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:15:24,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:15:24,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:15:24,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:15:24,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:15:25,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:15:25,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607713060] [2025-03-03 13:15:25,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607713060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:15:25,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491705622] [2025-03-03 13:15:25,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:15:25,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:15:25,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:15:25,021 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 13:15:25,023 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 13:15:25,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:15:25,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:15:25,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:15:25,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:25,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 13:15:25,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:15:25,227 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 34 treesize of output 15 [2025-03-03 13:15:25,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:25,246 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 26 treesize of output 10 [2025-03-03 13:15:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:15:25,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:15:25,356 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-03-03 13:15:25,356 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 881 treesize of output 696 [2025-03-03 13:15:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:15:25,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491705622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:15:25,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:15:25,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2025-03-03 13:15:25,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957043825] [2025-03-03 13:15:25,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:15:25,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:15:25,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:15:25,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:15:25,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:15:25,445 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:15:25,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:15:25,653 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2025-03-03 13:15:25,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:15:25,654 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-03 13:15:25,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:15:25,654 INFO L225 Difference]: With dead ends: 35 [2025-03-03 13:15:25,654 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 13:15:25,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-03 13:15:25,655 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 57 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:15:25,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 122 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:15:25,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 13:15:25,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2025-03-03 13:15:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:15:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2025-03-03 13:15:25,658 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 18 [2025-03-03 13:15:25,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:15:25,658 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2025-03-03 13:15:25,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:15:25,658 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2025-03-03 13:15:25,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 13:15:25,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:15:25,659 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:15:25,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 13:15:25,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:15:25,863 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:15:25,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:15:25,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1709694725, now seen corresponding path program 1 times [2025-03-03 13:15:25,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:15:25,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825606936] [2025-03-03 13:15:25,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:15:25,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:15:25,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 13:15:25,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:15:25,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:15:25,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:26,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:15:26,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:15:26,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825606936] [2025-03-03 13:15:26,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825606936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:15:26,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720567791] [2025-03-03 13:15:26,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:15:26,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:15:26,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:15:26,015 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 13:15:26,017 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 13:15:26,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 13:15:26,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:15:26,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:15:26,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:26,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 13:15:26,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:15:26,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:15:26,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:15:26,253 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-03 13:15:26,254 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 24 treesize of output 23 [2025-03-03 13:15:26,265 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-03 13:15:26,266 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 20 treesize of output 12 [2025-03-03 13:15:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:15:26,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720567791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:15:26,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:15:26,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 11 [2025-03-03 13:15:26,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333335135] [2025-03-03 13:15:26,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:15:26,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 13:15:26,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:15:26,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 13:15:26,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:15:26,281 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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 13:15:26,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:15:26,393 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2025-03-03 13:15:26,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 13:15:26,393 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-03 13:15:26,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:15:26,394 INFO L225 Difference]: With dead ends: 42 [2025-03-03 13:15:26,394 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 13:15:26,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:15:26,395 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:15:26,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:15:26,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 13:15:26,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2025-03-03 13:15:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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 13:15:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2025-03-03 13:15:26,399 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 21 [2025-03-03 13:15:26,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:15:26,399 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2025-03-03 13:15:26,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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 13:15:26,399 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2025-03-03 13:15:26,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 13:15:26,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:15:26,399 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:15:26,407 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 13:15:26,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:15:26,600 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:15:26,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:15:26,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1893370571, now seen corresponding path program 2 times [2025-03-03 13:15:26,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:15:26,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343615369] [2025-03-03 13:15:26,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:15:26,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:15:26,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-03 13:15:26,622 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:15:26,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:15:26,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:15:26,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:15:26,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343615369] [2025-03-03 13:15:26,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343615369] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:15:26,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530761322] [2025-03-03 13:15:26,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:15:26,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:15:26,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:15:26,900 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 13:15:26,901 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 13:15:26,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-03 13:15:26,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:15:26,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:15:26,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:26,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 13:15:26,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:15:26,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:15:27,113 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 34 treesize of output 15 [2025-03-03 13:15:27,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-03-03 13:15:27,143 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 7 treesize of output 3 [2025-03-03 13:15:27,184 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:15:27,185 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 1 case distinctions, treesize of input 20 treesize of output 17 [2025-03-03 13:15:27,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2025-03-03 13:15:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:15:27,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:15:27,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:27,424 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 55 [2025-03-03 13:15:27,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:27,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 87 [2025-03-03 13:15:27,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-03 13:15:27,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:15:27,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530761322] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:15:27,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:15:27,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 20 [2025-03-03 13:15:27,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856048551] [2025-03-03 13:15:27,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:15:27,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 13:15:27,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:15:27,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 13:15:27,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=315, Unknown=2, NotChecked=0, Total=380 [2025-03-03 13:15:27,576 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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 13:15:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:15:28,510 INFO L93 Difference]: Finished difference Result 81 states and 118 transitions. [2025-03-03 13:15:28,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 13:15:28,511 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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 22 [2025-03-03 13:15:28,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:15:28,511 INFO L225 Difference]: With dead ends: 81 [2025-03-03 13:15:28,512 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 13:15:28,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=926, Unknown=5, NotChecked=0, Total=1122 [2025-03-03 13:15:28,513 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 111 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 17 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 13:15:28,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 247 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 345 Invalid, 22 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 13:15:28,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 13:15:28,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2025-03-03 13:15:28,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:15:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2025-03-03 13:15:28,519 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 22 [2025-03-03 13:15:28,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:15:28,519 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2025-03-03 13:15:28,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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 13:15:28,519 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2025-03-03 13:15:28,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:15:28,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:15:28,520 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:15:28,527 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 13:15:28,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:15:28,720 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:15:28,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:15:28,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1093884550, now seen corresponding path program 3 times [2025-03-03 13:15:28,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:15:28,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772660985] [2025-03-03 13:15:28,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:15:28,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:15:28,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-03 13:15:28,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:15:28,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:15:28,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:29,199 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:15:29,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:15:29,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772660985] [2025-03-03 13:15:29,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772660985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:15:29,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086504226] [2025-03-03 13:15:29,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:15:29,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:15:29,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:15:29,204 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 13:15:29,206 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 13:15:29,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-03 13:15:29,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:15:29,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:15:29,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:29,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-03 13:15:29,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:15:29,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:15:29,339 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 13:15:29,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2025-03-03 13:15:29,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2025-03-03 13:15:29,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-03-03 13:15:29,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:29,528 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 34 [2025-03-03 13:15:29,546 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-03 13:15:29,546 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 1 case distinctions, treesize of input 24 treesize of output 19 [2025-03-03 13:15:29,555 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 5 treesize of output 3 [2025-03-03 13:15:29,562 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 32 treesize of output 26 [2025-03-03 13:15:29,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2025-03-03 13:15:29,603 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:15:29,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:15:29,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:29,747 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 51 [2025-03-03 13:15:29,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:29,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 83 [2025-03-03 13:15:29,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-03 13:15:31,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 [2025-03-03 13:15:31,158 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 218 treesize of output 214 [2025-03-03 13:15:31,183 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:15:31,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086504226] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:15:31,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:15:31,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2025-03-03 13:15:31,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698138264] [2025-03-03 13:15:31,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:15:31,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 13:15:31,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:15:31,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 13:15:31,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=489, Unknown=8, NotChecked=0, Total=600 [2025-03-03 13:15:31,184 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand has 25 states, 25 states have (on average 2.4) internal successors, (60), 25 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 13:15:31,199 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~l~0#1.offset| 0))) (and (or (and (= |c_ULTIMATE.start_main_~l~0#1.base| 0) .cse0) (forall ((v_ArrVal_353 (Array Int Int))) (let ((.cse1 (select v_ArrVal_353 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= v_ArrVal_353 (let ((.cse3 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (store (let ((.cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8))) (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|) .cse2 (select v_ArrVal_353 .cse2))) .cse3 (select v_ArrVal_353 .cse3))))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_353) .cse1) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) 0)))))) .cse0)) is different from false [2025-03-03 13:15:35,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 13:15:39,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 13:15:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:15:41,731 INFO L93 Difference]: Finished difference Result 78 states and 116 transitions. [2025-03-03 13:15:41,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 13:15:41,732 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.4) internal successors, (60), 25 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) Word has length 26 [2025-03-03 13:15:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:15:41,733 INFO L225 Difference]: With dead ends: 78 [2025-03-03 13:15:41,733 INFO L226 Difference]: Without dead ends: 76 [2025-03-03 13:15:41,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=345, Invalid=1439, Unknown=26, NotChecked=82, Total=1892 [2025-03-03 13:15:41,734 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 128 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-03-03 13:15:41,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 261 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 281 Invalid, 1 Unknown, 67 Unchecked, 9.8s Time] [2025-03-03 13:15:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-03 13:15:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 38. [2025-03-03 13:15:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 37 states have internal predecessors, (53), 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 13:15:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2025-03-03 13:15:41,739 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 26 [2025-03-03 13:15:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:15:41,740 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2025-03-03 13:15:41,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.4) internal successors, (60), 25 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 13:15:41,740 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2025-03-03 13:15:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 13:15:41,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:15:41,740 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:15:41,747 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 13:15:41,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:15:41,941 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:15:41,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:15:41,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1998624130, now seen corresponding path program 2 times [2025-03-03 13:15:41,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:15:41,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981507254] [2025-03-03 13:15:41,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:15:41,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:15:41,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-03 13:15:41,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 13:15:41,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:15:41,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:15:42,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:15:42,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981507254] [2025-03-03 13:15:42,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981507254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:15:42,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071654964] [2025-03-03 13:15:42,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:15:42,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:15:42,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:15:42,490 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 13:15:42,492 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 13:15:42,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-03 13:15:42,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 13:15:42,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:15:42,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:42,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-03 13:15:42,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:15:42,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-03 13:15:42,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:15:42,620 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 13:15:42,627 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-03 13:15:42,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-03 13:15:42,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2025-03-03 13:15:42,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-03-03 13:15:42,808 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-03 13:15:42,809 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 92 [2025-03-03 13:15:42,815 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 24 treesize of output 11 [2025-03-03 13:15:42,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 23 [2025-03-03 13:15:42,902 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 46 treesize of output 26 [2025-03-03 13:15:42,905 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 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 13:15:42,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:42,911 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 26 treesize of output 10 [2025-03-03 13:15:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:15:42,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:15:43,048 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2025-03-03 13:15:43,048 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 996 treesize of output 809 [2025-03-03 13:15:43,093 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 6 treesize of output 4 [2025-03-03 13:15:43,209 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (and (forall ((v_ArrVal_481 (Array Int Int))) (or (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse0 (select v_ArrVal_481 |c_ULTIMATE.start_main_~i~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_481) .cse0 v_ArrVal_484) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))) (not (= v_ArrVal_481 (store (store .cse1 .cse2 (select v_ArrVal_481 .cse2)) .cse3 (select v_ArrVal_481 .cse3)))))) (forall ((v_ArrVal_482 Int) (v_ArrVal_479 Int) (v_ArrVal_488 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= (select v_ArrVal_488 .cse4) 0)) (= .cse4 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse2 v_ArrVal_482) .cse3 v_ArrVal_479)) (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_488) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))))) is different from false [2025-03-03 13:15:43,264 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (forall ((v_ArrVal_481 (Array Int Int))) (or (forall ((v_ArrVal_484 (Array Int Int))) (let ((.cse0 (select v_ArrVal_481 |c_ULTIMATE.start_main_~l~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_481) .cse0 v_ArrVal_484) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))) (not (= v_ArrVal_481 (store (store .cse1 .cse2 (select v_ArrVal_481 .cse2)) .cse3 (select v_ArrVal_481 .cse3)))))) (forall ((v_ArrVal_482 Int) (v_ArrVal_479 Int) (v_ArrVal_488 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse4 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse5 .cse2 v_ArrVal_482) .cse3 v_ArrVal_479)) (select .cse1 |c_ULTIMATE.start_main_~l~0#1.offset|) v_ArrVal_488) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select v_ArrVal_488 .cse4) 0)))))))) is different from false [2025-03-03 13:15:43,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:43,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 80 [2025-03-03 13:15:43,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2025-03-03 13:15:43,322 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 56 treesize of output 54 [2025-03-03 13:15:43,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:43,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 58 [2025-03-03 13:15:43,333 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 35 treesize of output 33 [2025-03-03 13:15:43,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:15:43,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2025-03-03 13:15:43,379 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 15 treesize of output 11 [2025-03-03 13:15:43,402 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2025-03-03 13:15:43,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071654964] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:15:43,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:15:43,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-03 13:15:43,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525938777] [2025-03-03 13:15:43,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:15:43,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 13:15:43,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:15:43,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 13:15:43,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=320, Unknown=9, NotChecked=74, Total=462 [2025-03-03 13:15:43,404 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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 13:15:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:15:44,794 INFO L93 Difference]: Finished difference Result 72 states and 103 transitions. [2025-03-03 13:15:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 13:15:44,795 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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 29 [2025-03-03 13:15:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:15:44,795 INFO L225 Difference]: With dead ends: 72 [2025-03-03 13:15:44,795 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 13:15:44,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=931, Unknown=10, NotChecked=130, Total=1260 [2025-03-03 13:15:44,798 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 92 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 7 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:15:44,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 304 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 316 Invalid, 17 Unknown, 140 Unchecked, 1.0s Time] [2025-03-03 13:15:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 13:15:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 46. [2025-03-03 13:15:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 45 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:15:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2025-03-03 13:15:44,803 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 29 [2025-03-03 13:15:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:15:44,803 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2025-03-03 13:15:44,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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 13:15:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2025-03-03 13:15:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 13:15:44,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:15:44,804 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:15:44,810 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 13:15:45,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:15:45,005 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:15:45,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:15:45,005 INFO L85 PathProgramCache]: Analyzing trace with hash 887138084, now seen corresponding path program 4 times [2025-03-03 13:15:45,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:15:45,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372841427] [2025-03-03 13:15:45,005 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:15:45,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:15:45,016 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-03 13:15:45,034 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:15:45,034 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:15:45,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:45,746 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:15:45,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:15:45,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372841427] [2025-03-03 13:15:45,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372841427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:15:45,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181496966] [2025-03-03 13:15:45,746 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:15:45,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:15:45,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:15:45,748 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 13:15:45,749 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 13:15:45,811 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-03 13:15:46,045 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:15:46,045 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:15:46,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:15:46,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-03 13:15:46,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:15:46,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:15:46,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:15:46,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-03 13:15:46,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2025-03-03 13:15:46,141 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-03 13:15:46,141 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 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-03 13:15:46,157 INFO L349 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2025-03-03 13:15:46,157 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 1 case distinctions, treesize of input 21 treesize of output 31 [2025-03-03 13:15:46,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2025-03-03 13:15:46,172 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-03 13:15:46,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-03 13:15:46,278 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 13:15:46,279 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 32 [2025-03-03 13:15:46,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2025-03-03 13:15:46,354 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 13:15:46,354 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 72 [2025-03-03 13:15:46,360 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 0 case distinctions, treesize of input 29 treesize of output 19 [2025-03-03 13:15:46,362 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 6 treesize of output 4 [2025-03-03 13:15:46,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-03 13:15:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:15:46,389 INFO L312 TraceCheckSpWp]: Computing backward predicates...