./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/pr3.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/pr3.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 73efddcda095c52d9900d13088d1ec70520de6007541f46343a568e878cf2ed4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:16:08,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:16:08,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:16:08,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:16:08,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:16:08,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:16:08,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:16:08,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:16:08,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:16:08,907 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:16:08,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:16:08,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:16:08,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:16:08,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:16:08,908 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:16:08,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:16:08,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:16:08,909 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:16:08,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:16:08,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:16:08,910 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:16:08,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:16:08,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:16:08,911 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 -> 73efddcda095c52d9900d13088d1ec70520de6007541f46343a568e878cf2ed4 [2025-03-03 09:16:09,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:16:09,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:16:09,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:16:09,152 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:16:09,152 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:16:09,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pr3.c [2025-03-03 09:16:10,342 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc4d8a40b/a8500fd8a611455882fed48faa9eab28/FLAGd228a0a5a [2025-03-03 09:16:10,544 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:16:10,544 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pr3.c [2025-03-03 09:16:10,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc4d8a40b/a8500fd8a611455882fed48faa9eab28/FLAGd228a0a5a [2025-03-03 09:16:10,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc4d8a40b/a8500fd8a611455882fed48faa9eab28 [2025-03-03 09:16:10,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:16:10,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:16:10,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:16:10,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:16:10,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:16:10,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:16:10" (1/1) ... [2025-03-03 09:16:10,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2f9394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:10, skipping insertion in model container [2025-03-03 09:16:10,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:16:10" (1/1) ... [2025-03-03 09:16:10,575 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:16:10,663 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/pr3.c[394,407] [2025-03-03 09:16:10,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:16:10,684 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:16:10,691 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/pr3.c[394,407] [2025-03-03 09:16:10,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:16:10,712 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:16:10,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:10 WrapperNode [2025-03-03 09:16:10,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:16:10,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:16:10,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:16:10,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:16:10,718 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:16:10" (1/1) ... [2025-03-03 09:16:10,721 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:16:10" (1/1) ... [2025-03-03 09:16:10,734 INFO L138 Inliner]: procedures = 15, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2025-03-03 09:16:10,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:16:10,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:16:10,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:16:10,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:16:10,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:10" (1/1) ... [2025-03-03 09:16:10,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:10" (1/1) ... [2025-03-03 09:16:10,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:10" (1/1) ... [2025-03-03 09:16:10,756 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 6, 8]. 50 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-03-03 09:16:10,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:10" (1/1) ... [2025-03-03 09:16:10,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:10" (1/1) ... [2025-03-03 09:16:10,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:10" (1/1) ... [2025-03-03 09:16:10,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:10" (1/1) ... [2025-03-03 09:16:10,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:10" (1/1) ... [2025-03-03 09:16:10,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:10" (1/1) ... [2025-03-03 09:16:10,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:16:10,764 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:16:10,764 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:16:10,764 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:16:10,765 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:10" (1/1) ... [2025-03-03 09:16:10,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:16:10,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:10,787 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:16:10,789 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:16:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:16:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:16:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:16:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:16:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:16:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:16:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:16:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:16:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:16:10,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:16:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:16:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:16:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:16:10,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:16:10,861 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:16:10,863 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:16:10,991 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 09:16:10,991 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:16:10,998 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:16:10,998 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:16:10,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:16:10 BoogieIcfgContainer [2025-03-03 09:16:10,998 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:16:11,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:16:11,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:16:11,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:16:11,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:16:10" (1/3) ... [2025-03-03 09:16:11,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485d821e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:16:11, skipping insertion in model container [2025-03-03 09:16:11,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:16:10" (2/3) ... [2025-03-03 09:16:11,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485d821e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:16:11, skipping insertion in model container [2025-03-03 09:16:11,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:16:10" (3/3) ... [2025-03-03 09:16:11,007 INFO L128 eAbstractionObserver]: Analyzing ICFG pr3.c [2025-03-03 09:16:11,018 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:16:11,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pr3.c that has 1 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 09:16:11,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:16:11,074 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;@74949827, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:16:11,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:16:11,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 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:16:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 09:16:11,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:11,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:11,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:11,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:11,085 INFO L85 PathProgramCache]: Analyzing trace with hash -314807109, now seen corresponding path program 1 times [2025-03-03 09:16:11,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:11,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730925800] [2025-03-03 09:16:11,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:11,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:11,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 09:16:11,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 09:16:11,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:11,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:11,193 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:16:11,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:11,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730925800] [2025-03-03 09:16:11,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730925800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:16:11,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:16:11,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:16:11,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341672740] [2025-03-03 09:16:11,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:16:11,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:16:11,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:11,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:16:11,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:16:11,216 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 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.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:11,223 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2025-03-03 09:16:11,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:16:11,225 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-03 09:16:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:11,229 INFO L225 Difference]: With dead ends: 39 [2025-03-03 09:16:11,229 INFO L226 Difference]: Without dead ends: 18 [2025-03-03 09:16:11,230 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:16:11,232 INFO L435 NwaCegarLoop]: 29 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, 29 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:16:11,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:16:11,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-03 09:16:11,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-03 09:16:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2025-03-03 09:16:11,251 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 12 [2025-03-03 09:16:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:11,251 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-03-03 09:16:11,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2025-03-03 09:16:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 09:16:11,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:11,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:11,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:16:11,252 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:11,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:11,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1428003226, now seen corresponding path program 1 times [2025-03-03 09:16:11,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:11,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127357861] [2025-03-03 09:16:11,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:11,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:11,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 09:16:11,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 09:16:11,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:11,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:11,533 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:16:11,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:11,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127357861] [2025-03-03 09:16:11,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127357861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:16:11,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:16:11,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:16:11,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147529187] [2025-03-03 09:16:11,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:16:11,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:16:11,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:11,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:16:11,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:16:11,536 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:11,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:11,593 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2025-03-03 09:16:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:16:11,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-03 09:16:11,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:11,594 INFO L225 Difference]: With dead ends: 30 [2025-03-03 09:16:11,594 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 09:16:11,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:16:11,595 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:11,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 18 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:16:11,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 09:16:11,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2025-03-03 09:16:11,599 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:16:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-03-03 09:16:11,600 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2025-03-03 09:16:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:11,601 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-03 09:16:11,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2025-03-03 09:16:11,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:16:11,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:11,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:11,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:16:11,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:11,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:11,605 INFO L85 PathProgramCache]: Analyzing trace with hash 710843185, now seen corresponding path program 1 times [2025-03-03 09:16:11,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:11,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098107415] [2025-03-03 09:16:11,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:11,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:11,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:16:11,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:16:11,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:11,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:12,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:12,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098107415] [2025-03-03 09:16:12,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098107415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:12,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11886992] [2025-03-03 09:16:12,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:12,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:12,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:12,143 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:16:12,144 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:16:12,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:16:12,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:16:12,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:12,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:12,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 09:16:12,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:12,272 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:16:12,303 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:16:12,320 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:16:12,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:16:12,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:12,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:12,460 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:16:12,463 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 14 [2025-03-03 09:16:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:12,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11886992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:12,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:12,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 18 [2025-03-03 09:16:12,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415125659] [2025-03-03 09:16:12,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:12,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:16:12,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:12,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:16:12,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:16:12,481 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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:16:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:12,924 INFO L93 Difference]: Finished difference Result 91 states and 116 transitions. [2025-03-03 09:16:12,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 09:16:12,925 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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) Word has length 17 [2025-03-03 09:16:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:12,926 INFO L225 Difference]: With dead ends: 91 [2025-03-03 09:16:12,926 INFO L226 Difference]: Without dead ends: 84 [2025-03-03 09:16:12,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=851, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 09:16:12,928 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 251 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:12,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 85 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:16:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-03 09:16:12,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 26. [2025-03-03 09:16:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-03-03 09:16:12,934 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 17 [2025-03-03 09:16:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:12,934 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-03-03 09:16:12,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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:16:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-03-03 09:16:12,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:16:12,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:12,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:12,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:16:13,135 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:16:13,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:13,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:13,136 INFO L85 PathProgramCache]: Analyzing trace with hash 710872976, now seen corresponding path program 1 times [2025-03-03 09:16:13,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:13,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54992351] [2025-03-03 09:16:13,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:13,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:13,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:16:13,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:16:13,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:13,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:16:13,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:13,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54992351] [2025-03-03 09:16:13,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54992351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:16:13,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:16:13,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:16:13,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593113651] [2025-03-03 09:16:13,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:16:13,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:16:13,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:13,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:16:13,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:16:13,185 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:13,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:13,198 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2025-03-03 09:16:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:16:13,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-03 09:16:13,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:13,199 INFO L225 Difference]: With dead ends: 30 [2025-03-03 09:16:13,200 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 09:16:13,200 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:16:13,201 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:16:13,201 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:16:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 09:16:13,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-03 09:16:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-03-03 09:16:13,206 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 17 [2025-03-03 09:16:13,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:13,206 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-03-03 09:16:13,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:13,206 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-03-03 09:16:13,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:16:13,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:13,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:13,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:16:13,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:13,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:13,207 INFO L85 PathProgramCache]: Analyzing trace with hash 514329680, now seen corresponding path program 1 times [2025-03-03 09:16:13,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:13,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971276368] [2025-03-03 09:16:13,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:13,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:13,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:16:13,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:16:13,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:13,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:13,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:13,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:13,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971276368] [2025-03-03 09:16:13,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971276368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:16:13,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:16:13,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:16:13,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968196345] [2025-03-03 09:16:13,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:16:13,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:16:13,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:13,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:16:13,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:16:13,278 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:13,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:13,312 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2025-03-03 09:16:13,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:16:13,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-03 09:16:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:13,314 INFO L225 Difference]: With dead ends: 51 [2025-03-03 09:16:13,314 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 09:16:13,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:16:13,315 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 34 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:13,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 41 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:16:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 09:16:13,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2025-03-03 09:16:13,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-03-03 09:16:13,322 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2025-03-03 09:16:13,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:13,323 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-03-03 09:16:13,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2025-03-03 09:16:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:16:13,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:13,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:13,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:16:13,324 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:13,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:13,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1293124783, now seen corresponding path program 1 times [2025-03-03 09:16:13,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:13,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710121489] [2025-03-03 09:16:13,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:13,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:13,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:16:13,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:16:13,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:13,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:13,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:13,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710121489] [2025-03-03 09:16:13,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710121489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:13,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316200201] [2025-03-03 09:16:13,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:13,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:13,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:13,594 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:16:13,596 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:16:13,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:16:13,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:16:13,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:13,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:13,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 09:16:13,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:13,664 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:16:13,673 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:16:13,685 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:16:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:13,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:13,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-03 09:16:13,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-03 09:16:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:13,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316200201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:13,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:13,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 13 [2025-03-03 09:16:13,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896845722] [2025-03-03 09:16:13,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:13,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:16:13,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:13,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:16:13,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:16:13,780 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 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:16:13,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:13,996 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2025-03-03 09:16:13,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 09:16:13,997 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-03 09:16:13,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:13,997 INFO L225 Difference]: With dead ends: 69 [2025-03-03 09:16:13,997 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 09:16:13,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:16:13,998 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 69 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:13,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 108 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:16:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 09:16:14,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 36. [2025-03-03 09:16:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:14,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-03 09:16:14,003 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 17 [2025-03-03 09:16:14,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:14,003 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-03 09:16:14,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 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:16:14,004 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-03 09:16:14,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 09:16:14,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:14,004 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:14,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:16:14,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 09:16:14,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:14,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:14,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1261445094, now seen corresponding path program 1 times [2025-03-03 09:16:14,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:14,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321173431] [2025-03-03 09:16:14,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:14,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:14,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 09:16:14,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:16:14,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:14,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:14,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:14,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:14,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321173431] [2025-03-03 09:16:14,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321173431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:16:14,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:16:14,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:16:14,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613228245] [2025-03-03 09:16:14,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:16:14,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:16:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:14,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:16:14,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:16:14,246 INFO L87 Difference]: Start difference. First operand 36 states and 49 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:16:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:14,266 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2025-03-03 09:16:14,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:16:14,266 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 22 [2025-03-03 09:16:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:14,267 INFO L225 Difference]: With dead ends: 59 [2025-03-03 09:16:14,267 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 09:16:14,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:16:14,268 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:14,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:16:14,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 09:16:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2025-03-03 09:16:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 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:16:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2025-03-03 09:16:14,278 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 22 [2025-03-03 09:16:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:14,279 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2025-03-03 09:16:14,279 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:16:14,279 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2025-03-03 09:16:14,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 09:16:14,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:14,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] [2025-03-03 09:16:14,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 09:16:14,280 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:14,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:14,280 INFO L85 PathProgramCache]: Analyzing trace with hash 966163677, now seen corresponding path program 1 times [2025-03-03 09:16:14,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:14,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933022309] [2025-03-03 09:16:14,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:14,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:14,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 09:16:14,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:16:14,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:14,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:14,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:14,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933022309] [2025-03-03 09:16:14,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933022309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:14,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598920853] [2025-03-03 09:16:14,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:14,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:14,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:14,608 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:16:14,609 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:16:14,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 09:16:14,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:16:14,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:14,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:14,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 09:16:14,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:14,698 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:16:14,730 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:16:14,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:16:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:14,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:14,852 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:16:14,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2025-03-03 09:16:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:14,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598920853] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:14,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:14,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 19 [2025-03-03 09:16:14,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569110457] [2025-03-03 09:16:14,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:14,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 09:16:14,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:14,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 09:16:14,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:16:14,868 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:15,156 INFO L93 Difference]: Finished difference Result 102 states and 134 transitions. [2025-03-03 09:16:15,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 09:16:15,156 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-03 09:16:15,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:15,156 INFO L225 Difference]: With dead ends: 102 [2025-03-03 09:16:15,156 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 09:16:15,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:16:15,157 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 81 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:15,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 106 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:16:15,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 09:16:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 47. [2025-03-03 09:16:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2025-03-03 09:16:15,163 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 22 [2025-03-03 09:16:15,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:15,163 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2025-03-03 09:16:15,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:15,163 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2025-03-03 09:16:15,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 09:16:15,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:15,164 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] [2025-03-03 09:16:15,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 09:16:15,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:15,368 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:15,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:15,369 INFO L85 PathProgramCache]: Analyzing trace with hash 460605052, now seen corresponding path program 1 times [2025-03-03 09:16:15,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:15,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445783690] [2025-03-03 09:16:15,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:15,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:15,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 09:16:15,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:16:15,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:15,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:15,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:15,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445783690] [2025-03-03 09:16:15,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445783690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:15,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787324218] [2025-03-03 09:16:15,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:15,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:15,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:15,567 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:16:15,569 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:16:15,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 09:16:15,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:16:15,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:15,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:15,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 09:16:15,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:15,622 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:16:15,630 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:16:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:15,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:15,757 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:16:15,758 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:16:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:15,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787324218] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:15,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:15,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 19 [2025-03-03 09:16:15,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201804928] [2025-03-03 09:16:15,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:15,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 09:16:15,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:15,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 09:16:15,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:16:15,771 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:16,022 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2025-03-03 09:16:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 09:16:16,022 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-03 09:16:16,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:16,023 INFO L225 Difference]: With dead ends: 109 [2025-03-03 09:16:16,023 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 09:16:16,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2025-03-03 09:16:16,024 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 95 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:16,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 88 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:16:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 09:16:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 63. [2025-03-03 09:16:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:16,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2025-03-03 09:16:16,034 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 22 [2025-03-03 09:16:16,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:16,034 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2025-03-03 09:16:16,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:16,034 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2025-03-03 09:16:16,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 09:16:16,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:16,035 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:16,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:16:16,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:16,235 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:16,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:16,236 INFO L85 PathProgramCache]: Analyzing trace with hash -62938405, now seen corresponding path program 1 times [2025-03-03 09:16:16,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:16,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545472234] [2025-03-03 09:16:16,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:16,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:16,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 09:16:16,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:16:16,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:16,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:16,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:16,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545472234] [2025-03-03 09:16:16,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545472234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:16:16,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:16:16,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:16:16,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147127228] [2025-03-03 09:16:16,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:16:16,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:16:16,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:16,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:16:16,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:16:16,256 INFO L87 Difference]: Start difference. First operand 63 states and 83 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:16:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:16,272 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2025-03-03 09:16:16,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:16:16,272 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 22 [2025-03-03 09:16:16,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:16,273 INFO L225 Difference]: With dead ends: 91 [2025-03-03 09:16:16,273 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 09:16:16,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:16:16,274 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:16,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 46 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:16:16,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 09:16:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2025-03-03 09:16:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2025-03-03 09:16:16,282 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 22 [2025-03-03 09:16:16,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:16,286 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-03-03 09:16:16,286 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:16:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2025-03-03 09:16:16,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 09:16:16,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:16,286 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] [2025-03-03 09:16:16,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 09:16:16,286 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:16,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:16,287 INFO L85 PathProgramCache]: Analyzing trace with hash 748996273, now seen corresponding path program 2 times [2025-03-03 09:16:16,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:16,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817832367] [2025-03-03 09:16:16,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:16,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:16,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-03 09:16:16,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:16:16,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:16,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:16,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:16,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817832367] [2025-03-03 09:16:16,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817832367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:16,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551050106] [2025-03-03 09:16:16,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:16,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:16,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:16,648 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:16:16,649 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:16:16,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-03 09:16:16,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:16:16,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:16,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:16,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 09:16:16,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:16,726 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:16:16,886 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:16,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:16,995 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:16:16,996 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:16:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:17,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551050106] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:17,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:17,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 28 [2025-03-03 09:16:17,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708596829] [2025-03-03 09:16:17,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:17,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 09:16:17,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:17,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 09:16:17,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2025-03-03 09:16:17,014 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 28 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:18,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:18,254 INFO L93 Difference]: Finished difference Result 212 states and 264 transitions. [2025-03-03 09:16:18,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-03 09:16:18,254 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 09:16:18,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:18,255 INFO L225 Difference]: With dead ends: 212 [2025-03-03 09:16:18,255 INFO L226 Difference]: Without dead ends: 173 [2025-03-03 09:16:18,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=860, Invalid=3970, Unknown=0, NotChecked=0, Total=4830 [2025-03-03 09:16:18,258 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 244 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:18,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 136 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:16:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-03 09:16:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 115. [2025-03-03 09:16:18,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.3245614035087718) internal successors, (151), 114 states have internal predecessors, (151), 0 states have call successors, (0), 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:16:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 151 transitions. [2025-03-03 09:16:18,273 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 151 transitions. Word has length 27 [2025-03-03 09:16:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:18,273 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 151 transitions. [2025-03-03 09:16:18,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 151 transitions. [2025-03-03 09:16:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 09:16:18,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:18,274 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] [2025-03-03 09:16:18,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 09:16:18,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 09:16:18,476 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:18,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:18,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1746068626, now seen corresponding path program 1 times [2025-03-03 09:16:18,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:18,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600195112] [2025-03-03 09:16:18,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:18,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:18,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 09:16:18,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:16:18,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:18,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:18,638 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:18,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:18,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600195112] [2025-03-03 09:16:18,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600195112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:18,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405875622] [2025-03-03 09:16:18,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:18,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:18,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:18,641 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:16:18,643 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:16:18,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 09:16:18,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:16:18,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:18,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:18,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 09:16:18,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:18,717 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:16:18,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:16:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:18,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:18,899 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:16:18,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2025-03-03 09:16:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:18,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405875622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:18,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:18,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 21 [2025-03-03 09:16:18,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604452015] [2025-03-03 09:16:18,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:18,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 09:16:18,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:18,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 09:16:18,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-03 09:16:18,921 INFO L87 Difference]: Start difference. First operand 115 states and 151 transitions. Second operand has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:19,396 INFO L93 Difference]: Finished difference Result 274 states and 359 transitions. [2025-03-03 09:16:19,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 09:16:19,396 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 09:16:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:19,398 INFO L225 Difference]: With dead ends: 274 [2025-03-03 09:16:19,398 INFO L226 Difference]: Without dead ends: 229 [2025-03-03 09:16:19,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=307, Invalid=1175, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 09:16:19,399 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 150 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:19,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 163 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:16:19,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-03 09:16:19,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 158. [2025-03-03 09:16:19,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.2993630573248407) internal successors, (204), 157 states have internal predecessors, (204), 0 states have call successors, (0), 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:16:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 204 transitions. [2025-03-03 09:16:19,417 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 204 transitions. Word has length 27 [2025-03-03 09:16:19,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:19,418 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 204 transitions. [2025-03-03 09:16:19,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:19,418 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 204 transitions. [2025-03-03 09:16:19,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 09:16:19,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:19,421 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:19,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 09:16:19,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:19,623 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:19,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:19,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1227223179, now seen corresponding path program 1 times [2025-03-03 09:16:19,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:19,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932692869] [2025-03-03 09:16:19,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:19,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:19,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 09:16:19,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:16:19,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:19,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:16:19,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:19,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932692869] [2025-03-03 09:16:19,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932692869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:16:19,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:16:19,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:16:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302309584] [2025-03-03 09:16:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:16:19,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:16:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:19,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:16:19,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:16:19,655 INFO L87 Difference]: Start difference. First operand 158 states and 204 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:19,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:19,676 INFO L93 Difference]: Finished difference Result 198 states and 248 transitions. [2025-03-03 09:16:19,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:16:19,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 09:16:19,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:19,677 INFO L225 Difference]: With dead ends: 198 [2025-03-03 09:16:19,677 INFO L226 Difference]: Without dead ends: 145 [2025-03-03 09:16:19,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:16:19,680 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:19,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 46 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:16:19,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-03 09:16:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 124. [2025-03-03 09:16:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.2439024390243902) internal successors, (153), 123 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:16:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 153 transitions. [2025-03-03 09:16:19,694 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 153 transitions. Word has length 27 [2025-03-03 09:16:19,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:19,694 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 153 transitions. [2025-03-03 09:16:19,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:19,694 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 153 transitions. [2025-03-03 09:16:19,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 09:16:19,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:19,695 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:19,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 09:16:19,696 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:19,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:19,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1548883940, now seen corresponding path program 2 times [2025-03-03 09:16:19,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:19,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790142572] [2025-03-03 09:16:19,696 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:19,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:19,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-03 09:16:19,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:16:19,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:19,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:19,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:19,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790142572] [2025-03-03 09:16:19,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790142572] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:19,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113294203] [2025-03-03 09:16:19,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:19,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:19,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:19,856 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:16:19,857 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:16:19,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-03 09:16:19,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:16:19,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:19,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:19,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:16:19,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:20,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:20,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113294203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:20,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:20,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2025-03-03 09:16:20,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967344844] [2025-03-03 09:16:20,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:20,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 09:16:20,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:20,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 09:16:20,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:16:20,211 INFO L87 Difference]: Start difference. First operand 124 states and 153 transitions. Second operand has 24 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 24 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:20,380 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2025-03-03 09:16:20,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:16:20,381 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 24 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-03 09:16:20,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:20,381 INFO L225 Difference]: With dead ends: 198 [2025-03-03 09:16:20,381 INFO L226 Difference]: Without dead ends: 164 [2025-03-03 09:16:20,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:16:20,382 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 109 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:20,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 85 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:16:20,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-03 09:16:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 130. [2025-03-03 09:16:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.2325581395348837) internal successors, (159), 129 states have internal predecessors, (159), 0 states have call successors, (0), 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:16:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2025-03-03 09:16:20,392 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 32 [2025-03-03 09:16:20,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:20,392 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2025-03-03 09:16:20,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 24 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2025-03-03 09:16:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 09:16:20,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:20,393 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:20,399 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:16:20,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:20,594 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:20,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:20,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1719078350, now seen corresponding path program 1 times [2025-03-03 09:16:20,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:20,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432672226] [2025-03-03 09:16:20,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:20,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:20,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 09:16:20,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 09:16:20,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:20,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:16:20,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:20,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432672226] [2025-03-03 09:16:20,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432672226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:16:20,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:16:20,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:16:20,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168570227] [2025-03-03 09:16:20,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:16:20,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:16:20,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:20,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:16:20,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:16:20,620 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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:16:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:20,644 INFO L93 Difference]: Finished difference Result 191 states and 231 transitions. [2025-03-03 09:16:20,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:16:20,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Word has length 37 [2025-03-03 09:16:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:20,647 INFO L225 Difference]: With dead ends: 191 [2025-03-03 09:16:20,647 INFO L226 Difference]: Without dead ends: 124 [2025-03-03 09:16:20,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:16:20,648 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:20,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 37 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:16:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-03 09:16:20,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2025-03-03 09:16:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.1714285714285715) internal successors, (123), 105 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:16:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2025-03-03 09:16:20,657 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 37 [2025-03-03 09:16:20,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:20,658 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2025-03-03 09:16:20,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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:16:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2025-03-03 09:16:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 09:16:20,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:20,658 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:20,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 09:16:20,658 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:20,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:20,659 INFO L85 PathProgramCache]: Analyzing trace with hash 193618547, now seen corresponding path program 3 times [2025-03-03 09:16:20,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:20,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509877056] [2025-03-03 09:16:20,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:16:20,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:20,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-03-03 09:16:20,691 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 09:16:20,691 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:16:20,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:21,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:21,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509877056] [2025-03-03 09:16:21,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509877056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:21,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091610012] [2025-03-03 09:16:21,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:16:21,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:21,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:21,040 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:16:21,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:16:21,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-03-03 09:16:21,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 09:16:21,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:16:21,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:21,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 09:16:21,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:21,145 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 19 treesize of output 1 [2025-03-03 09:16:21,159 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:16:21,163 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:16:21,259 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 7 [2025-03-03 09:16:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:21,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:21,383 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:16:21,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2025-03-03 09:16:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:21,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091610012] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:21,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:21,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 25 [2025-03-03 09:16:21,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791926369] [2025-03-03 09:16:21,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:21,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 09:16:21,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:21,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 09:16:21,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:16:21,391 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand has 25 states, 25 states have (on average 3.56) internal successors, (89), 25 states have internal predecessors, (89), 0 states have call successors, (0), 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:16:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:22,594 INFO L93 Difference]: Finished difference Result 284 states and 323 transitions. [2025-03-03 09:16:22,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-03 09:16:22,595 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.56) internal successors, (89), 25 states have internal predecessors, (89), 0 states have call successors, (0), 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 37 [2025-03-03 09:16:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:22,595 INFO L225 Difference]: With dead ends: 284 [2025-03-03 09:16:22,595 INFO L226 Difference]: Without dead ends: 275 [2025-03-03 09:16:22,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=732, Invalid=4670, Unknown=0, NotChecked=0, Total=5402 [2025-03-03 09:16:22,598 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 179 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:22,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 227 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:16:22,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-03 09:16:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 119. [2025-03-03 09:16:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 118 states have internal predecessors, (137), 0 states have call successors, (0), 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:16:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2025-03-03 09:16:22,610 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 37 [2025-03-03 09:16:22,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:22,610 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2025-03-03 09:16:22,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.56) internal successors, (89), 25 states have internal predecessors, (89), 0 states have call successors, (0), 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:16:22,611 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2025-03-03 09:16:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 09:16:22,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:22,611 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:22,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 09:16:22,811 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,SelfDestructingSolverStorable15 [2025-03-03 09:16:22,812 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:22,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:22,812 INFO L85 PathProgramCache]: Analyzing trace with hash 103850771, now seen corresponding path program 1 times [2025-03-03 09:16:22,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:22,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447187989] [2025-03-03 09:16:22,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:22,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 09:16:22,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 09:16:22,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:22,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:23,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:23,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447187989] [2025-03-03 09:16:23,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447187989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:23,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864813939] [2025-03-03 09:16:23,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:16:23,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:23,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:23,041 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:16:23,045 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:16:23,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 09:16:23,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 09:16:23,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:23,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:23,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 09:16:23,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:23,130 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:16:23,139 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:16:23,146 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:16:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:23,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:23,301 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:16:23,302 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:16:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:23,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864813939] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:23,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:23,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 20 [2025-03-03 09:16:23,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601729299] [2025-03-03 09:16:23,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:23,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 09:16:23,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:23,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 09:16:23,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:16:23,331 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 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:16:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:23,983 INFO L93 Difference]: Finished difference Result 238 states and 271 transitions. [2025-03-03 09:16:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-03 09:16:23,983 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 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 37 [2025-03-03 09:16:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:23,984 INFO L225 Difference]: With dead ends: 238 [2025-03-03 09:16:23,984 INFO L226 Difference]: Without dead ends: 236 [2025-03-03 09:16:23,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=468, Invalid=2612, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 09:16:23,985 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 95 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:23,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 217 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:16:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-03 09:16:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 136. [2025-03-03 09:16:23,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.162962962962963) internal successors, (157), 135 states have internal predecessors, (157), 0 states have call successors, (0), 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:16:24,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 157 transitions. [2025-03-03 09:16:24,000 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 157 transitions. Word has length 37 [2025-03-03 09:16:24,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:24,000 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 157 transitions. [2025-03-03 09:16:24,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 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:16:24,000 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 157 transitions. [2025-03-03 09:16:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 09:16:24,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:24,001 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:24,007 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:16:24,201 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,SelfDestructingSolverStorable16 [2025-03-03 09:16:24,201 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:24,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:24,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1615785691, now seen corresponding path program 4 times [2025-03-03 09:16:24,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:24,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782123919] [2025-03-03 09:16:24,202 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:16:24,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:24,211 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-03 09:16:24,219 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 09:16:24,220 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:16:24,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:24,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:24,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782123919] [2025-03-03 09:16:24,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782123919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:24,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181374496] [2025-03-03 09:16:24,449 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:16:24,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:24,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:24,452 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:16:24,453 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:16:24,499 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-03 09:16:24,516 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 09:16:24,516 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:16:24,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:24,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 09:16:24,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:24,593 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:16:24,617 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:16:24,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:16:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:24,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:24,951 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:16:24,953 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:16:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:25,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181374496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:25,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:25,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 33 [2025-03-03 09:16:25,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356312161] [2025-03-03 09:16:25,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:25,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 09:16:25,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:25,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 09:16:25,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 09:16:25,026 INFO L87 Difference]: Start difference. First operand 136 states and 157 transitions. Second operand has 33 states, 33 states have (on average 3.4545454545454546) internal successors, (114), 33 states have internal predecessors, (114), 0 states have call successors, (0), 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:16:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:26,227 INFO L93 Difference]: Finished difference Result 276 states and 311 transitions. [2025-03-03 09:16:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-03 09:16:26,227 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.4545454545454546) internal successors, (114), 33 states have internal predecessors, (114), 0 states have call successors, (0), 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 42 [2025-03-03 09:16:26,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:26,228 INFO L225 Difference]: With dead ends: 276 [2025-03-03 09:16:26,229 INFO L226 Difference]: Without dead ends: 267 [2025-03-03 09:16:26,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=893, Invalid=5269, Unknown=0, NotChecked=0, Total=6162 [2025-03-03 09:16:26,231 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 246 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:26,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 244 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:16:26,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-03 09:16:26,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 139. [2025-03-03 09:16:26,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.1594202898550725) internal successors, (160), 138 states have internal predecessors, (160), 0 states have call successors, (0), 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:16:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 160 transitions. [2025-03-03 09:16:26,271 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 160 transitions. Word has length 42 [2025-03-03 09:16:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:26,271 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 160 transitions. [2025-03-03 09:16:26,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.4545454545454546) internal successors, (114), 33 states have internal predecessors, (114), 0 states have call successors, (0), 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:16:26,272 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 160 transitions. [2025-03-03 09:16:26,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 09:16:26,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:26,272 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:26,278 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:16:26,472 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,SelfDestructingSolverStorable17 [2025-03-03 09:16:26,473 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:26,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:26,473 INFO L85 PathProgramCache]: Analyzing trace with hash -116116038, now seen corresponding path program 2 times [2025-03-03 09:16:26,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:26,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678021638] [2025-03-03 09:16:26,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:26,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:26,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-03 09:16:26,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 09:16:26,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:26,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:26,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:26,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678021638] [2025-03-03 09:16:26,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678021638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:26,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341925792] [2025-03-03 09:16:26,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:26,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:26,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:26,693 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:16:26,693 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:16:26,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-03 09:16:26,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 09:16:26,756 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:26,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:26,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 09:16:26,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:26,808 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:16:26,828 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:16:27,005 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:27,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:27,079 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:16:27,080 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:16:27,086 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:27,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341925792] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:27,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:27,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 28 [2025-03-03 09:16:27,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146770521] [2025-03-03 09:16:27,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:27,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 09:16:27,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:27,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 09:16:27,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2025-03-03 09:16:27,087 INFO L87 Difference]: Start difference. First operand 139 states and 160 transitions. Second operand has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 0 states have call successors, (0), 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:16:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:28,130 INFO L93 Difference]: Finished difference Result 344 states and 392 transitions. [2025-03-03 09:16:28,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-03 09:16:28,130 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 0 states have call successors, (0), 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 42 [2025-03-03 09:16:28,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:28,131 INFO L225 Difference]: With dead ends: 344 [2025-03-03 09:16:28,131 INFO L226 Difference]: Without dead ends: 342 [2025-03-03 09:16:28,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2147 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=848, Invalid=5958, Unknown=0, NotChecked=0, Total=6806 [2025-03-03 09:16:28,133 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 156 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:28,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 227 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:16:28,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-03 09:16:28,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 161. [2025-03-03 09:16:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.15) internal successors, (184), 160 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:16:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 184 transitions. [2025-03-03 09:16:28,150 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 184 transitions. Word has length 42 [2025-03-03 09:16:28,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:28,150 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 184 transitions. [2025-03-03 09:16:28,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 states have internal predecessors, (90), 0 states have call successors, (0), 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:16:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2025-03-03 09:16:28,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 09:16:28,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:28,151 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:28,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 09:16:28,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:28,355 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:28,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:28,355 INFO L85 PathProgramCache]: Analyzing trace with hash -33954957, now seen corresponding path program 5 times [2025-03-03 09:16:28,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:28,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387616974] [2025-03-03 09:16:28,356 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:16:28,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:28,361 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 6 equivalence classes. [2025-03-03 09:16:28,370 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:16:28,371 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:16:28,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:28,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:28,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387616974] [2025-03-03 09:16:28,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387616974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:28,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225229367] [2025-03-03 09:16:28,581 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:16:28,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:28,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:28,586 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:16:28,588 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:16:28,634 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 6 equivalence classes. [2025-03-03 09:16:28,668 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:16:28,668 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:16:28,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:28,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 09:16:28,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:28,719 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:16:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:28,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:28,969 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:16:28,970 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:16:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:28,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225229367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:28,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:28,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 25 [2025-03-03 09:16:28,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48270166] [2025-03-03 09:16:28,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:28,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 09:16:28,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:28,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 09:16:28,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:16:28,979 INFO L87 Difference]: Start difference. First operand 161 states and 184 transitions. Second operand has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 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:16:30,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:30,491 INFO L93 Difference]: Finished difference Result 419 states and 475 transitions. [2025-03-03 09:16:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-03-03 09:16:30,491 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 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 47 [2025-03-03 09:16:30,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:30,493 INFO L225 Difference]: With dead ends: 419 [2025-03-03 09:16:30,493 INFO L226 Difference]: Without dead ends: 417 [2025-03-03 09:16:30,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3734 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1219, Invalid=9493, Unknown=0, NotChecked=0, Total=10712 [2025-03-03 09:16:30,495 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 135 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:30,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 378 Invalid, 2062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1884 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:16:30,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-03 09:16:30,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 152. [2025-03-03 09:16:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 151 states have internal predecessors, (173), 0 states have call successors, (0), 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:16:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 173 transitions. [2025-03-03 09:16:30,510 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 173 transitions. Word has length 47 [2025-03-03 09:16:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:30,510 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 173 transitions. [2025-03-03 09:16:30,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 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:16:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 173 transitions. [2025-03-03 09:16:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 09:16:30,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:30,510 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:30,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 09:16:30,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:30,711 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:30,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:30,711 INFO L85 PathProgramCache]: Analyzing trace with hash -327553900, now seen corresponding path program 3 times [2025-03-03 09:16:30,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:30,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131478284] [2025-03-03 09:16:30,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:16:30,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:30,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 6 equivalence classes. [2025-03-03 09:16:30,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:16:30,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 09:16:30,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 40 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:31,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:31,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131478284] [2025-03-03 09:16:31,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131478284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:31,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150750803] [2025-03-03 09:16:31,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:16:31,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:31,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:31,141 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:16:31,142 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:16:31,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 6 equivalence classes. [2025-03-03 09:16:31,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:16:31,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 09:16:31,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:31,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 09:16:31,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:31,295 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:16:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:31,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:31,643 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:16:31,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2025-03-03 09:16:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:31,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150750803] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:31,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:31,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 35 [2025-03-03 09:16:31,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347134491] [2025-03-03 09:16:31,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:31,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 09:16:31,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:31,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 09:16:31,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1074, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 09:16:31,684 INFO L87 Difference]: Start difference. First operand 152 states and 173 transitions. Second operand has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 35 states have internal predecessors, (130), 0 states have call successors, (0), 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:16:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:34,564 INFO L93 Difference]: Finished difference Result 449 states and 503 transitions. [2025-03-03 09:16:34,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-03-03 09:16:34,564 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 35 states have internal predecessors, (130), 0 states have call successors, (0), 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 47 [2025-03-03 09:16:34,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:34,565 INFO L225 Difference]: With dead ends: 449 [2025-03-03 09:16:34,565 INFO L226 Difference]: Without dead ends: 355 [2025-03-03 09:16:34,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5391 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1963, Invalid=15067, Unknown=0, NotChecked=0, Total=17030 [2025-03-03 09:16:34,570 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 320 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:34,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 398 Invalid, 2160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1876 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 09:16:34,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-03 09:16:34,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 211. [2025-03-03 09:16:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.1285714285714286) internal successors, (237), 210 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:16:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 237 transitions. [2025-03-03 09:16:34,591 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 237 transitions. Word has length 47 [2025-03-03 09:16:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:34,591 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 237 transitions. [2025-03-03 09:16:34,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 35 states have internal predecessors, (130), 0 states have call successors, (0), 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:16:34,591 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 237 transitions. [2025-03-03 09:16:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 09:16:34,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:34,591 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:34,597 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:16:34,796 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,SelfDestructingSolverStorable20 [2025-03-03 09:16:34,796 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:34,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:34,796 INFO L85 PathProgramCache]: Analyzing trace with hash 673423066, now seen corresponding path program 6 times [2025-03-03 09:16:34,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:34,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184160226] [2025-03-03 09:16:34,796 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:16:34,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:34,803 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 7 equivalence classes. [2025-03-03 09:16:34,812 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 09:16:34,813 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:16:34,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 73 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:35,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:35,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184160226] [2025-03-03 09:16:35,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184160226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:35,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778756227] [2025-03-03 09:16:35,010 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:16:35,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:35,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:35,011 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:16:35,013 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:16:35,060 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 7 equivalence classes. [2025-03-03 09:16:35,099 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 09:16:35,099 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:16:35,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:35,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 09:16:35,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 99 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:35,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 99 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:35,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778756227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:35,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:35,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 36 [2025-03-03 09:16:35,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503424987] [2025-03-03 09:16:35,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:35,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 09:16:35,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:35,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 09:16:35,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=941, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 09:16:35,577 INFO L87 Difference]: Start difference. First operand 211 states and 237 transitions. Second operand has 36 states, 36 states have (on average 3.9722222222222223) internal successors, (143), 36 states have internal predecessors, (143), 0 states have call successors, (0), 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:16:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:35,782 INFO L93 Difference]: Finished difference Result 329 states and 368 transitions. [2025-03-03 09:16:35,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 09:16:35,782 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.9722222222222223) internal successors, (143), 36 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-03 09:16:35,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:35,783 INFO L225 Difference]: With dead ends: 329 [2025-03-03 09:16:35,783 INFO L226 Difference]: Without dead ends: 250 [2025-03-03 09:16:35,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=459, Invalid=1347, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 09:16:35,787 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 216 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:35,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 151 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:16:35,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-03 09:16:35,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 226. [2025-03-03 09:16:35,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.12) internal successors, (252), 225 states have internal predecessors, (252), 0 states have call successors, (0), 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:16:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 252 transitions. [2025-03-03 09:16:35,809 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 252 transitions. Word has length 52 [2025-03-03 09:16:35,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:35,809 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 252 transitions. [2025-03-03 09:16:35,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.9722222222222223) internal successors, (143), 36 states have internal predecessors, (143), 0 states have call successors, (0), 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:16:35,809 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 252 transitions. [2025-03-03 09:16:35,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:16:35,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:35,810 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:35,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 09:16:36,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:36,010 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:36,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:36,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2064186737, now seen corresponding path program 7 times [2025-03-03 09:16:36,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:36,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110674964] [2025-03-03 09:16:36,011 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:16:36,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:36,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:16:36,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:16:36,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:36,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:36,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:36,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110674964] [2025-03-03 09:16:36,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110674964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:36,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643481936] [2025-03-03 09:16:36,371 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:16:36,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:36,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:36,373 INFO L229 MonitoredProcess]: Starting monitored process 16 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:16:36,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 09:16:36,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:16:36,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:16:36,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:16:36,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:36,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 09:16:36,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:36,542 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:16:36,568 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:16:36,577 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:16:36,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:16:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:36,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:37,034 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:16:37,035 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:16:37,129 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:37,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643481936] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:37,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:37,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 15] total 43 [2025-03-03 09:16:37,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213380285] [2025-03-03 09:16:37,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:37,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 09:16:37,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:37,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 09:16:37,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1655, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 09:16:37,130 INFO L87 Difference]: Start difference. First operand 226 states and 252 transitions. Second operand has 43 states, 43 states have (on average 3.697674418604651) internal successors, (159), 43 states have internal predecessors, (159), 0 states have call successors, (0), 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:16:41,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:41,408 INFO L93 Difference]: Finished difference Result 591 states and 651 transitions. [2025-03-03 09:16:41,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2025-03-03 09:16:41,409 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.697674418604651) internal successors, (159), 43 states have internal predecessors, (159), 0 states have call successors, (0), 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 57 [2025-03-03 09:16:41,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:41,410 INFO L225 Difference]: With dead ends: 591 [2025-03-03 09:16:41,410 INFO L226 Difference]: Without dead ends: 582 [2025-03-03 09:16:41,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9969 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2807, Invalid=29413, Unknown=0, NotChecked=0, Total=32220 [2025-03-03 09:16:41,412 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 367 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 2989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:41,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 650 Invalid, 2989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 09:16:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-03-03 09:16:41,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 224. [2025-03-03 09:16:41,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.116591928251121) internal successors, (249), 223 states have internal predecessors, (249), 0 states have call successors, (0), 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:16:41,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 249 transitions. [2025-03-03 09:16:41,438 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 249 transitions. Word has length 57 [2025-03-03 09:16:41,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:41,438 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 249 transitions. [2025-03-03 09:16:41,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.697674418604651) internal successors, (159), 43 states have internal predecessors, (159), 0 states have call successors, (0), 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:16:41,438 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 249 transitions. [2025-03-03 09:16:41,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:16:41,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:41,438 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:41,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-03 09:16:41,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:41,639 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:41,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:41,639 INFO L85 PathProgramCache]: Analyzing trace with hash -739213935, now seen corresponding path program 2 times [2025-03-03 09:16:41,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:41,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135887636] [2025-03-03 09:16:41,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:41,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:41,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-03 09:16:41,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:16:41,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:41,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:41,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:41,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135887636] [2025-03-03 09:16:41,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135887636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:41,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378783708] [2025-03-03 09:16:41,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:41,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:41,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:41,910 INFO L229 MonitoredProcess]: Starting monitored process 17 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:16:41,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 09:16:41,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-03 09:16:41,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:16:41,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:41,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:41,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-03 09:16:41,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:42,112 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:16:42,133 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:16:42,138 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:16:42,379 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:42,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:42,441 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:16:42,443 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:16:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:42,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378783708] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:42,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:42,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 15] total 32 [2025-03-03 09:16:42,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543476980] [2025-03-03 09:16:42,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:42,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 09:16:42,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:42,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 09:16:42,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:16:42,452 INFO L87 Difference]: Start difference. First operand 224 states and 249 transitions. Second operand has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 0 states have call successors, (0), 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:16:44,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:44,778 INFO L93 Difference]: Finished difference Result 508 states and 570 transitions. [2025-03-03 09:16:44,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-03-03 09:16:44,778 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 0 states have call successors, (0), 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 57 [2025-03-03 09:16:44,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:44,780 INFO L225 Difference]: With dead ends: 508 [2025-03-03 09:16:44,780 INFO L226 Difference]: Without dead ends: 506 [2025-03-03 09:16:44,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9643 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2316, Invalid=23444, Unknown=0, NotChecked=0, Total=25760 [2025-03-03 09:16:44,782 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 294 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:44,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 323 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:16:44,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-03 09:16:44,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 256. [2025-03-03 09:16:44,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.1215686274509804) internal successors, (286), 255 states have internal predecessors, (286), 0 states have call successors, (0), 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:16:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 286 transitions. [2025-03-03 09:16:44,810 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 286 transitions. Word has length 57 [2025-03-03 09:16:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:44,810 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 286 transitions. [2025-03-03 09:16:44,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 0 states have call successors, (0), 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:16:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 286 transitions. [2025-03-03 09:16:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 09:16:44,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:44,810 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:44,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-03 09:16:45,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-03 09:16:45,011 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:45,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:45,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1800372893, now seen corresponding path program 8 times [2025-03-03 09:16:45,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:45,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114348377] [2025-03-03 09:16:45,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:45,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:45,021 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-03 09:16:45,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 09:16:45,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:45,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 14 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:45,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:45,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114348377] [2025-03-03 09:16:45,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114348377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:45,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501529049] [2025-03-03 09:16:45,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:16:45,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:45,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:45,343 INFO L229 MonitoredProcess]: Starting monitored process 18 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:16:45,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 09:16:45,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-03 09:16:45,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 09:16:45,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:16:45,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:45,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 09:16:45,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:45,533 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:16:45,550 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:16:45,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:16:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 14 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:45,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:45,993 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:16:45,995 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:16:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 14 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:46,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501529049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:46,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:46,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 45 [2025-03-03 09:16:46,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927759631] [2025-03-03 09:16:46,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:46,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-03 09:16:46,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:46,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-03 09:16:46,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1821, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 09:16:46,094 INFO L87 Difference]: Start difference. First operand 256 states and 286 transitions. Second operand has 45 states, 45 states have (on average 3.8666666666666667) internal successors, (174), 45 states have internal predecessors, (174), 0 states have call successors, (0), 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:16:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:49,796 INFO L93 Difference]: Finished difference Result 543 states and 595 transitions. [2025-03-03 09:16:49,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2025-03-03 09:16:49,796 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.8666666666666667) internal successors, (174), 45 states have internal predecessors, (174), 0 states have call successors, (0), 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 62 [2025-03-03 09:16:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:49,798 INFO L225 Difference]: With dead ends: 543 [2025-03-03 09:16:49,798 INFO L226 Difference]: Without dead ends: 534 [2025-03-03 09:16:49,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6740 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2362, Invalid=21200, Unknown=0, NotChecked=0, Total=23562 [2025-03-03 09:16:49,800 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 443 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 2743 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 3120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 2743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:49,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 683 Invalid, 3120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 2743 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 09:16:49,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-03 09:16:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 244. [2025-03-03 09:16:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.123456790123457) internal successors, (273), 243 states have internal predecessors, (273), 0 states have call successors, (0), 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:16:49,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 273 transitions. [2025-03-03 09:16:49,833 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 273 transitions. Word has length 62 [2025-03-03 09:16:49,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:49,834 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 273 transitions. [2025-03-03 09:16:49,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.8666666666666667) internal successors, (174), 45 states have internal predecessors, (174), 0 states have call successors, (0), 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:16:49,834 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 273 transitions. [2025-03-03 09:16:49,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 09:16:49,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:49,834 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:49,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-03 09:16:50,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:50,035 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:50,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1024908988, now seen corresponding path program 3 times [2025-03-03 09:16:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:50,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240764915] [2025-03-03 09:16:50,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:16:50,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:50,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 8 equivalence classes. [2025-03-03 09:16:50,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 09:16:50,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-03 09:16:50,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:50,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:50,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240764915] [2025-03-03 09:16:50,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240764915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:50,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078904862] [2025-03-03 09:16:50,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:16:50,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:50,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:50,327 INFO L229 MonitoredProcess]: Starting monitored process 19 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:16:50,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 09:16:50,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 8 equivalence classes. [2025-03-03 09:16:50,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 09:16:50,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-03 09:16:50,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:50,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 09:16:50,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:50,498 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:16:50,502 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:16:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:50,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:50,774 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:16:50,775 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:16:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:50,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078904862] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:50,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:50,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 29 [2025-03-03 09:16:50,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816148351] [2025-03-03 09:16:50,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:50,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 09:16:50,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:50,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 09:16:50,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2025-03-03 09:16:50,785 INFO L87 Difference]: Start difference. First operand 244 states and 273 transitions. Second operand has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 0 states have call successors, (0), 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:16:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:16:54,364 INFO L93 Difference]: Finished difference Result 768 states and 864 transitions. [2025-03-03 09:16:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2025-03-03 09:16:54,365 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 0 states have call successors, (0), 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 62 [2025-03-03 09:16:54,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:16:54,366 INFO L225 Difference]: With dead ends: 768 [2025-03-03 09:16:54,366 INFO L226 Difference]: Without dead ends: 766 [2025-03-03 09:16:54,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20639 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2972, Invalid=46980, Unknown=0, NotChecked=0, Total=49952 [2025-03-03 09:16:54,368 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 212 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 3673 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 4129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 3673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:16:54,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 629 Invalid, 4129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 3673 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 09:16:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-03-03 09:16:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 281. [2025-03-03 09:16:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.1178571428571429) internal successors, (313), 280 states have internal predecessors, (313), 0 states have call successors, (0), 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:16:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 313 transitions. [2025-03-03 09:16:54,401 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 313 transitions. Word has length 62 [2025-03-03 09:16:54,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:16:54,401 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 313 transitions. [2025-03-03 09:16:54,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 0 states have call successors, (0), 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:16:54,402 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 313 transitions. [2025-03-03 09:16:54,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 09:16:54,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:16:54,402 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:16:54,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-03 09:16:54,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:54,603 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:16:54,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:16:54,603 INFO L85 PathProgramCache]: Analyzing trace with hash -160868111, now seen corresponding path program 9 times [2025-03-03 09:16:54,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:16:54,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163211942] [2025-03-03 09:16:54,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:16:54,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:16:54,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 9 equivalence classes. [2025-03-03 09:16:54,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 09:16:54,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-03 09:16:54,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 105 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:55,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:16:55,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163211942] [2025-03-03 09:16:55,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163211942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:16:55,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889626507] [2025-03-03 09:16:55,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:16:55,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:16:55,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:16:55,116 INFO L229 MonitoredProcess]: Starting monitored process 20 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:16:55,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 09:16:55,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 9 equivalence classes. [2025-03-03 09:16:55,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 09:16:55,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-03 09:16:55,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:16:55,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 09:16:55,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:16:55,309 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:16:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:55,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:16:55,695 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:16:55,696 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:16:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:16:55,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889626507] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:16:55,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:16:55,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 43 [2025-03-03 09:16:55,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887245094] [2025-03-03 09:16:55,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:16:55,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 09:16:55,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:16:55,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 09:16:55,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1653, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 09:16:55,707 INFO L87 Difference]: Start difference. First operand 281 states and 313 transitions. Second operand has 43 states, 43 states have (on average 4.023255813953488) internal successors, (173), 43 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:03,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:03,630 INFO L93 Difference]: Finished difference Result 911 states and 1022 transitions. [2025-03-03 09:17:03,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 284 states. [2025-03-03 09:17:03,630 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 4.023255813953488) internal successors, (173), 43 states have internal predecessors, (173), 0 states have call successors, (0), 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:17:03,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:03,632 INFO L225 Difference]: With dead ends: 911 [2025-03-03 09:17:03,632 INFO L226 Difference]: Without dead ends: 766 [2025-03-03 09:17:03,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42655 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=6969, Invalid=97037, Unknown=0, NotChecked=0, Total=104006 [2025-03-03 09:17:03,636 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 555 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 4852 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 5239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 4852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:03,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 848 Invalid, 5239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 4852 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 09:17:03,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-03-03 09:17:03,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 257. [2025-03-03 09:17:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.109375) internal successors, (284), 256 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 284 transitions. [2025-03-03 09:17:03,669 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 284 transitions. Word has length 67 [2025-03-03 09:17:03,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:03,669 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 284 transitions. [2025-03-03 09:17:03,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.023255813953488) internal successors, (173), 43 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:03,669 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 284 transitions. [2025-03-03 09:17:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 09:17:03,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:03,670 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:03,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-03 09:17:03,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:03,874 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:03,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:03,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1388243886, now seen corresponding path program 4 times [2025-03-03 09:17:03,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:03,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162715060] [2025-03-03 09:17:03,874 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:17:03,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:03,881 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-03-03 09:17:03,889 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 09:17:03,889 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:17:03,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 16 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:04,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:04,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162715060] [2025-03-03 09:17:04,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162715060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:17:04,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231580302] [2025-03-03 09:17:04,310 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:17:04,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:04,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:04,312 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:17:04,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-03 09:17:04,384 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-03-03 09:17:04,405 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 09:17:04,406 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:17:04,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:04,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 09:17:04,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:17:04,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:17:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 16 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:04,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:17:05,303 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 37 treesize of output 33 [2025-03-03 09:17:05,305 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 43 treesize of output 35 [2025-03-03 09:17:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:05,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231580302] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:17:05,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:17:05,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 49 [2025-03-03 09:17:05,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175748528] [2025-03-03 09:17:05,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:17:05,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-03 09:17:05,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:05,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-03 09:17:05,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2186, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 09:17:05,373 INFO L87 Difference]: Start difference. First operand 257 states and 284 transitions. Second operand has 49 states, 49 states have (on average 3.938775510204082) internal successors, (193), 49 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:13,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:13,833 INFO L93 Difference]: Finished difference Result 1055 states and 1162 transitions. [2025-03-03 09:17:13,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2025-03-03 09:17:13,833 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.938775510204082) internal successors, (193), 49 states have internal predecessors, (193), 0 states have call successors, (0), 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:17:13,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:13,836 INFO L225 Difference]: With dead ends: 1055 [2025-03-03 09:17:13,836 INFO L226 Difference]: Without dead ends: 1046 [2025-03-03 09:17:13,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18328 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=4642, Invalid=49880, Unknown=0, NotChecked=0, Total=54522 [2025-03-03 09:17:13,839 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1132 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 4053 mSolverCounterSat, 556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 4609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 4053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:13,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 293 Invalid, 4609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [556 Valid, 4053 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 09:17:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-03-03 09:17:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 331. [2025-03-03 09:17:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.1090909090909091) internal successors, (366), 330 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 366 transitions. [2025-03-03 09:17:13,901 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 366 transitions. Word has length 67 [2025-03-03 09:17:13,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:13,901 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 366 transitions. [2025-03-03 09:17:13,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.938775510204082) internal successors, (193), 49 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 366 transitions. [2025-03-03 09:17:13,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 09:17:13,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:13,902 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:13,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-03 09:17:14,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-03 09:17:14,102 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:14,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:14,102 INFO L85 PathProgramCache]: Analyzing trace with hash -425226148, now seen corresponding path program 5 times [2025-03-03 09:17:14,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:14,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869223020] [2025-03-03 09:17:14,103 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:17:14,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:14,111 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 72 statements into 10 equivalence classes. [2025-03-03 09:17:14,121 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 09:17:14,122 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-03 09:17:14,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 216 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:14,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:14,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869223020] [2025-03-03 09:17:14,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869223020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:17:14,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153169509] [2025-03-03 09:17:14,393 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:17:14,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:14,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:14,395 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:17:14,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-03 09:17:14,472 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 72 statements into 10 equivalence classes. [2025-03-03 09:17:14,546 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 09:17:14,546 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-03 09:17:14,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:14,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 09:17:14,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:17:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 216 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:14,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:17:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 216 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:15,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153169509] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:17:15,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:17:15,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 48 [2025-03-03 09:17:15,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089273352] [2025-03-03 09:17:15,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:17:15,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-03 09:17:15,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:15,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-03 09:17:15,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=569, Invalid=1687, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 09:17:15,248 INFO L87 Difference]: Start difference. First operand 331 states and 366 transitions. Second operand has 48 states, 48 states have (on average 4.229166666666667) internal successors, (203), 48 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:15,511 INFO L93 Difference]: Finished difference Result 494 states and 541 transitions. [2025-03-03 09:17:15,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 09:17:15,512 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.229166666666667) internal successors, (203), 48 states have internal predecessors, (203), 0 states have call successors, (0), 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:17:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:15,513 INFO L225 Difference]: With dead ends: 494 [2025-03-03 09:17:15,513 INFO L226 Difference]: Without dead ends: 370 [2025-03-03 09:17:15,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=708, Invalid=2154, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 09:17:15,514 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 264 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:15,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 229 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:17:15,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-03 09:17:15,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 346. [2025-03-03 09:17:15,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.1043478260869566) internal successors, (381), 345 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 381 transitions. [2025-03-03 09:17:15,563 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 381 transitions. Word has length 72 [2025-03-03 09:17:15,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:15,563 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 381 transitions. [2025-03-03 09:17:15,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.229166666666667) internal successors, (203), 48 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:15,563 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 381 transitions. [2025-03-03 09:17:15,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 09:17:15,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:15,564 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:15,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-03 09:17:15,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 09:17:15,768 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:15,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:15,768 INFO L85 PathProgramCache]: Analyzing trace with hash 568005939, now seen corresponding path program 10 times [2025-03-03 09:17:15,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:15,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534797289] [2025-03-03 09:17:15,769 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:17:15,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:15,776 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 77 statements into 2 equivalence classes. [2025-03-03 09:17:15,782 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 09:17:15,783 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:17:15,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:16,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:16,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534797289] [2025-03-03 09:17:16,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534797289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:17:16,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451102561] [2025-03-03 09:17:16,175 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:17:16,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:16,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:16,177 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:17:16,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-03 09:17:16,252 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 77 statements into 2 equivalence classes. [2025-03-03 09:17:16,274 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 09:17:16,274 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:17:16,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:16,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-03 09:17:16,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:17:16,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:17:16,474 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:17:16,481 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:17:16,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:17:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:16,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:17:17,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:17:17,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:17:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:17,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451102561] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:17:17,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:17:17,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 19] total 55 [2025-03-03 09:17:17,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581272298] [2025-03-03 09:17:17,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:17:17,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-03 09:17:17,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:17,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-03 09:17:17,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2777, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 09:17:17,261 INFO L87 Difference]: Start difference. First operand 346 states and 381 transitions. Second operand has 55 states, 55 states have (on average 3.981818181818182) internal successors, (219), 55 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:28,886 INFO L93 Difference]: Finished difference Result 1074 states and 1166 transitions. [2025-03-03 09:17:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 286 states. [2025-03-03 09:17:28,886 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.981818181818182) internal successors, (219), 55 states have internal predecessors, (219), 0 states have call successors, (0), 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:17:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:28,888 INFO L225 Difference]: With dead ends: 1074 [2025-03-03 09:17:28,888 INFO L226 Difference]: Without dead ends: 1065 [2025-03-03 09:17:28,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41798 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=6572, Invalid=108010, Unknown=0, NotChecked=0, Total=114582 [2025-03-03 09:17:28,892 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 571 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 6452 mSolverCounterSat, 662 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 7114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 662 IncrementalHoareTripleChecker+Valid, 6452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:28,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 1502 Invalid, 7114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [662 Valid, 6452 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 09:17:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-03-03 09:17:28,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 329. [2025-03-03 09:17:28,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.100609756097561) internal successors, (361), 328 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:28,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 361 transitions. [2025-03-03 09:17:28,942 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 361 transitions. Word has length 77 [2025-03-03 09:17:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:28,942 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 361 transitions. [2025-03-03 09:17:28,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.981818181818182) internal successors, (219), 55 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:28,942 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 361 transitions. [2025-03-03 09:17:28,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 09:17:28,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:28,942 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 9, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:28,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-03 09:17:29,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:29,145 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:29,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:29,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1712777773, now seen corresponding path program 3 times [2025-03-03 09:17:29,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:29,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155967070] [2025-03-03 09:17:29,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:17:29,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:29,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 10 equivalence classes. [2025-03-03 09:17:29,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 09:17:29,172 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-03 09:17:29,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:29,574 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:29,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:29,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155967070] [2025-03-03 09:17:29,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155967070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:17:29,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368014188] [2025-03-03 09:17:29,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:17:29,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:29,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:29,578 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:17:29,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-03 09:17:29,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 10 equivalence classes. [2025-03-03 09:17:29,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 09:17:29,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-03 09:17:29,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:29,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-03 09:17:29,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:17:29,840 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:17:29,844 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 23 treesize of output 22 [2025-03-03 09:17:29,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:17:29,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-03 09:17:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:30,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:17:30,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 17 treesize of output 15 [2025-03-03 09:17:30,412 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:17:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:30,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368014188] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:17:30,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:17:30,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 20] total 36 [2025-03-03 09:17:30,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260828515] [2025-03-03 09:17:30,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:17:30,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 09:17:30,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:30,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 09:17:30,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1114, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 09:17:30,425 INFO L87 Difference]: Start difference. First operand 329 states and 361 transitions. Second operand has 36 states, 36 states have (on average 3.9444444444444446) internal successors, (142), 36 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:17:34,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:34,860 INFO L93 Difference]: Finished difference Result 784 states and 879 transitions. [2025-03-03 09:17:34,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2025-03-03 09:17:34,861 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.9444444444444446) internal successors, (142), 36 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 77 [2025-03-03 09:17:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:34,862 INFO L225 Difference]: With dead ends: 784 [2025-03-03 09:17:34,862 INFO L226 Difference]: Without dead ends: 782 [2025-03-03 09:17:34,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24832 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3880, Invalid=56882, Unknown=0, NotChecked=0, Total=60762 [2025-03-03 09:17:34,865 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 352 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 3463 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 3801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 3463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:34,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 720 Invalid, 3801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 3463 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 09:17:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-03-03 09:17:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 386. [2025-03-03 09:17:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.1090909090909091) internal successors, (427), 385 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 427 transitions. [2025-03-03 09:17:34,925 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 427 transitions. Word has length 77 [2025-03-03 09:17:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:34,925 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 427 transitions. [2025-03-03 09:17:34,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.9444444444444446) internal successors, (142), 36 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:17:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 427 transitions. [2025-03-03 09:17:34,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 09:17:34,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:34,926 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:34,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-03 09:17:35,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:35,127 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:35,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:35,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1035996133, now seen corresponding path program 11 times [2025-03-03 09:17:35,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:35,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656932950] [2025-03-03 09:17:35,128 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:17:35,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:35,136 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 82 statements into 11 equivalence classes. [2025-03-03 09:17:35,149 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 09:17:35,149 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-03 09:17:35,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:35,534 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 20 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:35,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:35,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656932950] [2025-03-03 09:17:35,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656932950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:17:35,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820146353] [2025-03-03 09:17:35,535 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:17:35,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:35,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:35,537 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:17:35,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-03 09:17:35,625 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 82 statements into 11 equivalence classes. [2025-03-03 09:17:35,821 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 09:17:35,822 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-03 09:17:35,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:35,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 09:17:35,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:17:35,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:17:35,987 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:17:36,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:17:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 20 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:36,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:17:36,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:17:36,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:17:36,571 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 20 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:36,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820146353] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:17:36,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:17:36,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 39 [2025-03-03 09:17:36,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859357472] [2025-03-03 09:17:36,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:17:36,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 09:17:36,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:17:36,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 09:17:36,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 09:17:36,573 INFO L87 Difference]: Start difference. First operand 386 states and 427 transitions. Second operand has 39 states, 39 states have (on average 4.128205128205129) internal successors, (161), 39 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:41,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:17:41,235 INFO L93 Difference]: Finished difference Result 888 states and 960 transitions. [2025-03-03 09:17:41,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2025-03-03 09:17:41,235 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.128205128205129) internal successors, (161), 39 states have internal predecessors, (161), 0 states have call successors, (0), 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 82 [2025-03-03 09:17:41,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:17:41,237 INFO L225 Difference]: With dead ends: 888 [2025-03-03 09:17:41,237 INFO L226 Difference]: Without dead ends: 879 [2025-03-03 09:17:41,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 134 SyntacticMatches, 13 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19077 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3252, Invalid=44490, Unknown=0, NotChecked=0, Total=47742 [2025-03-03 09:17:41,240 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 231 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 4608 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 5071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 4608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:17:41,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1084 Invalid, 5071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 4608 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 09:17:41,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-03-03 09:17:41,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 359. [2025-03-03 09:17:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.111731843575419) internal successors, (398), 358 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 398 transitions. [2025-03-03 09:17:41,305 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 398 transitions. Word has length 82 [2025-03-03 09:17:41,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:17:41,305 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 398 transitions. [2025-03-03 09:17:41,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.128205128205129) internal successors, (161), 39 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:17:41,306 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 398 transitions. [2025-03-03 09:17:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 09:17:41,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:17:41,306 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:17:41,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-03 09:17:41,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:41,507 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:17:41,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:17:41,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1388678522, now seen corresponding path program 4 times [2025-03-03 09:17:41,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:17:41,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888375299] [2025-03-03 09:17:41,507 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:17:41,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:17:41,517 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 82 statements into 2 equivalence classes. [2025-03-03 09:17:41,526 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 09:17:41,526 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:17:41,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 299 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:17:41,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:17:41,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888375299] [2025-03-03 09:17:41,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888375299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:17:41,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092964726] [2025-03-03 09:17:41,885 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:17:41,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:17:41,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:17:41,887 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:17:41,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-03 09:17:41,981 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 82 statements into 2 equivalence classes. [2025-03-03 09:17:42,009 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 09:17:42,009 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:17:42,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:17:42,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-03 09:17:42,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:17:42,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 11 treesize of output 7 [2025-03-03 09:17:42,157 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