./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/mbpr5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/mbpr5.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 5503daab190ef8b57bdc3b49ed300bfd661cba05f76774439c2c92cf1668f08b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:23:59,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:23:59,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:23:59,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:23:59,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:23:59,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:23:59,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:23:59,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:23:59,292 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:23:59,292 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:23:59,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:23:59,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:23:59,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:23:59,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:23:59,293 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:23:59,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:23:59,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:23:59,293 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:23:59,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:23:59,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:23:59,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:23:59,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:23:59,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:23:59,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:23:59,293 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:23:59,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:23:59,296 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:23:59,296 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:23:59,297 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:23:59,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:23:59,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:23:59,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:23:59,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:23:59,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:23:59,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:23:59,297 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:23:59,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:23:59,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:23:59,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:23:59,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:23:59,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:23:59,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:23:59,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:23:59,297 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 -> 5503daab190ef8b57bdc3b49ed300bfd661cba05f76774439c2c92cf1668f08b [2025-03-08 00:23:59,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:23:59,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:23:59,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:23:59,595 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:23:59,595 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:23:59,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mbpr5.c [2025-03-08 00:24:00,738 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faffd1599/79cfbf8a661d40e6a72529223620abf6/FLAG7e8b26535 [2025-03-08 00:24:00,929 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:24:00,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr5.c [2025-03-08 00:24:00,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faffd1599/79cfbf8a661d40e6a72529223620abf6/FLAG7e8b26535 [2025-03-08 00:24:01,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faffd1599/79cfbf8a661d40e6a72529223620abf6 [2025-03-08 00:24:01,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:24:01,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:24:01,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:24:01,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:24:01,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:24:01,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:24:01" (1/1) ... [2025-03-08 00:24:01,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be505d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:01, skipping insertion in model container [2025-03-08 00:24:01,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:24:01" (1/1) ... [2025-03-08 00:24:01,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:24:01,425 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/mbpr5.c[396,409] [2025-03-08 00:24:01,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:24:01,459 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:24:01,467 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/mbpr5.c[396,409] [2025-03-08 00:24:01,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:24:01,490 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:24:01,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:01 WrapperNode [2025-03-08 00:24:01,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:24:01,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:24:01,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:24:01,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:24:01,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:01" (1/1) ... [2025-03-08 00:24:01,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:01" (1/1) ... [2025-03-08 00:24:01,514 INFO L138 Inliner]: procedures = 15, calls = 72, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 164 [2025-03-08 00:24:01,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:24:01,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:24:01,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:24:01,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:24:01,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:01" (1/1) ... [2025-03-08 00:24:01,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:01" (1/1) ... [2025-03-08 00:24:01,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:01" (1/1) ... [2025-03-08 00:24:01,534 INFO L175 MemorySlicer]: Split 62 memory accesses to 3 slices as follows [2, 8, 52]. 84 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 30 writes are split as follows [0, 0, 30]. [2025-03-08 00:24:01,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:01" (1/1) ... [2025-03-08 00:24:01,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:01" (1/1) ... [2025-03-08 00:24:01,542 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:01" (1/1) ... [2025-03-08 00:24:01,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:01" (1/1) ... [2025-03-08 00:24:01,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:01" (1/1) ... [2025-03-08 00:24:01,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:01" (1/1) ... [2025-03-08 00:24:01,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:24:01,546 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:24:01,546 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:24:01,546 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:24:01,547 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:01" (1/1) ... [2025-03-08 00:24:01,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:24:01,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:01,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:24:01,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:24:01,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:24:01,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:24:01,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:24:01,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:24:01,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:24:01,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:24:01,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:24:01,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:24:01,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:24:01,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:24:01,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:24:01,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:24:01,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:24:01,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:24:01,645 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:24:01,646 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:24:01,858 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 00:24:01,858 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:24:01,863 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:24:01,863 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:24:01,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:24:01 BoogieIcfgContainer [2025-03-08 00:24:01,864 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:24:01,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:24:01,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:24:01,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:24:01,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:24:01" (1/3) ... [2025-03-08 00:24:01,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c93fa53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:24:01, skipping insertion in model container [2025-03-08 00:24:01,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:01" (2/3) ... [2025-03-08 00:24:01,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c93fa53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:24:01, skipping insertion in model container [2025-03-08 00:24:01,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:24:01" (3/3) ... [2025-03-08 00:24:01,870 INFO L128 eAbstractionObserver]: Analyzing ICFG mbpr5.c [2025-03-08 00:24:01,880 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:24:01,881 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mbpr5.c that has 1 procedures, 32 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-08 00:24:01,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:24:01,923 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;@b035477, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:24:01,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:24:01,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 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-08 00:24:01,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 00:24:01,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:01,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:01,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:01,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash -119926927, now seen corresponding path program 1 times [2025-03-08 00:24:01,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:01,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687758972] [2025-03-08 00:24:01,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:01,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:01,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 00:24:02,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:24:02,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:02,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:02,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:02,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687758972] [2025-03-08 00:24:02,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687758972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:24:02,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:24:02,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:24:02,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080638810] [2025-03-08 00:24:02,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:24:02,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:24:02,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:02,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:24:02,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:24:02,101 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 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) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:02,111 INFO L93 Difference]: Finished difference Result 59 states and 86 transitions. [2025-03-08 00:24:02,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:24:02,113 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 00:24:02,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:02,117 INFO L225 Difference]: With dead ends: 59 [2025-03-08 00:24:02,117 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 00:24:02,120 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-08 00:24:02,123 INFO L435 NwaCegarLoop]: 45 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, 45 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-08 00:24:02,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:24:02,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 00:24:02,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 00:24:02,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2025-03-08 00:24:02,150 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 16 [2025-03-08 00:24:02,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:02,151 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2025-03-08 00:24:02,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2025-03-08 00:24:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 00:24:02,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:02,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:02,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:24:02,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:02,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:02,154 INFO L85 PathProgramCache]: Analyzing trace with hash 9155792, now seen corresponding path program 1 times [2025-03-08 00:24:02,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:02,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231411328] [2025-03-08 00:24:02,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:02,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:02,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 00:24:02,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:24:02,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:02,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:02,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:02,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231411328] [2025-03-08 00:24:02,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231411328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:24:02,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:24:02,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 00:24:02,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170937726] [2025-03-08 00:24:02,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:24:02,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:24:02,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:02,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:24:02,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:24:02,416 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:02,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:02,550 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2025-03-08 00:24:02,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:24:02,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 00:24:02,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:02,550 INFO L225 Difference]: With dead ends: 62 [2025-03-08 00:24:02,550 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 00:24:02,551 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-08 00:24:02,551 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 121 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:02,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 18 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:24:02,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 00:24:02,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2025-03-08 00:24:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2025-03-08 00:24:02,562 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 16 [2025-03-08 00:24:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:02,562 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2025-03-08 00:24:02,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2025-03-08 00:24:02,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:24:02,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:02,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:02,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:24:02,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:02,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:02,563 INFO L85 PathProgramCache]: Analyzing trace with hash -796733349, now seen corresponding path program 1 times [2025-03-08 00:24:02,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:02,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379552860] [2025-03-08 00:24:02,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:02,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:02,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 00:24:02,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:24:02,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:02,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:04,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:04,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379552860] [2025-03-08 00:24:04,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379552860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:04,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745085954] [2025-03-08 00:24:04,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:04,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:04,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:04,536 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:04,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:24:04,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 00:24:04,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:24:04,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:04,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:04,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 00:24:04,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:04,733 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-08 00:24:04,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:04,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 25 [2025-03-08 00:24:04,848 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-08 00:24:04,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:04,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 18 [2025-03-08 00:24:04,907 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-08 00:24:04,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 11 [2025-03-08 00:24:04,971 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-08 00:24:04,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:04,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 32 [2025-03-08 00:24:05,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:24:05,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:05,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 21 [2025-03-08 00:24:05,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:05,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-03-08 00:24:05,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:05,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:05,391 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-08 00:24:05,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-08 00:24:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:24:05,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745085954] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:05,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:05,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 20 [2025-03-08 00:24:05,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84898483] [2025-03-08 00:24:05,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:05,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 00:24:05,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:05,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 00:24:05,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:24:05,431 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:05,896 INFO L93 Difference]: Finished difference Result 113 states and 147 transitions. [2025-03-08 00:24:05,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 00:24:05,896 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-08 00:24:05,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:05,897 INFO L225 Difference]: With dead ends: 113 [2025-03-08 00:24:05,897 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 00:24:05,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 00:24:05,898 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 355 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:05,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 117 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:24:05,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 00:24:05,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 35. [2025-03-08 00:24:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2025-03-08 00:24:05,907 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 31 [2025-03-08 00:24:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:05,908 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-03-08 00:24:05,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2025-03-08 00:24:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:24:05,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:05,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:05,916 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-08 00:24:06,109 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-08 00:24:06,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:06,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:06,111 INFO L85 PathProgramCache]: Analyzing trace with hash -796703558, now seen corresponding path program 1 times [2025-03-08 00:24:06,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:06,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220477615] [2025-03-08 00:24:06,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:06,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:06,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 00:24:06,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:24:06,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:06,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:24:06,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:06,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220477615] [2025-03-08 00:24:06,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220477615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:24:06,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:24:06,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:24:06,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568790167] [2025-03-08 00:24:06,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:24:06,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:24:06,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:06,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:24:06,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:24:06,191 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-08 00:24:06,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:06,205 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2025-03-08 00:24:06,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:24:06,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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) Word has length 31 [2025-03-08 00:24:06,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:06,206 INFO L225 Difference]: With dead ends: 39 [2025-03-08 00:24:06,206 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 00:24:06,206 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-08 00:24:06,206 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 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-08 00:24:06,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:24:06,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 00:24:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 00:24:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 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-08 00:24:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2025-03-08 00:24:06,211 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 31 [2025-03-08 00:24:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:06,211 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2025-03-08 00:24:06,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-08 00:24:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2025-03-08 00:24:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 00:24:06,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:06,211 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:06,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:24:06,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:06,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:06,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2106134029, now seen corresponding path program 1 times [2025-03-08 00:24:06,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:06,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089419355] [2025-03-08 00:24:06,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:06,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:06,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 00:24:06,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 00:24:06,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:06,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:07,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:24:07,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:07,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089419355] [2025-03-08 00:24:07,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089419355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:07,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35253828] [2025-03-08 00:24:07,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:07,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:07,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:07,213 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:07,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:24:07,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 00:24:07,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 00:24:07,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:07,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:07,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 00:24:07,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:07,387 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-08 00:24:07,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:07,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 18 [2025-03-08 00:24:07,463 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-08 00:24:07,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 11 [2025-03-08 00:24:07,505 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-08 00:24:07,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:07,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 32 [2025-03-08 00:24:07,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:24:07,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:07,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 21 [2025-03-08 00:24:07,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:07,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-03-08 00:24:07,680 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:24:07,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:07,851 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-08 00:24:07,853 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-08 00:24:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:24:07,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35253828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:07,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:07,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 21 [2025-03-08 00:24:07,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183923769] [2025-03-08 00:24:07,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:07,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 00:24:07,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:07,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 00:24:07,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-03-08 00:24:07,891 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 21 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:08,255 INFO L93 Difference]: Finished difference Result 108 states and 138 transitions. [2025-03-08 00:24:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 00:24:08,255 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 21 states have internal predecessors, (97), 0 states have call successors, (0), 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 36 [2025-03-08 00:24:08,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:08,256 INFO L225 Difference]: With dead ends: 108 [2025-03-08 00:24:08,256 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 00:24:08,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=293, Invalid=897, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 00:24:08,257 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 203 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:08,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 104 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:24:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 00:24:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 42. [2025-03-08 00:24:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-03-08 00:24:08,267 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 36 [2025-03-08 00:24:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:08,267 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-03-08 00:24:08,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 21 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-03-08 00:24:08,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:24:08,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:08,268 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:08,275 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-08 00:24:08,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:08,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:08,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:08,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1011879771, now seen corresponding path program 2 times [2025-03-08 00:24:08,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:08,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214756461] [2025-03-08 00:24:08,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:08,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:08,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-08 00:24:08,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:24:08,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:08,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:24:09,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:09,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214756461] [2025-03-08 00:24:09,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214756461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:09,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748182186] [2025-03-08 00:24:09,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:09,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:09,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:09,243 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:09,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:24:09,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-08 00:24:09,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:24:09,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:09,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:09,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 00:24:09,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:09,405 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-08 00:24:09,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2025-03-08 00:24:09,461 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-08 00:24:09,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:09,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 32 [2025-03-08 00:24:09,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:24:09,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:09,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 21 [2025-03-08 00:24:09,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:09,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-03-08 00:24:09,714 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:24:09,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:09,884 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-08 00:24:09,886 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-08 00:24:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:24:09,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748182186] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:09,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:09,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 24 [2025-03-08 00:24:09,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176300875] [2025-03-08 00:24:09,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:09,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 00:24:09,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:09,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 00:24:09,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:24:09,934 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 24 states, 24 states have (on average 4.666666666666667) internal successors, (112), 24 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:10,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:10,626 INFO L93 Difference]: Finished difference Result 150 states and 195 transitions. [2025-03-08 00:24:10,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 00:24:10,627 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.666666666666667) internal successors, (112), 24 states have internal predecessors, (112), 0 states have call successors, (0), 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 41 [2025-03-08 00:24:10,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:10,628 INFO L225 Difference]: With dead ends: 150 [2025-03-08 00:24:10,628 INFO L226 Difference]: Without dead ends: 123 [2025-03-08 00:24:10,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=448, Invalid=1714, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 00:24:10,629 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 396 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:10,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 134 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:24:10,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-08 00:24:10,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 47. [2025-03-08 00:24:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:10,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-03-08 00:24:10,635 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 41 [2025-03-08 00:24:10,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:10,635 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-03-08 00:24:10,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.666666666666667) internal successors, (112), 24 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:10,635 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-03-08 00:24:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:24:10,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:10,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:10,642 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-08 00:24:10,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:10,840 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:10,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:10,841 INFO L85 PathProgramCache]: Analyzing trace with hash -266792205, now seen corresponding path program 3 times [2025-03-08 00:24:10,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:10,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197768563] [2025-03-08 00:24:10,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:24:10,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:10,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-03-08 00:24:10,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:24:10,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:24:10,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:24:11,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:11,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197768563] [2025-03-08 00:24:11,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197768563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:11,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265192653] [2025-03-08 00:24:11,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:24:11,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:11,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:11,425 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:11,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:24:11,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-03-08 00:24:11,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:24:11,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:24:11,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:11,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 00:24:11,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:11,687 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-08 00:24:11,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:11,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 39 [2025-03-08 00:24:11,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:24:11,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:11,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 21 [2025-03-08 00:24:11,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:11,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-03-08 00:24:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:11,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:12,094 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-08 00:24:12,096 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-08 00:24:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:24:12,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265192653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:12,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:12,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10] total 27 [2025-03-08 00:24:12,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739309392] [2025-03-08 00:24:12,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:12,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 00:24:12,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:12,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 00:24:12,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:24:12,150 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 27 states, 27 states have (on average 4.703703703703703) internal successors, (127), 27 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:12,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:12,911 INFO L93 Difference]: Finished difference Result 150 states and 185 transitions. [2025-03-08 00:24:12,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 00:24:12,911 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.703703703703703) internal successors, (127), 27 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-08 00:24:12,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:12,912 INFO L225 Difference]: With dead ends: 150 [2025-03-08 00:24:12,912 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 00:24:12,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=494, Invalid=2368, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 00:24:12,913 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 484 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:12,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 140 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:24:12,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 00:24:12,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 52. [2025-03-08 00:24:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2025-03-08 00:24:12,919 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 46 [2025-03-08 00:24:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:12,920 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2025-03-08 00:24:12,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.703703703703703) internal successors, (127), 27 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2025-03-08 00:24:12,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 00:24:12,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:12,920 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:12,928 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-08 00:24:13,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:13,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:13,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:13,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1406832219, now seen corresponding path program 4 times [2025-03-08 00:24:13,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:13,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061003559] [2025-03-08 00:24:13,122 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:24:13,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:13,132 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-03-08 00:24:13,146 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 00:24:13,147 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:24:13,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:24:13,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:13,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061003559] [2025-03-08 00:24:13,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061003559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:13,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974711795] [2025-03-08 00:24:13,469 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:24:13,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:13,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:13,471 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:13,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:24:13,524 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-03-08 00:24:13,556 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 00:24:13,556 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:24:13,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:13,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 00:24:13,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:13,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:24:13,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2025-03-08 00:24:13,809 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:24:13,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:13,898 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-08 00:24:13,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-08 00:24:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:24:13,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974711795] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:13,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:13,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 26 [2025-03-08 00:24:13,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661941334] [2025-03-08 00:24:13,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:13,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 00:24:13,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:13,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 00:24:13,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2025-03-08 00:24:13,902 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:14,290 INFO L93 Difference]: Finished difference Result 113 states and 131 transitions. [2025-03-08 00:24:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:24:14,291 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-08 00:24:14,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:14,291 INFO L225 Difference]: With dead ends: 113 [2025-03-08 00:24:14,291 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 00:24:14,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=1180, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 00:24:14,293 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 76 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:14,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 164 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:24:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 00:24:14,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 87. [2025-03-08 00:24:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.2093023255813953) internal successors, (104), 86 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2025-03-08 00:24:14,301 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 51 [2025-03-08 00:24:14,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:14,301 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2025-03-08 00:24:14,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:14,302 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2025-03-08 00:24:14,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 00:24:14,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:14,302 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:14,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 00:24:14,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:14,503 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:14,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:14,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1661568764, now seen corresponding path program 1 times [2025-03-08 00:24:14,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:14,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298637915] [2025-03-08 00:24:14,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:14,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:14,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 00:24:14,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 00:24:14,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:14,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 00:24:14,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:14,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298637915] [2025-03-08 00:24:14,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298637915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:24:14,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:24:14,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:24:14,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583130819] [2025-03-08 00:24:14,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:24:14,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:24:14,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:14,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:24:14,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:24:14,553 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:14,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:14,562 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2025-03-08 00:24:14,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:24:14,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-08 00:24:14,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:14,563 INFO L225 Difference]: With dead ends: 127 [2025-03-08 00:24:14,563 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 00:24:14,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:24:14,563 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:14,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 29 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:24:14,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 00:24:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2025-03-08 00:24:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:14,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2025-03-08 00:24:14,568 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 51 [2025-03-08 00:24:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:14,569 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2025-03-08 00:24:14,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:14,569 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2025-03-08 00:24:14,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 00:24:14,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:14,569 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:14,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 00:24:14,570 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:14,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:14,570 INFO L85 PathProgramCache]: Analyzing trace with hash 570524914, now seen corresponding path program 5 times [2025-03-08 00:24:14,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:14,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532663751] [2025-03-08 00:24:14,570 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:24:14,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:14,579 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 6 equivalence classes. [2025-03-08 00:24:14,588 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:24:14,588 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:24:14,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 70 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:24:14,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:14,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532663751] [2025-03-08 00:24:14,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532663751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:14,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595360072] [2025-03-08 00:24:14,853 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:24:14,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:14,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:14,855 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:14,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:24:14,930 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 6 equivalence classes. [2025-03-08 00:24:15,481 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:24:15,481 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:24:15,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:15,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:24:15,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:15,846 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 70 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:24:15,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 70 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:24:15,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595360072] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:15,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:15,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 34 [2025-03-08 00:24:15,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235408773] [2025-03-08 00:24:15,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:15,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 00:24:15,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:15,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 00:24:15,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=828, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 00:24:15,984 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 34 states, 34 states have (on average 4.588235294117647) internal successors, (156), 34 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:16,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:16,210 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2025-03-08 00:24:16,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:24:16,211 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.588235294117647) internal successors, (156), 34 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-08 00:24:16,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:16,211 INFO L225 Difference]: With dead ends: 170 [2025-03-08 00:24:16,211 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 00:24:16,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=402, Invalid=1080, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 00:24:16,212 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 211 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:16,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 166 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:24:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 00:24:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2025-03-08 00:24:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 71 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2025-03-08 00:24:16,218 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 56 [2025-03-08 00:24:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:16,218 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2025-03-08 00:24:16,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.588235294117647) internal successors, (156), 34 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2025-03-08 00:24:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 00:24:16,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:16,219 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:16,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 00:24:16,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:16,419 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:16,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:16,420 INFO L85 PathProgramCache]: Analyzing trace with hash -56140675, now seen corresponding path program 6 times [2025-03-08 00:24:16,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:16,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168265801] [2025-03-08 00:24:16,420 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:24:16,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:16,433 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 71 statements into 6 equivalence classes. [2025-03-08 00:24:16,470 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 00:24:16,471 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:24:16,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 10 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:18,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:18,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168265801] [2025-03-08 00:24:18,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168265801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:18,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725926229] [2025-03-08 00:24:18,550 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:24:18,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:18,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:18,552 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:18,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:24:18,623 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 71 statements into 6 equivalence classes. [2025-03-08 00:24:19,594 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 00:24:19,594 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:24:19,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:19,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-03-08 00:24:19,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:19,668 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-08 00:24:19,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:19,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 25 [2025-03-08 00:24:19,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:24:19,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:19,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2025-03-08 00:24:19,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:19,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2025-03-08 00:24:19,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:19,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 35 [2025-03-08 00:24:20,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:20,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 28 [2025-03-08 00:24:20,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:20,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 21 [2025-03-08 00:24:20,041 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-08 00:24:20,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 11 [2025-03-08 00:24:20,073 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-08 00:24:20,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:20,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 39 [2025-03-08 00:24:20,096 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-08 00:24:20,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:20,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 32 [2025-03-08 00:24:20,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:24:20,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:20,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 21 [2025-03-08 00:24:20,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:20,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 00:24:20,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:20,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 31 [2025-03-08 00:24:20,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:20,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 00:24:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 10 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:20,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:21,095 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-08 00:24:21,096 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-08 00:24:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 10 proven. 77 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:24:21,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725926229] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:21,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:21,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23, 14] total 46 [2025-03-08 00:24:21,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381688948] [2025-03-08 00:24:21,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:21,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 00:24:21,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:21,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 00:24:21,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1871, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 00:24:21,169 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 46 states, 46 states have (on average 4.304347826086956) internal successors, (198), 46 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:24,110 INFO L93 Difference]: Finished difference Result 276 states and 324 transitions. [2025-03-08 00:24:24,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-03-08 00:24:24,111 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.304347826086956) internal successors, (198), 46 states have internal predecessors, (198), 0 states have call successors, (0), 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 71 [2025-03-08 00:24:24,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:24,112 INFO L225 Difference]: With dead ends: 276 [2025-03-08 00:24:24,112 INFO L226 Difference]: Without dead ends: 267 [2025-03-08 00:24:24,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 120 SyntacticMatches, 10 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4883 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1832, Invalid=14170, Unknown=0, NotChecked=0, Total=16002 [2025-03-08 00:24:24,115 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1019 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 2634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:24,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 331 Invalid, 2634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [465 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 00:24:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-08 00:24:24,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 77. [2025-03-08 00:24:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.105263157894737) internal successors, (84), 76 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2025-03-08 00:24:24,123 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 71 [2025-03-08 00:24:24,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:24,124 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2025-03-08 00:24:24,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.304347826086956) internal successors, (198), 46 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:24,124 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2025-03-08 00:24:24,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 00:24:24,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:24,126 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:24,135 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-08 00:24:24,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:24,327 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:24,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:24,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1833872145, now seen corresponding path program 7 times [2025-03-08 00:24:24,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:24,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459131936] [2025-03-08 00:24:24,328 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:24:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:24,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 00:24:24,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 00:24:24,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:24,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 12 proven. 110 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:24:27,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:27,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459131936] [2025-03-08 00:24:27,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459131936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:27,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116529496] [2025-03-08 00:24:27,054 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:24:27,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:27,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:27,055 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:27,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:24:27,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 00:24:27,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 00:24:27,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:27,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:27,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-08 00:24:27,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:27,310 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-08 00:24:27,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:27,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 18 [2025-03-08 00:24:27,407 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-08 00:24:27,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2025-03-08 00:24:27,429 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-08 00:24:27,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 11 [2025-03-08 00:24:27,453 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-08 00:24:27,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:27,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 39 [2025-03-08 00:24:27,478 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-08 00:24:27,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:27,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 32 [2025-03-08 00:24:27,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:24:27,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:27,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 21 [2025-03-08 00:24:27,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:27,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 00:24:27,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:27,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 31 [2025-03-08 00:24:28,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:28,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 00:24:28,031 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 12 proven. 111 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:24:28,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:40,772 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-08 00:24:40,774 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-08 00:24:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 12 proven. 100 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:24:40,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116529496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:40,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:40,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 15] total 56 [2025-03-08 00:24:40,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483053185] [2025-03-08 00:24:40,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:40,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-08 00:24:40,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:40,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-08 00:24:40,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2829, Unknown=0, NotChecked=0, Total=3080 [2025-03-08 00:24:40,875 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 56 states, 56 states have (on average 3.767857142857143) internal successors, (211), 56 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:45,836 INFO L93 Difference]: Finished difference Result 323 states and 369 transitions. [2025-03-08 00:24:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-08 00:24:45,836 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 3.767857142857143) internal successors, (211), 56 states have internal predecessors, (211), 0 states have call successors, (0), 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 76 [2025-03-08 00:24:45,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:45,837 INFO L225 Difference]: With dead ends: 323 [2025-03-08 00:24:45,837 INFO L226 Difference]: Without dead ends: 263 [2025-03-08 00:24:45,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 126 SyntacticMatches, 9 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7056 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=2250, Invalid=19802, Unknown=0, NotChecked=0, Total=22052 [2025-03-08 00:24:45,842 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 791 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 3559 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 3954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 3559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:45,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 466 Invalid, 3954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 3559 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 00:24:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-08 00:24:45,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 113. [2025-03-08 00:24:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.0803571428571428) internal successors, (121), 112 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-08 00:24:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2025-03-08 00:24:45,860 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 76 [2025-03-08 00:24:45,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:45,860 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2025-03-08 00:24:45,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 3.767857142857143) internal successors, (211), 56 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2025-03-08 00:24:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 00:24:45,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:45,860 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:45,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 00:24:46,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 00:24:46,061 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:46,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:46,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1670732029, now seen corresponding path program 8 times [2025-03-08 00:24:46,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:46,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587637888] [2025-03-08 00:24:46,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:46,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:46,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-08 00:24:46,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 00:24:46,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:46,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 137 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:24:47,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:47,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587637888] [2025-03-08 00:24:47,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587637888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:47,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129913206] [2025-03-08 00:24:47,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:47,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:47,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:47,747 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:47,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:24:47,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-08 00:24:47,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 00:24:47,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:47,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:47,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-08 00:24:47,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:47,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:24:48,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2025-03-08 00:24:48,058 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-08 00:24:48,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:48,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 39 [2025-03-08 00:24:48,085 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-08 00:24:48,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:48,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 32 [2025-03-08 00:24:48,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:24:48,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:48,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 21 [2025-03-08 00:24:48,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:48,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 00:24:48,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:48,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 31 [2025-03-08 00:24:48,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:48,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 00:24:48,687 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 142 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:24:48,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:49,170 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-08 00:24:49,171 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-08 00:24:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 128 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:24:49,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129913206] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:49,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:49,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 16] total 54 [2025-03-08 00:24:49,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475740615] [2025-03-08 00:24:49,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:49,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-08 00:24:49,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:49,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-08 00:24:49,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2595, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 00:24:49,256 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 54 states, 54 states have (on average 4.074074074074074) internal successors, (220), 54 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:54,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:54,847 INFO L93 Difference]: Finished difference Result 429 states and 485 transitions. [2025-03-08 00:24:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-03-08 00:24:54,848 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 4.074074074074074) internal successors, (220), 54 states have internal predecessors, (220), 0 states have call successors, (0), 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 81 [2025-03-08 00:24:54,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:54,849 INFO L225 Difference]: With dead ends: 429 [2025-03-08 00:24:54,849 INFO L226 Difference]: Without dead ends: 371 [2025-03-08 00:24:54,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10781 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3133, Invalid=29087, Unknown=0, NotChecked=0, Total=32220 [2025-03-08 00:24:54,851 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 941 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 3297 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 3753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 3297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:54,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 447 Invalid, 3753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 3297 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 00:24:54,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-08 00:24:54,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 134. [2025-03-08 00:24:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.0977443609022557) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2025-03-08 00:24:54,870 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 81 [2025-03-08 00:24:54,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:54,870 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2025-03-08 00:24:54,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 4.074074074074074) internal successors, (220), 54 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:54,870 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2025-03-08 00:24:54,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 00:24:54,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:54,871 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:54,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 00:24:55,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 00:24:55,071 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:55,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:55,072 INFO L85 PathProgramCache]: Analyzing trace with hash 841645713, now seen corresponding path program 9 times [2025-03-08 00:24:55,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:55,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046236260] [2025-03-08 00:24:55,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:24:55,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:55,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 9 equivalence classes. [2025-03-08 00:24:55,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 00:24:55,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-08 00:24:55,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 16 proven. 166 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:24:55,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:55,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046236260] [2025-03-08 00:24:55,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046236260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:55,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681213226] [2025-03-08 00:24:55,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:24:55,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:55,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:55,900 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:55,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:24:55,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 9 equivalence classes. [2025-03-08 00:24:57,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 00:24:57,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-08 00:24:57,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:57,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-08 00:24:57,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:57,647 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-08 00:24:57,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:57,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 39 [2025-03-08 00:24:57,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:24:57,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:57,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 21 [2025-03-08 00:24:57,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:57,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 00:24:57,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:57,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 31 [2025-03-08 00:24:58,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:58,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 00:24:58,376 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 16 proven. 170 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:24:58,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:58,885 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-08 00:24:58,887 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-08 00:24:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 16 proven. 165 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:24:58,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681213226] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:58,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:58,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 17] total 50 [2025-03-08 00:24:58,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953607043] [2025-03-08 00:24:58,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:58,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-08 00:24:58,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:58,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-08 00:24:58,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2247, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 00:24:58,985 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:25:01,784 INFO L93 Difference]: Finished difference Result 253 states and 295 transitions. [2025-03-08 00:25:01,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-08 00:25:01,784 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 0 states have call successors, (0), 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 86 [2025-03-08 00:25:01,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:25:01,786 INFO L225 Difference]: With dead ends: 253 [2025-03-08 00:25:01,786 INFO L226 Difference]: Without dead ends: 244 [2025-03-08 00:25:01,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2368 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=978, Invalid=8724, Unknown=0, NotChecked=0, Total=9702 [2025-03-08 00:25:01,787 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 580 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 3748 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 3942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 3748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:25:01,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 534 Invalid, 3942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 3748 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 00:25:01,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-08 00:25:01,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 139. [2025-03-08 00:25:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.0942028985507246) internal successors, (151), 138 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-08 00:25:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2025-03-08 00:25:01,807 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 86 [2025-03-08 00:25:01,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:25:01,807 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2025-03-08 00:25:01,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:01,808 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2025-03-08 00:25:01,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 00:25:01,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:25:01,808 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:25:01,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 00:25:02,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 00:25:02,009 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:25:02,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:25:02,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1485944189, now seen corresponding path program 10 times [2025-03-08 00:25:02,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:25:02,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937673495] [2025-03-08 00:25:02,010 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:25:02,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:25:02,024 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 91 statements into 2 equivalence classes. [2025-03-08 00:25:02,046 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 00:25:02,046 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:25:02,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 00:25:02,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:25:02,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937673495] [2025-03-08 00:25:02,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937673495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:25:02,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215970125] [2025-03-08 00:25:02,588 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:25:02,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:02,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:25:02,590 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:25:02,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 00:25:02,694 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 91 statements into 2 equivalence classes. [2025-03-08 00:25:02,740 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 00:25:02,740 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:25:02,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:02,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 00:25:02,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:25:02,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:25:02,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2025-03-08 00:25:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 00:25:03,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:25:03,313 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-08 00:25:03,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-08 00:25:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 00:25:03,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215970125] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:25:03,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:25:03,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 18] total 36 [2025-03-08 00:25:03,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313627006] [2025-03-08 00:25:03,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:25:03,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 00:25:03,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:25:03,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 00:25:03,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1125, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 00:25:03,320 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand has 36 states, 36 states have (on average 4.583333333333333) internal successors, (165), 36 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:25:04,460 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2025-03-08 00:25:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-08 00:25:04,461 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.583333333333333) internal successors, (165), 36 states have internal predecessors, (165), 0 states have call successors, (0), 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 91 [2025-03-08 00:25:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:25:04,461 INFO L225 Difference]: With dead ends: 203 [2025-03-08 00:25:04,461 INFO L226 Difference]: Without dead ends: 201 [2025-03-08 00:25:04,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=558, Invalid=4992, Unknown=0, NotChecked=0, Total=5550 [2025-03-08 00:25:04,462 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 101 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 00:25:04,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 318 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 00:25:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-08 00:25:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 144. [2025-03-08 00:25:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.097902097902098) internal successors, (157), 143 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-08 00:25:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2025-03-08 00:25:04,485 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 91 [2025-03-08 00:25:04,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:25:04,485 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2025-03-08 00:25:04,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.583333333333333) internal successors, (165), 36 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:04,485 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2025-03-08 00:25:04,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 00:25:04,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:25:04,486 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:25:04,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 00:25:04,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 00:25:04,687 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:25:04,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:25:04,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1051689744, now seen corresponding path program 11 times [2025-03-08 00:25:04,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:25:04,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826936870] [2025-03-08 00:25:04,687 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:25:04,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:25:04,703 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 96 statements into 11 equivalence classes. [2025-03-08 00:25:04,721 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 00:25:04,721 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 00:25:04,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 139 proven. 131 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 00:25:05,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:25:05,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826936870] [2025-03-08 00:25:05,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826936870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:25:05,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482505756] [2025-03-08 00:25:05,165 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:25:05,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:05,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:25:05,167 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-08 00:25:05,168 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-08 00:25:05,271 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 96 statements into 11 equivalence classes. [2025-03-08 00:25:12,768 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 00:25:12,768 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 00:25:12,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:12,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 00:25:12,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:25:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 265 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 00:25:13,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:25:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 265 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 00:25:13,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482505756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:25:13,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:25:13,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 18] total 48 [2025-03-08 00:25:13,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400119040] [2025-03-08 00:25:13,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:25:13,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-08 00:25:13,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:25:13,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-08 00:25:13,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1684, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 00:25:13,671 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand has 48 states, 48 states have (on average 4.416666666666667) internal successors, (212), 48 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:14,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:25:14,080 INFO L93 Difference]: Finished difference Result 274 states and 294 transitions. [2025-03-08 00:25:14,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 00:25:14,081 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.416666666666667) internal successors, (212), 48 states have internal predecessors, (212), 0 states have call successors, (0), 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 96 [2025-03-08 00:25:14,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:25:14,082 INFO L225 Difference]: With dead ends: 274 [2025-03-08 00:25:14,082 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 00:25:14,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 162 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1337 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=746, Invalid=2224, Unknown=0, NotChecked=0, Total=2970 [2025-03-08 00:25:14,083 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 280 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:25:14,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 265 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:25:14,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 00:25:14,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2025-03-08 00:25:14,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.0810810810810811) internal successors, (120), 111 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:14,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2025-03-08 00:25:14,098 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 96 [2025-03-08 00:25:14,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:25:14,098 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2025-03-08 00:25:14,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.416666666666667) internal successors, (212), 48 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:14,099 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2025-03-08 00:25:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 00:25:14,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:25:14,099 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:25:14,114 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-08 00:25:14,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 00:25:14,300 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:25:14,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:25:14,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1898140187, now seen corresponding path program 12 times [2025-03-08 00:25:14,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:25:14,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312635061] [2025-03-08 00:25:14,301 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:25:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:25:14,317 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 111 statements into 11 equivalence classes. [2025-03-08 00:25:14,437 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 00:25:14,438 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-08 00:25:14,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 21 proven. 303 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:25:19,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:25:19,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312635061] [2025-03-08 00:25:19,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312635061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:25:19,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660113084] [2025-03-08 00:25:19,392 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:25:19,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:19,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:25:19,394 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-08 00:25:19,394 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-08 00:25:19,511 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 111 statements into 11 equivalence classes. [2025-03-08 00:25:29,077 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 00:25:29,078 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-08 00:25:29,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:29,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-08 00:25:29,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:25:29,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-08 00:25:29,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:25:29,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 37