./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/mbpr2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/mbpr2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a98ea70d5d9f752732070144a56514c68e9571f139726211e2f0ade721d6c5f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:13:49,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:13:49,569 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:13:49,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:13:49,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:13:49,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:13:49,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:13:49,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:13:49,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:13:49,595 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:13:49,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:13:49,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:13:49,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:13:49,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:13:49,596 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:13:49,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:13:49,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:13:49,596 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:13:49,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:13:49,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:13:49,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:13:49,596 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:13:49,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:13:49,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:13:49,597 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:13:49,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:13:49,597 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:13:49,597 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:13:49,597 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:13:49,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:13:49,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:13:49,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:13:49,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:13:49,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:13:49,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:13:49,598 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:13:49,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:13:49,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:13:49,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:13:49,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:13:49,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:13:49,598 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:13:49,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:13:49,598 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 -> a98ea70d5d9f752732070144a56514c68e9571f139726211e2f0ade721d6c5f3 [2025-03-03 09:13:49,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:13:49,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:13:49,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:13:49,828 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:13:49,828 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:13:49,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mbpr2.c [2025-03-03 09:13:50,957 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eeb3934e/d2e0bd6a0f7b4b87a76dc173d696f199/FLAG92e2b90fe [2025-03-03 09:13:51,185 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:13:51,189 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr2.c [2025-03-03 09:13:51,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eeb3934e/d2e0bd6a0f7b4b87a76dc173d696f199/FLAG92e2b90fe [2025-03-03 09:13:51,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eeb3934e/d2e0bd6a0f7b4b87a76dc173d696f199 [2025-03-03 09:13:51,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:13:51,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:13:51,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:13:51,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:13:51,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:13:51,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:13:51" (1/1) ... [2025-03-03 09:13:51,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfd05b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:13:51, skipping insertion in model container [2025-03-03 09:13:51,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:13:51" (1/1) ... [2025-03-03 09:13:51,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:13:51,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr2.c[396,409] [2025-03-03 09:13:51,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:13:51,654 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:13:51,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr2.c[396,409] [2025-03-03 09:13:51,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:13:51,683 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:13:51,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:13:51 WrapperNode [2025-03-03 09:13:51,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:13:51,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:13:51,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:13:51,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:13:51,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:13:51" (1/1) ... [2025-03-03 09:13:51,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:13:51" (1/1) ... [2025-03-03 09:13:51,711 INFO L138 Inliner]: procedures = 15, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 83 [2025-03-03 09:13:51,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:13:51,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:13:51,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:13:51,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:13:51,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:13:51" (1/1) ... [2025-03-03 09:13:51,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:13:51" (1/1) ... [2025-03-03 09:13:51,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:13:51" (1/1) ... [2025-03-03 09:13:51,730 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 8, 10]. 50 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-03-03 09:13:51,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:13:51" (1/1) ... [2025-03-03 09:13:51,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:13:51" (1/1) ... [2025-03-03 09:13:51,735 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:13:51" (1/1) ... [2025-03-03 09:13:51,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:13:51" (1/1) ... [2025-03-03 09:13:51,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:13:51" (1/1) ... [2025-03-03 09:13:51,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:13:51" (1/1) ... [2025-03-03 09:13:51,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:13:51,743 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:13:51,743 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:13:51,743 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:13:51,744 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:13:51" (1/1) ... [2025-03-03 09:13:51,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:13:51,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:13:51,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:13:51,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:13:51,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:13:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:13:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:13:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:13:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:13:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:13:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:13:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:13:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:13:51,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:13:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:13:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:13:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:13:51,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:13:51,854 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:13:51,855 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:13:52,018 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 09:13:52,018 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:13:52,024 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:13:52,024 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:13:52,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:13:52 BoogieIcfgContainer [2025-03-03 09:13:52,025 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:13:52,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:13:52,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:13:52,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:13:52,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:13:51" (1/3) ... [2025-03-03 09:13:52,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432a0f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:13:52, skipping insertion in model container [2025-03-03 09:13:52,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:13:51" (2/3) ... [2025-03-03 09:13:52,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432a0f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:13:52, skipping insertion in model container [2025-03-03 09:13:52,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:13:52" (3/3) ... [2025-03-03 09:13:52,033 INFO L128 eAbstractionObserver]: Analyzing ICFG mbpr2.c [2025-03-03 09:13:52,044 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:13:52,045 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mbpr2.c that has 1 procedures, 23 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 09:13:52,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:13:52,090 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;@5eeedb4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:13:52,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:13:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:52,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 09:13:52,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:13:52,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:13:52,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:13:52,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:13:52,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1076511281, now seen corresponding path program 1 times [2025-03-03 09:13:52,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:13:52,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336672729] [2025-03-03 09:13:52,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:13:52,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:13:52,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 09:13:52,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 09:13:52,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:13:52,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:13:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:13:52,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:13:52,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336672729] [2025-03-03 09:13:52,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336672729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:13:52,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:13:52,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:13:52,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003288592] [2025-03-03 09:13:52,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:13:52,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:13:52,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:13:52,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:13:52,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:13:52,269 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:52,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:13:52,279 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2025-03-03 09:13:52,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:13:52,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-03 09:13:52,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:13:52,286 INFO L225 Difference]: With dead ends: 41 [2025-03-03 09:13:52,286 INFO L226 Difference]: Without dead ends: 19 [2025-03-03 09:13:52,289 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 09:13:52,293 INFO L435 NwaCegarLoop]: 30 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, 30 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 09:13:52,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:13:52,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-03 09:13:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-03 09:13:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-03-03 09:13:52,316 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 13 [2025-03-03 09:13:52,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:13:52,317 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-03 09:13:52,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:52,317 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2025-03-03 09:13:52,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 09:13:52,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:13:52,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:13:52,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:13:52,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:13:52,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:13:52,321 INFO L85 PathProgramCache]: Analyzing trace with hash -730943182, now seen corresponding path program 1 times [2025-03-03 09:13:52,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:13:52,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818690902] [2025-03-03 09:13:52,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:13:52,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:13:52,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 09:13:52,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 09:13:52,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:13:52,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:13:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:13:52,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:13:52,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818690902] [2025-03-03 09:13:52,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818690902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:13:52,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:13:52,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:13:52,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331531740] [2025-03-03 09:13:52,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:13:52,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:13:52,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:13:52,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:13:52,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:13:52,520 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:13:52,577 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2025-03-03 09:13:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:13:52,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-03 09:13:52,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:13:52,578 INFO L225 Difference]: With dead ends: 35 [2025-03-03 09:13:52,578 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 09:13:52,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:13:52,579 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:13:52,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 18 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:13:52,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 09:13:52,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2025-03-03 09:13:52,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 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 09:13:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-03-03 09:13:52,583 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2025-03-03 09:13:52,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:13:52,583 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-03 09:13:52,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2025-03-03 09:13:52,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 09:13:52,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:13:52,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:13:52,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:13:52,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:13:52,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:13:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2037267954, now seen corresponding path program 1 times [2025-03-03 09:13:52,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:13:52,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097050405] [2025-03-03 09:13:52,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:13:52,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:13:52,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 09:13:52,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:13:52,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:13:52,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:13:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:13:53,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:13:53,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097050405] [2025-03-03 09:13:53,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097050405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:13:53,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506966567] [2025-03-03 09:13:53,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:13:53,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:13:53,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:13:53,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:13:53,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:13:53,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 09:13:53,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:13:53,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:13:53,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:13:53,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 09:13:53,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:13:53,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:13:53,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:13:53,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2025-03-03 09:13:53,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:13:53,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:13:53,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 21 [2025-03-03 09:13:53,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:13:53,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-03-03 09:13:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:13:53,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:13:53,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:13:53,771 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 22 treesize of output 20 [2025-03-03 09:13:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:13:53,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506966567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:13:53,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:13:53,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 20 [2025-03-03 09:13:53,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304656463] [2025-03-03 09:13:53,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:13:53,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 09:13:53,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:13:53,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 09:13:53,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:13:53,824 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:13:54,215 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2025-03-03 09:13:54,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 09:13:54,215 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-03 09:13:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:13:54,216 INFO L225 Difference]: With dead ends: 81 [2025-03-03 09:13:54,216 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 09:13:54,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 09:13:54,217 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 273 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:13:54,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 96 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:13:54,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 09:13:54,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 23. [2025-03-03 09:13:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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 09:13:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-03 09:13:54,222 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2025-03-03 09:13:54,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:13:54,222 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-03 09:13:54,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:54,222 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-03 09:13:54,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 09:13:54,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:13:54,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:13:54,229 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 09:13:54,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:13:54,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:13:54,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:13:54,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2037297745, now seen corresponding path program 1 times [2025-03-03 09:13:54,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:13:54,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550704074] [2025-03-03 09:13:54,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:13:54,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:13:54,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 09:13:54,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:13:54,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:13:54,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:13:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 09:13:54,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:13:54,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550704074] [2025-03-03 09:13:54,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550704074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:13:54,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:13:54,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:13:54,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329458777] [2025-03-03 09:13:54,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:13:54,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:13:54,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:13:54,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:13:54,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:13:54,493 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:54,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:13:54,505 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2025-03-03 09:13:54,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:13:54,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-03 09:13:54,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:13:54,505 INFO L225 Difference]: With dead ends: 27 [2025-03-03 09:13:54,505 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 09:13:54,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:13:54,506 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:13:54,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:13:54,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 09:13:54,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-03 09:13:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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 09:13:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-03 09:13:54,509 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2025-03-03 09:13:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:13:54,509 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-03 09:13:54,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:54,510 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-03 09:13:54,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:13:54,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:13:54,510 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:13:54,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:13:54,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:13:54,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:13:54,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1236047172, now seen corresponding path program 1 times [2025-03-03 09:13:54,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:13:54,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776979181] [2025-03-03 09:13:54,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:13:54,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:13:54,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:13:54,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:13:54,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:13:54,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:13:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:13:54,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:13:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776979181] [2025-03-03 09:13:54,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776979181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:13:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961981539] [2025-03-03 09:13:54,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:13:54,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:13:54,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:13:54,843 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:13:54,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:13:54,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:13:54,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:13:54,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:13:54,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:13:54,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 09:13:54,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:13:54,929 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 09:13:54,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:13:55,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:13:55,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:13:55,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:13:55,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-03 09:13:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:13:55,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961981539] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:13:55,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:13:55,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 14 [2025-03-03 09:13:55,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952652769] [2025-03-03 09:13:55,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:13:55,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:13:55,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:13:55,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:13:55,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:13:55,099 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:13:55,266 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2025-03-03 09:13:55,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 09:13:55,267 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 09:13:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:13:55,268 INFO L225 Difference]: With dead ends: 56 [2025-03-03 09:13:55,268 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 09:13:55,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:13:55,269 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 63 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:13:55,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 76 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:13:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 09:13:55,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 35. [2025-03-03 09:13:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-03-03 09:13:55,278 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 24 [2025-03-03 09:13:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:13:55,278 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-03 09:13:55,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-03-03 09:13:55,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:13:55,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:13:55,280 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:13:55,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 09:13:55,480 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 09:13:55,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:13:55,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:13:55,481 INFO L85 PathProgramCache]: Analyzing trace with hash -942644165, now seen corresponding path program 1 times [2025-03-03 09:13:55,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:13:55,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565748333] [2025-03-03 09:13:55,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:13:55,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:13:55,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:13:55,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:13:55,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:13:55,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:13:55,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:13:55,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:13:55,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565748333] [2025-03-03 09:13:55,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565748333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:13:55,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:13:55,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:13:55,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707940978] [2025-03-03 09:13:55,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:13:55,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:13:55,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:13:55,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:13:55,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:13:55,554 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:13:55,562 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-03-03 09:13:55,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:13:55,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 09:13:55,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:13:55,562 INFO L225 Difference]: With dead ends: 44 [2025-03-03 09:13:55,562 INFO L226 Difference]: Without dead ends: 30 [2025-03-03 09:13:55,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:13:55,563 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:13:55,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 20 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:13:55,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-03 09:13:55,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-03 09:13:55,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 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 09:13:55,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-03-03 09:13:55,568 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 24 [2025-03-03 09:13:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:13:55,568 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-03 09:13:55,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-03-03 09:13:55,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:13:55,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:13:55,569 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:13:55,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:13:55,569 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:13:55,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:13:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1707590351, now seen corresponding path program 2 times [2025-03-03 09:13:55,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:13:55,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640718219] [2025-03-03 09:13:55,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:13:55,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:13:55,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-03 09:13:55,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:13:55,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:13:55,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:13:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:13:55,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:13:55,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640718219] [2025-03-03 09:13:55,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640718219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:13:55,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810762892] [2025-03-03 09:13:55,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:13:55,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:13:55,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:13:55,742 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:13:55,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:13:55,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-03 09:13:55,792 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:13:55,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:13:55,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:13:55,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 09:13:55,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:13:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:13:56,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:13:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:13:56,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810762892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:13:56,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:13:56,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 23 [2025-03-03 09:13:56,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070261318] [2025-03-03 09:13:56,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:13:56,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 09:13:56,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:13:56,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 09:13:56,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:13:56,108 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 23 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:56,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:13:56,250 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2025-03-03 09:13:56,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:13:56,253 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 23 states have internal predecessors, (75), 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 09:13:56,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:13:56,253 INFO L225 Difference]: With dead ends: 77 [2025-03-03 09:13:56,253 INFO L226 Difference]: Without dead ends: 43 [2025-03-03 09:13:56,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=536, Unknown=0, NotChecked=0, Total=756 [2025-03-03 09:13:56,254 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 112 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:13:56,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 68 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:13:56,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-03 09:13:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2025-03-03 09:13:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-03-03 09:13:56,261 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 29 [2025-03-03 09:13:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:13:56,261 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-03-03 09:13:56,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 23 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-03-03 09:13:56,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 09:13:56,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:13:56,262 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:13:56,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 09:13:56,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:13:56,462 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:13:56,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:13:56,463 INFO L85 PathProgramCache]: Analyzing trace with hash -165822415, now seen corresponding path program 3 times [2025-03-03 09:13:56,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:13:56,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349874180] [2025-03-03 09:13:56,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:13:56,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:13:56,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-03-03 09:13:56,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:13:56,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:13:56,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:13:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:13:57,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:13:57,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349874180] [2025-03-03 09:13:57,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349874180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:13:57,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904059021] [2025-03-03 09:13:57,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:13:57,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:13:57,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:13:57,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:13:57,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:13:57,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-03-03 09:13:57,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:13:57,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:13:57,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:13:57,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 09:13:57,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:13:57,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:13:57,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:13:57,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2025-03-03 09:13:57,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:13:57,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:13:57,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-03 09:13:57,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:13:57,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:13:57,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:13:57,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 31 [2025-03-03 09:13:57,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:13:57,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2025-03-03 09:13:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:13:57,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:13:57,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:13:57,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:13:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:13:57,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904059021] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:13:57,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:13:57,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 36 [2025-03-03 09:13:57,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205995163] [2025-03-03 09:13:57,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:13:57,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 09:13:57,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:13:57,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 09:13:57,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 09:13:57,924 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 36 states, 36 states have (on average 2.611111111111111) internal successors, (94), 36 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:13:58,535 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2025-03-03 09:13:58,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 09:13:58,535 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.611111111111111) internal successors, (94), 36 states have internal predecessors, (94), 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 35 [2025-03-03 09:13:58,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:13:58,536 INFO L225 Difference]: With dead ends: 72 [2025-03-03 09:13:58,536 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 09:13:58,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=523, Invalid=2339, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 09:13:58,537 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 287 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:13:58,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 133 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:13:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 09:13:58,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2025-03-03 09:13:58,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:58,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-03-03 09:13:58,544 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 35 [2025-03-03 09:13:58,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:13:58,544 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-03-03 09:13:58,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.611111111111111) internal successors, (94), 36 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:58,544 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-03-03 09:13:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 09:13:58,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:13:58,545 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:13:58,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 09:13:58,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:13:58,745 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:13:58,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:13:58,746 INFO L85 PathProgramCache]: Analyzing trace with hash 277247965, now seen corresponding path program 4 times [2025-03-03 09:13:58,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:13:58,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828591664] [2025-03-03 09:13:58,746 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:13:58,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:13:58,753 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-03 09:13:58,766 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 40 statements. [2025-03-03 09:13:58,766 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:13:58,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:13:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:13:59,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:13:59,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828591664] [2025-03-03 09:13:59,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828591664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:13:59,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437172382] [2025-03-03 09:13:59,059 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:13:59,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:13:59,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:13:59,061 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:13:59,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:13:59,099 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-03 09:13:59,113 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 40 statements. [2025-03-03 09:13:59,113 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:13:59,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:13:59,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 09:13:59,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:13:59,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-03 09:13:59,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-03 09:13:59,204 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:13:59,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:13:59,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:13:59,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-03 09:13:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:13:59,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437172382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:13:59,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:13:59,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 16 [2025-03-03 09:13:59,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095057676] [2025-03-03 09:13:59,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:13:59,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 09:13:59,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:13:59,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 09:13:59,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:13:59,263 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:59,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:13:59,543 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2025-03-03 09:13:59,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 09:13:59,544 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-03 09:13:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:13:59,545 INFO L225 Difference]: With dead ends: 68 [2025-03-03 09:13:59,545 INFO L226 Difference]: Without dead ends: 66 [2025-03-03 09:13:59,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:13:59,546 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:13:59,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 127 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:13:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-03 09:13:59,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2025-03-03 09:13:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-03-03 09:13:59,551 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 40 [2025-03-03 09:13:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:13:59,551 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-03-03 09:13:59,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:13:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-03-03 09:13:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 09:13:59,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:13:59,552 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:13:59,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:13:59,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:13:59,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:13:59,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:13:59,754 INFO L85 PathProgramCache]: Analyzing trace with hash 255147184, now seen corresponding path program 5 times [2025-03-03 09:13:59,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:13:59,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331829275] [2025-03-03 09:13:59,754 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:13:59,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:13:59,763 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 5 equivalence classes. [2025-03-03 09:13:59,778 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 09:13:59,778 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:13:59,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:14:00,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:00,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331829275] [2025-03-03 09:14:00,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331829275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:14:00,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51358544] [2025-03-03 09:14:00,004 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:14:00,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:00,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:14:00,006 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:14:00,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:14:00,048 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 5 equivalence classes. [2025-03-03 09:14:00,099 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 09:14:00,099 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:14:00,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:00,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:14:00,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:14:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:14:00,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:14:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:14:00,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51358544] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:14:00,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:14:00,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 33 [2025-03-03 09:14:00,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974760659] [2025-03-03 09:14:00,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:14:00,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 09:14:00,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:00,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 09:14:00,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 09:14:00,581 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 33 states, 33 states have (on average 3.4242424242424243) internal successors, (113), 33 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:00,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:00,790 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2025-03-03 09:14:00,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 09:14:00,790 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.4242424242424243) internal successors, (113), 33 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-03 09:14:00,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:00,791 INFO L225 Difference]: With dead ends: 113 [2025-03-03 09:14:00,791 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 09:14:00,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=434, Invalid=1126, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 09:14:00,791 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 143 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:14:00,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 114 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:14:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 09:14:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2025-03-03 09:14:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-03-03 09:14:00,796 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 45 [2025-03-03 09:14:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:00,796 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-03-03 09:14:00,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.4242424242424243) internal successors, (113), 33 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-03-03 09:14:00,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 09:14:00,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:00,797 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:14:00,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 09:14:01,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:01,001 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:01,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:01,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1923124880, now seen corresponding path program 6 times [2025-03-03 09:14:01,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:01,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832597719] [2025-03-03 09:14:01,001 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:14:01,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:01,013 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 5 equivalence classes. [2025-03-03 09:14:01,036 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 09:14:01,040 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:14:01,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:14:02,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:02,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832597719] [2025-03-03 09:14:02,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832597719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:14:02,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208112992] [2025-03-03 09:14:02,111 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:14:02,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:02,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:14:02,113 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:14:02,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:14:02,159 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 5 equivalence classes. [2025-03-03 09:14:02,223 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 09:14:02,223 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:14:02,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:02,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-03 09:14:02,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:14:02,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:14:02,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:02,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2025-03-03 09:14:02,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:14:02,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:02,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-03 09:14:02,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:02,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:14:02,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:02,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 31 [2025-03-03 09:14:02,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:02,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-03 09:14:02,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:02,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 41 [2025-03-03 09:14:02,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:02,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 16 [2025-03-03 09:14:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:14:03,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:14:07,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:14:07,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:14:07,533 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:14:07,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208112992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:14:07,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:14:07,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 15] total 49 [2025-03-03 09:14:07,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38459071] [2025-03-03 09:14:07,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:14:07,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-03 09:14:07,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:07,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-03 09:14:07,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2132, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 09:14:07,535 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:09,201 INFO L93 Difference]: Finished difference Result 127 states and 145 transitions. [2025-03-03 09:14:09,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-03 09:14:09,201 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-03 09:14:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:09,202 INFO L225 Difference]: With dead ends: 127 [2025-03-03 09:14:09,202 INFO L226 Difference]: Without dead ends: 118 [2025-03-03 09:14:09,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1977 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1056, Invalid=6776, Unknown=0, NotChecked=0, Total=7832 [2025-03-03 09:14:09,204 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 534 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:14:09,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 253 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:14:09,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-03 09:14:09,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 57. [2025-03-03 09:14:09,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2025-03-03 09:14:09,209 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 51 [2025-03-03 09:14:09,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:09,209 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2025-03-03 09:14:09,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2025-03-03 09:14:09,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 09:14:09,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:09,210 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:14:09,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 09:14:09,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:09,411 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:09,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:09,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1328330238, now seen corresponding path program 7 times [2025-03-03 09:14:09,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:09,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932324112] [2025-03-03 09:14:09,411 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:14:09,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:09,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 09:14:09,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 09:14:09,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:14:09,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:14:10,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:10,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932324112] [2025-03-03 09:14:10,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932324112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:14:10,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313408396] [2025-03-03 09:14:10,011 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:14:10,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:10,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:14:10,013 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:14:10,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:14:10,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 09:14:10,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 09:14:10,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:14:10,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:10,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-03 09:14:10,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:14:10,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:14:10,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:14:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:14:10,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:14:10,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:14:10,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-03 09:14:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:14:10,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313408396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:14:10,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:14:10,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 14] total 39 [2025-03-03 09:14:10,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767116382] [2025-03-03 09:14:10,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:14:10,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 09:14:10,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:10,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 09:14:10,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1323, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 09:14:10,525 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 39 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 39 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:11,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:11,728 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2025-03-03 09:14:11,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-03 09:14:11,729 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 39 states have internal predecessors, (132), 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 56 [2025-03-03 09:14:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:11,729 INFO L225 Difference]: With dead ends: 95 [2025-03-03 09:14:11,730 INFO L226 Difference]: Without dead ends: 93 [2025-03-03 09:14:11,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=890, Invalid=5590, Unknown=0, NotChecked=0, Total=6480 [2025-03-03 09:14:11,731 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 181 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:14:11,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 237 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:14:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-03 09:14:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 62. [2025-03-03 09:14:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2025-03-03 09:14:11,737 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 56 [2025-03-03 09:14:11,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:11,738 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2025-03-03 09:14:11,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 39 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2025-03-03 09:14:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 09:14:11,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:11,738 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:14:11,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 09:14:11,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 09:14:11,941 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:11,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash 219523887, now seen corresponding path program 8 times [2025-03-03 09:14:11,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:11,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56150919] [2025-03-03 09:14:11,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:14:11,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:11,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-03 09:14:11,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 09:14:11,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:14:11,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:12,229 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 73 proven. 38 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:14:12,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:12,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56150919] [2025-03-03 09:14:12,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56150919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:14:12,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961004986] [2025-03-03 09:14:12,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:14:12,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:12,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:14:12,231 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:14:12,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:14:12,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-03 09:14:12,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 09:14:12,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:14:12,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:12,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 09:14:12,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:14:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 99 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:14:12,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:14:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 99 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:14:12,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961004986] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:14:12,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:14:12,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 41 [2025-03-03 09:14:12,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314962220] [2025-03-03 09:14:12,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:14:12,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-03 09:14:12,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:12,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-03 09:14:12,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=1248, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 09:14:12,924 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 41 states, 41 states have (on average 3.731707317073171) internal successors, (153), 41 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:13,199 INFO L93 Difference]: Finished difference Result 152 states and 169 transitions. [2025-03-03 09:14:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 09:14:13,199 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.731707317073171) internal successors, (153), 41 states have internal predecessors, (153), 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 61 [2025-03-03 09:14:13,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:13,200 INFO L225 Difference]: With dead ends: 152 [2025-03-03 09:14:13,200 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 09:14:13,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=565, Invalid=1691, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 09:14:13,201 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 152 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:14:13,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 203 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:14:13,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 09:14:13,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2025-03-03 09:14:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:13,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2025-03-03 09:14:13,214 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 61 [2025-03-03 09:14:13,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:13,215 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2025-03-03 09:14:13,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.731707317073171) internal successors, (153), 41 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2025-03-03 09:14:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 09:14:13,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:13,216 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:14:13,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 09:14:13,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:14:13,417 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:13,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:13,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1527940655, now seen corresponding path program 9 times [2025-03-03 09:14:13,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:13,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712452900] [2025-03-03 09:14:13,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:14:13,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:13,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 7 equivalence classes. [2025-03-03 09:14:13,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 09:14:13,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 09:14:13,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 15 proven. 119 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:14:14,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:14,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712452900] [2025-03-03 09:14:14,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712452900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:14:14,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434756095] [2025-03-03 09:14:14,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:14:14,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:14,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:14:14,383 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:14:14,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:14:14,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 7 equivalence classes. [2025-03-03 09:14:14,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 09:14:14,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 09:14:14,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:14,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-03 09:14:14,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:14:14,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:14:14,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:14,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2025-03-03 09:14:14,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:14:14,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:14,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-03 09:14:14,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:14,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:14:14,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:14,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 31 [2025-03-03 09:14:14,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:14,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-03 09:14:15,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:15,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 41 [2025-03-03 09:14:15,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:15,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2025-03-03 09:14:15,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:15,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 51 [2025-03-03 09:14:15,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:15,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 43 treesize of output 19 [2025-03-03 09:14:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 12 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:14:15,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:14:41,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:14:41,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:14:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 12 proven. 130 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:14:42,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434756095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:14:42,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:14:42,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25, 19] total 60 [2025-03-03 09:14:42,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686752832] [2025-03-03 09:14:42,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:14:42,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-03-03 09:14:42,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:42,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-03-03 09:14:42,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=3280, Unknown=1, NotChecked=0, Total=3540 [2025-03-03 09:14:42,164 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 60 states, 60 states have (on average 3.066666666666667) internal successors, (184), 60 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:47,116 INFO L93 Difference]: Finished difference Result 203 states and 230 transitions. [2025-03-03 09:14:47,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-03 09:14:47,116 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 3.066666666666667) internal successors, (184), 60 states have internal predecessors, (184), 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 67 [2025-03-03 09:14:47,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:47,117 INFO L225 Difference]: With dead ends: 203 [2025-03-03 09:14:47,117 INFO L226 Difference]: Without dead ends: 194 [2025-03-03 09:14:47,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 96 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6377 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=2516, Invalid=21045, Unknown=1, NotChecked=0, Total=23562 [2025-03-03 09:14:47,121 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 811 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 2152 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 2152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:14:47,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 550 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 2152 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 09:14:47,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-03 09:14:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 73. [2025-03-03 09:14:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2025-03-03 09:14:47,132 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 67 [2025-03-03 09:14:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:47,132 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2025-03-03 09:14:47,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 3.066666666666667) internal successors, (184), 60 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2025-03-03 09:14:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 09:14:47,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:47,133 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:14:47,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 09:14:47,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 09:14:47,334 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:47,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2144092001, now seen corresponding path program 10 times [2025-03-03 09:14:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:47,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791539044] [2025-03-03 09:14:47,334 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:14:47,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:47,346 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 72 statements into 2 equivalence classes. [2025-03-03 09:14:47,357 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 69 of 72 statements. [2025-03-03 09:14:47,357 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:14:47,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:48,002 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:14:48,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:48,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791539044] [2025-03-03 09:14:48,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791539044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:14:48,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813077631] [2025-03-03 09:14:48,003 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:14:48,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:48,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:14:48,005 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:14:48,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:14:48,060 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 72 statements into 2 equivalence classes. [2025-03-03 09:14:48,078 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 69 of 72 statements. [2025-03-03 09:14:48,078 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:14:48,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:48,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-03 09:14:48,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:14:48,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-03 09:14:48,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-03 09:14:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:14:48,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:14:48,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:14:48,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-03 09:14:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:14:48,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813077631] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:14:48,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:14:48,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17, 17] total 35 [2025-03-03 09:14:48,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148424155] [2025-03-03 09:14:48,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:14:48,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 09:14:48,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:48,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 09:14:48,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 09:14:48,440 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 35 states, 35 states have (on average 3.8285714285714287) internal successors, (134), 35 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:50,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:50,321 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2025-03-03 09:14:50,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-03-03 09:14:50,321 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.8285714285714287) internal successors, (134), 35 states have internal predecessors, (134), 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 72 [2025-03-03 09:14:50,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:50,322 INFO L225 Difference]: With dead ends: 156 [2025-03-03 09:14:50,322 INFO L226 Difference]: Without dead ends: 154 [2025-03-03 09:14:50,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2934 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1120, Invalid=9182, Unknown=0, NotChecked=0, Total=10302 [2025-03-03 09:14:50,323 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 288 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:14:50,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 339 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:14:50,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-03 09:14:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 78. [2025-03-03 09:14:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.103896103896104) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2025-03-03 09:14:50,333 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 72 [2025-03-03 09:14:50,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:50,333 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2025-03-03 09:14:50,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.8285714285714287) internal successors, (134), 35 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2025-03-03 09:14:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 09:14:50,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:50,334 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:14:50,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 09:14:50,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:14:50,534 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:50,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:50,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1952375506, now seen corresponding path program 11 times [2025-03-03 09:14:50,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:50,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860231466] [2025-03-03 09:14:50,535 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:14:50,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:50,544 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 77 statements into 9 equivalence classes. [2025-03-03 09:14:50,557 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 09:14:50,558 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-03 09:14:50,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 172 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:14:50,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:50,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860231466] [2025-03-03 09:14:50,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860231466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:14:50,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433198962] [2025-03-03 09:14:50,916 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:14:50,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:50,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:14:50,918 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:14:50,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:14:50,975 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 77 statements into 9 equivalence classes. [2025-03-03 09:14:51,185 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 09:14:51,186 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-03 09:14:51,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:51,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 09:14:51,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:14:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 172 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:14:51,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:14:51,989 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 172 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:14:51,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433198962] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:14:51,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:14:51,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 50 [2025-03-03 09:14:51,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263719609] [2025-03-03 09:14:51,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:14:51,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-03 09:14:51,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:51,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-03 09:14:51,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=580, Invalid=1870, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 09:14:51,991 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 50 states, 50 states have (on average 3.84) internal successors, (192), 50 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:52,347 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2025-03-03 09:14:52,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 09:14:52,348 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.84) internal successors, (192), 50 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 09:14:52,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:52,349 INFO L225 Difference]: With dead ends: 191 [2025-03-03 09:14:52,349 INFO L226 Difference]: Without dead ends: 88 [2025-03-03 09:14:52,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=916, Invalid=2744, Unknown=0, NotChecked=0, Total=3660 [2025-03-03 09:14:52,350 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 264 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:14:52,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 272 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:14:52,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-03 09:14:52,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2025-03-03 09:14:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.0963855421686748) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:52,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2025-03-03 09:14:52,368 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 77 [2025-03-03 09:14:52,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:52,368 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2025-03-03 09:14:52,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.84) internal successors, (192), 50 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:14:52,369 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2025-03-03 09:14:52,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 09:14:52,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:52,369 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:14:52,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-03 09:14:52,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 09:14:52,570 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:52,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:52,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1156318738, now seen corresponding path program 12 times [2025-03-03 09:14:52,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:52,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073072882] [2025-03-03 09:14:52,570 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:14:52,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:52,579 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 83 statements into 9 equivalence classes. [2025-03-03 09:14:52,604 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 09:14:52,604 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-03 09:14:52,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:53,849 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 16 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:14:53,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:53,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073072882] [2025-03-03 09:14:53,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073072882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:14:53,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673138017] [2025-03-03 09:14:53,849 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:14:53,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:53,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:14:53,851 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:14:53,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:14:53,912 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 83 statements into 9 equivalence classes. [2025-03-03 09:14:54,205 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 09:14:54,206 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-03 09:14:54,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:54,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-03 09:14:54,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:14:54,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-03 09:14:54,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:54,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2025-03-03 09:14:54,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-03 09:14:54,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:14:54,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:54,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2025-03-03 09:14:54,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:54,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-03 09:14:54,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:14:54,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:54,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 35 [2025-03-03 09:14:54,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:54,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2025-03-03 09:14:54,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:14:54,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:54,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 45 [2025-03-03 09:14:55,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:55,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 52 [2025-03-03 09:14:55,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:14:55,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:55,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 55 [2025-03-03 09:14:55,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:55,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 62 [2025-03-03 09:14:55,303 INFO L349 Elim1Store]: treesize reduction 20, result has 54.5 percent of original size [2025-03-03 09:14:55,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 73 treesize of output 84 [2025-03-03 09:14:56,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:56,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 22 [2025-03-03 09:14:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 42 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:14:56,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:15:03,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:15:03,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:15:04,136 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 38 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:15:04,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673138017] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:15:04,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:15:04,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32, 26] total 82 [2025-03-03 09:15:04,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134220304] [2025-03-03 09:15:04,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:15:04,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2025-03-03 09:15:04,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:15:04,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2025-03-03 09:15:04,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=6060, Unknown=0, NotChecked=0, Total=6642 [2025-03-03 09:15:04,138 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 82 states, 82 states have (on average 2.8902439024390243) internal successors, (237), 82 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:15:20,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:15:20,682 INFO L93 Difference]: Finished difference Result 527 states and 587 transitions. [2025-03-03 09:15:20,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2025-03-03 09:15:20,682 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 2.8902439024390243) internal successors, (237), 82 states have internal predecessors, (237), 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 83 [2025-03-03 09:15:20,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:15:20,684 INFO L225 Difference]: With dead ends: 527 [2025-03-03 09:15:20,684 INFO L226 Difference]: Without dead ends: 478 [2025-03-03 09:15:20,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 114 SyntacticMatches, 5 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25620 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=8041, Invalid=71201, Unknown=0, NotChecked=0, Total=79242 [2025-03-03 09:15:20,688 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 2829 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 3695 mSolverCounterSat, 737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2829 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 4432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 737 IncrementalHoareTripleChecker+Valid, 3695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:15:20,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2829 Valid, 995 Invalid, 4432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [737 Valid, 3695 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 09:15:20,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-03 09:15:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 194. [2025-03-03 09:15:20,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.1295336787564767) internal successors, (218), 193 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:15:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 218 transitions. [2025-03-03 09:15:20,725 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 218 transitions. Word has length 83 [2025-03-03 09:15:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:15:20,725 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 218 transitions. [2025-03-03 09:15:20,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 2.8902439024390243) internal successors, (237), 82 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:15:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 218 transitions. [2025-03-03 09:15:20,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 09:15:20,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:15:20,725 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:15:20,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 09:15:20,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 09:15:20,926 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:15:20,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:15:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2081410112, now seen corresponding path program 13 times [2025-03-03 09:15:20,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:15:20,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515451239] [2025-03-03 09:15:20,927 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:15:20,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:15:20,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 09:15:20,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 09:15:20,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:15:20,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:15:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:15:21,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:15:21,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515451239] [2025-03-03 09:15:21,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515451239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:15:21,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58516808] [2025-03-03 09:15:21,820 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:15:21,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:15:21,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:15:21,821 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:15:21,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 09:15:21,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 09:15:21,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 09:15:21,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:15:21,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:15:21,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-03 09:15:21,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:15:22,083 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 09:15:22,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:15:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 285 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:15:22,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:15:22,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:15:22,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-03 09:15:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 251 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 09:15:22,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58516808] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:15:22,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:15:22,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23, 22] total 59 [2025-03-03 09:15:22,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395525240] [2025-03-03 09:15:22,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:15:22,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-03 09:15:22,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:15:22,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-03 09:15:22,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=3155, Unknown=0, NotChecked=0, Total=3422 [2025-03-03 09:15:22,913 INFO L87 Difference]: Start difference. First operand 194 states and 218 transitions. Second operand has 59 states, 59 states have (on average 3.4237288135593222) internal successors, (202), 59 states have internal predecessors, (202), 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)