./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/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-?-798a7b3-m [2025-03-03 09:14:34,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:14:34,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:14:34,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:14:34,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:14:34,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:14:34,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:14:34,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:14:34,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:14:34,462 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:14:34,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:14:34,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:14:34,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:14:34,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:14:34,462 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:14:34,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:14:34,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:14:34,463 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:14:34,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:14:34,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:14:34,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:14:34,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:14:34,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:14:34,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:14:34,463 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:14:34,463 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:14:34,463 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:14:34,463 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:14:34,464 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:14:34,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:14:34,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:14:34,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:14:34,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:14:34,464 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:14:34,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:14:34,464 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:14:34,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:14:34,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:14:34,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:14:34,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:14:34,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:14:34,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:14:34,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:14:34,464 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-03 09:14:34,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:14:34,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:14:34,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:14:34,676 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:14:34,677 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:14:34,677 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-03 09:14:35,780 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f4c81c1f/e0f8cf9e2f6a45e090b93ad4c8667e2f/FLAGea7d63cfd [2025-03-03 09:14:35,981 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:14:35,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr5.c [2025-03-03 09:14:36,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f4c81c1f/e0f8cf9e2f6a45e090b93ad4c8667e2f/FLAGea7d63cfd [2025-03-03 09:14:36,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f4c81c1f/e0f8cf9e2f6a45e090b93ad4c8667e2f [2025-03-03 09:14:36,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:14:36,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:14:36,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:14:36,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:14:36,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:14:36,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:14:36" (1/1) ... [2025-03-03 09:14:36,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba2e26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:14:36, skipping insertion in model container [2025-03-03 09:14:36,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:14:36" (1/1) ... [2025-03-03 09:14:36,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:14:36,461 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-03 09:14:36,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:14:36,501 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:14:36,508 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-03 09:14:36,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:14:36,536 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:14:36,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:14:36 WrapperNode [2025-03-03 09:14:36,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:14:36,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:14:36,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:14:36,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:14:36,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:14:36" (1/1) ... [2025-03-03 09:14:36,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:14:36" (1/1) ... [2025-03-03 09:14:36,567 INFO L138 Inliner]: procedures = 15, calls = 72, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 164 [2025-03-03 09:14:36,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:14:36,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:14:36,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:14:36,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:14:36,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:14:36" (1/1) ... [2025-03-03 09:14:36,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:14:36" (1/1) ... [2025-03-03 09:14:36,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:14:36" (1/1) ... [2025-03-03 09:14:36,590 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-03 09:14:36,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:14:36" (1/1) ... [2025-03-03 09:14:36,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:14:36" (1/1) ... [2025-03-03 09:14:36,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:14:36" (1/1) ... [2025-03-03 09:14:36,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:14:36" (1/1) ... [2025-03-03 09:14:36,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:14:36" (1/1) ... [2025-03-03 09:14:36,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:14:36" (1/1) ... [2025-03-03 09:14:36,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:14:36,601 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:14:36,601 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:14:36,601 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:14:36,602 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:14:36" (1/1) ... [2025-03-03 09:14:36,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:14:36,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:14:36,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:14:36,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:14:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:14:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:14:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:14:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:14:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:14:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:14:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:14:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:14:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:14:36,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:14:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:14:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:14:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:14:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:14:36,703 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:14:36,705 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:14:36,901 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 09:14:36,901 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:14:36,907 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:14:36,907 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:14:36,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:14:36 BoogieIcfgContainer [2025-03-03 09:14:36,907 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:14:36,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:14:36,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:14:36,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:14:36,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:14:36" (1/3) ... [2025-03-03 09:14:36,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4114e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:14:36, skipping insertion in model container [2025-03-03 09:14:36,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:14:36" (2/3) ... [2025-03-03 09:14:36,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4114e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:14:36, skipping insertion in model container [2025-03-03 09:14:36,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:14:36" (3/3) ... [2025-03-03 09:14:36,917 INFO L128 eAbstractionObserver]: Analyzing ICFG mbpr5.c [2025-03-03 09:14:36,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:14:36,927 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-03 09:14:36,962 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:14:36,970 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;@44f2405f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:14:36,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:14:36,974 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-03 09:14:36,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 09:14:36,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:36,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:14:36,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:36,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:36,983 INFO L85 PathProgramCache]: Analyzing trace with hash -119926927, now seen corresponding path program 1 times [2025-03-03 09:14:36,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:36,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669075330] [2025-03-03 09:14:36,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:14:36,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:37,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 09:14:37,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:14:37,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:14:37,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:14:37,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:37,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669075330] [2025-03-03 09:14:37,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669075330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:14:37,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:14:37,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:14:37,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328120472] [2025-03-03 09:14:37,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:14:37,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:14:37,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:37,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:14:37,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:14:37,133 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-03 09:14:37,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:37,142 INFO L93 Difference]: Finished difference Result 59 states and 86 transitions. [2025-03-03 09:14:37,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:14:37,143 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-03 09:14:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:37,146 INFO L225 Difference]: With dead ends: 59 [2025-03-03 09:14:37,146 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 09:14:37,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:14:37,149 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-03 09:14:37,150 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-03 09:14:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 09:14:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-03 09:14:37,164 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-03 09:14:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2025-03-03 09:14:37,167 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 16 [2025-03-03 09:14:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:37,167 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2025-03-03 09:14:37,167 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-03 09:14:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2025-03-03 09:14:37,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 09:14:37,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:37,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:14:37,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:14:37,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:37,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:37,169 INFO L85 PathProgramCache]: Analyzing trace with hash 9155792, now seen corresponding path program 1 times [2025-03-03 09:14:37,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:37,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906862466] [2025-03-03 09:14:37,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:14:37,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:37,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 09:14:37,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:14:37,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:14:37,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:37,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:14:37,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:37,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906862466] [2025-03-03 09:14:37,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906862466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:14:37,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:14:37,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:14:37,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93493355] [2025-03-03 09:14:37,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:14:37,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:14:37,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:37,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:14:37,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:14:37,444 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-03 09:14:37,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:37,552 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2025-03-03 09:14:37,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:14:37,553 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-03 09:14:37,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:37,553 INFO L225 Difference]: With dead ends: 62 [2025-03-03 09:14:37,553 INFO L226 Difference]: Without dead ends: 43 [2025-03-03 09:14:37,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:14:37,554 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-03 09:14:37,554 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-03 09:14:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-03 09:14:37,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2025-03-03 09:14:37,561 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-03 09:14:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2025-03-03 09:14:37,562 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 16 [2025-03-03 09:14:37,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:37,562 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2025-03-03 09:14:37,563 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-03 09:14:37,563 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2025-03-03 09:14:37,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:14:37,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:37,564 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-03 09:14:37,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:14:37,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:37,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:37,565 INFO L85 PathProgramCache]: Analyzing trace with hash -796733349, now seen corresponding path program 1 times [2025-03-03 09:14:37,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:37,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963006878] [2025-03-03 09:14:37,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:14:37,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:37,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 09:14:37,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:14:37,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:14:37,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:14:39,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:39,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963006878] [2025-03-03 09:14:39,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963006878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:14:39,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197158588] [2025-03-03 09:14:39,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:14:39,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:39,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:14:39,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:14:39,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:14:39,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 09:14:39,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:14:39,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:14:39,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:39,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-03 09:14:39,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:14:39,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:14:39,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:39,616 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-03 09:14:39,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:14:39,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:39,685 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-03 09:14:39,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:14:39,729 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-03 09:14:39,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:14:39,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:39,775 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-03 09:14:39,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:14:39,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:39,855 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-03 09:14:39,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:39,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-03-03 09:14:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:14:39,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:14:40,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:14:40,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-03 09:14:40,193 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-03 09:14:40,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197158588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:14:40,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:14:40,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 20 [2025-03-03 09:14:40,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265624903] [2025-03-03 09:14:40,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:14:40,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 09:14:40,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:40,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 09:14:40,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:14:40,196 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-03 09:14:40,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:40,607 INFO L93 Difference]: Finished difference Result 113 states and 147 transitions. [2025-03-03 09:14:40,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 09:14:40,607 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-03 09:14:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:40,608 INFO L225 Difference]: With dead ends: 113 [2025-03-03 09:14:40,608 INFO L226 Difference]: Without dead ends: 87 [2025-03-03 09:14:40,608 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-03 09:14:40,609 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-03 09:14:40,609 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-03 09:14:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-03 09:14:40,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 35. [2025-03-03 09:14:40,621 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-03 09:14:40,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2025-03-03 09:14:40,621 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 31 [2025-03-03 09:14:40,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:40,621 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-03-03 09:14:40,621 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-03 09:14:40,622 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2025-03-03 09:14:40,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:14:40,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:40,622 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-03 09:14:40,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:14:40,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:40,826 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:40,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:40,826 INFO L85 PathProgramCache]: Analyzing trace with hash -796703558, now seen corresponding path program 1 times [2025-03-03 09:14:40,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:40,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975212871] [2025-03-03 09:14:40,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:14:40,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:40,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 09:14:40,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:14:40,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:14:40,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:40,906 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-03 09:14:40,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:40,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975212871] [2025-03-03 09:14:40,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975212871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:14:40,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:14:40,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:14:40,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068069626] [2025-03-03 09:14:40,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:14:40,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:14:40,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:40,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:14:40,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:14:40,907 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-03 09:14:40,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:40,923 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2025-03-03 09:14:40,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:14:40,924 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-03 09:14:40,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:40,924 INFO L225 Difference]: With dead ends: 39 [2025-03-03 09:14:40,924 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 09:14:40,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:14:40,925 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-03 09:14:40,926 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-03 09:14:40,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 09:14:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-03 09:14:40,931 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-03 09:14:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2025-03-03 09:14:40,933 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 31 [2025-03-03 09:14:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:40,933 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2025-03-03 09:14:40,933 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-03 09:14:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2025-03-03 09:14:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 09:14:40,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:40,934 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-03 09:14:40,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:14:40,934 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:40,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:40,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2106134029, now seen corresponding path program 1 times [2025-03-03 09:14:40,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:40,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397820177] [2025-03-03 09:14:40,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:14:40,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:40,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 09:14:40,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 09:14:40,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:14:40,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:41,784 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-03 09:14:41,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:41,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397820177] [2025-03-03 09:14:41,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397820177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:14:41,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821225249] [2025-03-03 09:14:41,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:14:41,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:41,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:14:41,787 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:14:41,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:14:41,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 09:14:41,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 09:14:41,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:14:41,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:41,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 09:14:41,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:14:41,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:14:41,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:41,972 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-03 09:14:42,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:14:42,023 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-03 09:14:42,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:14:42,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:42,058 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-03 09:14:42,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 19 treesize of output 18 [2025-03-03 09:14:42,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:42,115 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-03 09:14:42,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:42,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-03-03 09:14:42,219 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-03 09:14:42,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:14:42,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:14:42,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:14:42,429 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-03 09:14:42,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821225249] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:14:42,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:14:42,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 21 [2025-03-03 09:14:42,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142189834] [2025-03-03 09:14:42,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:14:42,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 09:14:42,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:42,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 09:14:42,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-03-03 09:14:42,431 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-03 09:14:42,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:42,835 INFO L93 Difference]: Finished difference Result 108 states and 138 transitions. [2025-03-03 09:14:42,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 09:14:42,835 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-03 09:14:42,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:42,836 INFO L225 Difference]: With dead ends: 108 [2025-03-03 09:14:42,836 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 09:14:42,836 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-03 09:14:42,837 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 203 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-03 09:14:42,837 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-03 09:14:42,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 09:14:42,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 42. [2025-03-03 09:14:42,843 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-03 09:14:42,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-03-03 09:14:42,843 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 36 [2025-03-03 09:14:42,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:42,844 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-03-03 09:14:42,844 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-03 09:14:42,844 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-03-03 09:14:42,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 09:14:42,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:42,845 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-03 09:14:42,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 09:14:43,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:43,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:43,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:43,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1011879771, now seen corresponding path program 2 times [2025-03-03 09:14:43,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:43,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030760966] [2025-03-03 09:14:43,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:14:43,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:43,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-03 09:14:43,091 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 09:14:43,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:14:43,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:43,749 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-03 09:14:43,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:43,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030760966] [2025-03-03 09:14:43,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030760966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:14:43,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127337599] [2025-03-03 09:14:43,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:14:43,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:43,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:14:43,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:14:43,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:14:43,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-03 09:14:43,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 09:14:43,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:14:43,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:43,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 09:14:43,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:14:43,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:14:43,928 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-03 09:14:43,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:14:43,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:43,968 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-03 09:14:43,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:14:44,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:44,009 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-03 09:14:44,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:44,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-03-03 09:14:44,163 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-03 09:14:44,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:14:44,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:14:44,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 24 treesize of output 20 [2025-03-03 09:14:44,353 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-03 09:14:44,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127337599] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:14:44,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:14:44,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 24 [2025-03-03 09:14:44,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030545282] [2025-03-03 09:14:44,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:14:44,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 09:14:44,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:44,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 09:14:44,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:14:44,355 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-03 09:14:45,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:45,050 INFO L93 Difference]: Finished difference Result 150 states and 195 transitions. [2025-03-03 09:14:45,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 09:14:45,051 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-03 09:14:45,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:45,052 INFO L225 Difference]: With dead ends: 150 [2025-03-03 09:14:45,052 INFO L226 Difference]: Without dead ends: 123 [2025-03-03 09:14:45,053 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-03 09:14:45,053 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-03 09:14:45,057 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-03 09:14:45,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-03 09:14:45,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 47. [2025-03-03 09:14:45,064 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-03 09:14:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-03-03 09:14:45,065 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 41 [2025-03-03 09:14:45,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:45,066 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-03-03 09:14:45,066 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-03 09:14:45,066 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-03-03 09:14:45,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 09:14:45,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:45,067 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-03 09:14:45,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 09:14:45,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:45,267 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:45,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash -266792205, now seen corresponding path program 3 times [2025-03-03 09:14:45,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:45,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328345846] [2025-03-03 09:14:45,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:14:45,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:45,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-03-03 09:14:45,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 09:14:45,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:14:45,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:45,803 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-03 09:14:45,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:45,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328345846] [2025-03-03 09:14:45,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328345846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:14:45,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810408444] [2025-03-03 09:14:45,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:14:45,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:45,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:14:45,806 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:14:45,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:14:45,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-03-03 09:14:45,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 09:14:45,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:14:45,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:45,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 09:14:45,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:14:46,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:14:46,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:46,088 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-03 09:14:46,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:14:46,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:46,145 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-03 09:14:46,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:46,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-03-03 09:14:46,334 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-03 09:14:46,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:14:46,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:14:46,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:14:46,520 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-03 09:14:46,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810408444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:14:46,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:14:46,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10] total 27 [2025-03-03 09:14:46,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091275169] [2025-03-03 09:14:46,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:14:46,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 09:14:46,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:46,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 09:14:46,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2025-03-03 09:14:46,522 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-03 09:14:47,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:47,247 INFO L93 Difference]: Finished difference Result 150 states and 185 transitions. [2025-03-03 09:14:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 09:14:47,248 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-03 09:14:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:47,248 INFO L225 Difference]: With dead ends: 150 [2025-03-03 09:14:47,249 INFO L226 Difference]: Without dead ends: 122 [2025-03-03 09:14:47,250 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-03 09:14:47,250 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-03 09:14:47,250 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-03 09:14:47,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-03 09:14:47,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 52. [2025-03-03 09:14:47,255 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-03 09:14:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2025-03-03 09:14:47,255 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 46 [2025-03-03 09:14:47,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:47,255 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2025-03-03 09:14:47,255 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-03 09:14:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2025-03-03 09:14:47,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 09:14:47,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:47,256 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-03 09:14:47,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 09:14:47,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:47,461 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:47,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:47,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1406832219, now seen corresponding path program 4 times [2025-03-03 09:14:47,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:47,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191012760] [2025-03-03 09:14:47,462 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:14:47,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:47,473 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-03-03 09:14:47,486 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 09:14:47,487 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:14:47,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:47,819 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-03 09:14:47,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:47,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191012760] [2025-03-03 09:14:47,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191012760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:14:47,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286543974] [2025-03-03 09:14:47,820 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:14:47,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:47,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:14:47,822 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:14:47,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:14:47,875 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-03-03 09:14:47,902 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 09:14:47,903 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:14:47,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:47,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 09:14:47,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:14:47,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:14:47,970 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-03 09:14:48,151 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-03 09:14:48,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:14:48,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:14:48,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-03 09:14:48,236 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-03 09:14:48,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286543974] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:14:48,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:14:48,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 26 [2025-03-03 09:14:48,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631258312] [2025-03-03 09:14:48,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:14:48,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 09:14:48,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:48,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 09:14:48,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2025-03-03 09:14:48,238 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-03 09:14:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:48,560 INFO L93 Difference]: Finished difference Result 113 states and 131 transitions. [2025-03-03 09:14:48,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 09:14:48,561 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-03 09:14:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:48,561 INFO L225 Difference]: With dead ends: 113 [2025-03-03 09:14:48,561 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 09:14:48,562 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-03 09:14:48,562 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:14:48,562 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.2s Time] [2025-03-03 09:14:48,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 09:14:48,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 87. [2025-03-03 09:14:48,569 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-03 09:14:48,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2025-03-03 09:14:48,572 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 51 [2025-03-03 09:14:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:48,573 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2025-03-03 09:14:48,573 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-03 09:14:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2025-03-03 09:14:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 09:14:48,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:48,573 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-03 09:14:48,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:14:48,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:48,774 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:48,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:48,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1661568764, now seen corresponding path program 1 times [2025-03-03 09:14:48,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:48,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060787652] [2025-03-03 09:14:48,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:14:48,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:48,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 09:14:48,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 09:14:48,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:14:48,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:48,832 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-03 09:14:48,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:48,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060787652] [2025-03-03 09:14:48,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060787652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:14:48,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:14:48,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:14:48,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151828503] [2025-03-03 09:14:48,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:14:48,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:14:48,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:48,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:14:48,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:14:48,834 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-03 09:14:48,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:48,845 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2025-03-03 09:14:48,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:14:48,845 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-03 09:14:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:48,846 INFO L225 Difference]: With dead ends: 127 [2025-03-03 09:14:48,846 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 09:14:48,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:14:48,847 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-03 09:14:48,847 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-03 09:14:48,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 09:14:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2025-03-03 09:14:48,856 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-03 09:14:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2025-03-03 09:14:48,856 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 51 [2025-03-03 09:14:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:48,857 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2025-03-03 09:14:48,857 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-03 09:14:48,857 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2025-03-03 09:14:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 09:14:48,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:48,859 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-03 09:14:48,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:14:48,859 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:48,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:48,859 INFO L85 PathProgramCache]: Analyzing trace with hash 570524914, now seen corresponding path program 5 times [2025-03-03 09:14:48,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:48,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7239884] [2025-03-03 09:14:48,859 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:14:48,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:48,889 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 6 equivalence classes. [2025-03-03 09:14:48,907 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 09:14:48,907 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:14:48,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:49,175 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-03 09:14:49,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:49,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7239884] [2025-03-03 09:14:49,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7239884] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:14:49,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80683486] [2025-03-03 09:14:49,176 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:14:49,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:49,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:14:49,178 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:14:49,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:14:49,240 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 6 equivalence classes. [2025-03-03 09:14:49,781 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 09:14:49,781 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:14:49,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:49,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:14:49,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:14:50,104 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-03 09:14:50,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:14:50,231 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-03 09:14:50,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80683486] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:14:50,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:14:50,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 34 [2025-03-03 09:14:50,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095503727] [2025-03-03 09:14:50,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:14:50,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 09:14:50,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:50,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 09:14:50,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=828, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 09:14:50,232 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-03 09:14:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:50,465 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2025-03-03 09:14:50,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 09:14:50,466 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-03 09:14:50,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:50,466 INFO L225 Difference]: With dead ends: 170 [2025-03-03 09:14:50,466 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 09:14:50,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=402, Invalid=1080, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 09:14:50,467 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-03 09:14:50,467 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-03 09:14:50,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 09:14:50,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2025-03-03 09:14:50,473 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-03 09:14:50,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2025-03-03 09:14:50,473 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 56 [2025-03-03 09:14:50,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:50,473 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2025-03-03 09:14:50,473 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-03 09:14:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2025-03-03 09:14:50,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 09:14:50,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:50,474 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-03 09:14:50,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 09:14:50,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:50,674 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:50,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:50,675 INFO L85 PathProgramCache]: Analyzing trace with hash -56140675, now seen corresponding path program 6 times [2025-03-03 09:14:50,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:50,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693040026] [2025-03-03 09:14:50,675 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:14:50,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:50,687 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 71 statements into 6 equivalence classes. [2025-03-03 09:14:50,726 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 09:14:50,726 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-03 09:14:50,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:52,741 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-03 09:14:52,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:14:52,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693040026] [2025-03-03 09:14:52,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693040026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:14:52,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418510264] [2025-03-03 09:14:52,741 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:14:52,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:52,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:14:52,743 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:14:52,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:14:52,805 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 71 statements into 6 equivalence classes. [2025-03-03 09:14:53,761 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 09:14:53,761 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-03 09:14:53,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:14:53,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-03-03 09:14:53,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:14:53,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:14:53,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:53,851 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-03 09:14:53,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:14:53,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:53,926 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-03 09:14:53,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:53,968 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-03 09:14:53,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:53,996 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-03 09:14:54,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:54,063 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-03 09:14:54,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:54,075 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-03 09:14:54,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-03 09:14:54,097 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-03 09:14:54,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:14:54,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:54,120 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-03 09:14:54,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:14:54,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:54,143 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-03 09:14:54,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:14:54,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:54,191 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-03 09:14:54,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:54,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:14:54,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:54,257 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-03 09:14:54,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:14:54,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2025-03-03 09:14:54,585 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-03 09:14:54,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:14:55,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:14:55,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:14:55,182 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-03 09:14:55,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418510264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:14:55,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:14:55,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23, 14] total 46 [2025-03-03 09:14:55,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332064857] [2025-03-03 09:14:55,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:14:55,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-03 09:14:55,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:14:55,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-03 09:14:55,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1871, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 09:14:55,185 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-03 09:14:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:14:58,081 INFO L93 Difference]: Finished difference Result 276 states and 324 transitions. [2025-03-03 09:14:58,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-03-03 09:14:58,081 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-03 09:14:58,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:14:58,082 INFO L225 Difference]: With dead ends: 276 [2025-03-03 09:14:58,082 INFO L226 Difference]: Without dead ends: 267 [2025-03-03 09:14:58,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 120 SyntacticMatches, 10 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4883 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1832, Invalid=14170, Unknown=0, NotChecked=0, Total=16002 [2025-03-03 09:14:58,086 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-03 09:14:58,086 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-03 09:14:58,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-03 09:14:58,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 77. [2025-03-03 09:14:58,094 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-03 09:14:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2025-03-03 09:14:58,095 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 71 [2025-03-03 09:14:58,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:14:58,095 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2025-03-03 09:14:58,095 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-03 09:14:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2025-03-03 09:14:58,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 09:14:58,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:14:58,095 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-03 09:14:58,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 09:14:58,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:14:58,296 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:14:58,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:14:58,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1833872145, now seen corresponding path program 7 times [2025-03-03 09:14:58,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:14:58,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622198975] [2025-03-03 09:14:58,296 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:14:58,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:14:58,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 09:14:58,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 09:14:58,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:14:58,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:15:00,818 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-03 09:15:00,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:15:00,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622198975] [2025-03-03 09:15:00,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622198975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:15:00,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33250784] [2025-03-03 09:15:00,822 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:15:00,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:15:00,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:15:00,824 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:15:00,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:15:00,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 09:15:00,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 09:15:00,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:15:00,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:15:00,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-03 09:15:00,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:15:01,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:15:01,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:01,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 44 treesize of output 18 [2025-03-03 09:15:01,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 23 treesize of output 11 [2025-03-03 09:15:01,132 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-03 09:15:01,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:15:01,157 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-03 09:15:01,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:15:01,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:01,183 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-03 09:15:01,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:15:01,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:01,205 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-03 09:15:01,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:15:01,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:01,265 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-03 09:15:01,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:01,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:15:01,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:01,342 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-03 09:15:01,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:01,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2025-03-03 09:15:01,725 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-03 09:15:01,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:15:10,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:15:10,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:15:10,513 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-03 09:15:10,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33250784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:15:10,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:15:10,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 15] total 56 [2025-03-03 09:15:10,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063268903] [2025-03-03 09:15:10,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:15:10,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-03 09:15:10,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:15:10,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-03 09:15:10,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2829, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 09:15:10,515 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-03 09:15:15,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:15:15,184 INFO L93 Difference]: Finished difference Result 323 states and 369 transitions. [2025-03-03 09:15:15,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-03 09:15:15,184 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-03 09:15:15,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:15:15,185 INFO L225 Difference]: With dead ends: 323 [2025-03-03 09:15:15,185 INFO L226 Difference]: Without dead ends: 263 [2025-03-03 09:15:15,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 126 SyntacticMatches, 9 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7055 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=2250, Invalid=19802, Unknown=0, NotChecked=0, Total=22052 [2025-03-03 09:15:15,189 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 791 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 3559 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:15:15,189 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.6s Time] [2025-03-03 09:15:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-03 09:15:15,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 113. [2025-03-03 09:15:15,203 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-03 09:15:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2025-03-03 09:15:15,203 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 76 [2025-03-03 09:15:15,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:15:15,203 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2025-03-03 09:15:15,203 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-03 09:15:15,203 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2025-03-03 09:15:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 09:15:15,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:15:15,204 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-03 09:15:15,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 09:15:15,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 09:15:15,408 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:15:15,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:15:15,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1670732029, now seen corresponding path program 8 times [2025-03-03 09:15:15,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:15:15,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926327813] [2025-03-03 09:15:15,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:15:15,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:15:15,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-03 09:15:15,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 09:15:15,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:15:15,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:15:17,010 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-03 09:15:17,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:15:17,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926327813] [2025-03-03 09:15:17,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926327813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:15:17,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529940787] [2025-03-03 09:15:17,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:15:17,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:15:17,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:15:17,013 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:15:17,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:15:17,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-03 09:15:17,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 09:15:17,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:15:17,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:15:17,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-03 09:15:17,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:15:17,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:15:17,284 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-03 09:15:17,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:15:17,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:17,334 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-03 09:15:17,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:15:17,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:17,356 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-03 09:15:17,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:15:17,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:17,404 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-03 09:15:17,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:17,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:15:17,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:17,483 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-03 09:15:17,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:17,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2025-03-03 09:15:17,968 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-03 09:15:17,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:15:26,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:15:26,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:15:26,551 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-03 09:15:26,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529940787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:15:26,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:15:26,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 16] total 54 [2025-03-03 09:15:26,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037410538] [2025-03-03 09:15:26,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:15:26,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-03 09:15:26,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:15:26,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-03 09:15:26,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2595, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 09:15:26,553 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-03 09:15:31,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:15:31,733 INFO L93 Difference]: Finished difference Result 429 states and 485 transitions. [2025-03-03 09:15:31,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-03-03 09:15:31,734 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-03 09:15:31,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:15:31,735 INFO L225 Difference]: With dead ends: 429 [2025-03-03 09:15:31,735 INFO L226 Difference]: Without dead ends: 371 [2025-03-03 09:15:31,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10781 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=3133, Invalid=29087, Unknown=0, NotChecked=0, Total=32220 [2025-03-03 09:15:31,738 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 941 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 3297 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:15:31,739 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.5s Time] [2025-03-03 09:15:31,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-03 09:15:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 134. [2025-03-03 09:15:31,756 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-03 09:15:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2025-03-03 09:15:31,757 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 81 [2025-03-03 09:15:31,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:15:31,757 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2025-03-03 09:15:31,757 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-03 09:15:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2025-03-03 09:15:31,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 09:15:31,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:15:31,757 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-03 09:15:31,764 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-03 09:15:31,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:15:31,958 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:15:31,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:15:31,958 INFO L85 PathProgramCache]: Analyzing trace with hash 841645713, now seen corresponding path program 9 times [2025-03-03 09:15:31,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:15:31,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65452656] [2025-03-03 09:15:31,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:15:31,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:15:31,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 9 equivalence classes. [2025-03-03 09:15:31,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 09:15:31,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-03 09:15:31,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:15:32,751 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-03 09:15:32,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:15:32,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65452656] [2025-03-03 09:15:32,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65452656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:15:32,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046805691] [2025-03-03 09:15:32,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:15:32,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:15:32,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:15:32,753 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:15:32,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:15:32,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 9 equivalence classes. [2025-03-03 09:15:34,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 09:15:34,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-03 09:15:34,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:15:34,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-03 09:15:34,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:15:34,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:15:34,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:34,345 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-03 09:15:34,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:15:34,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:34,417 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-03 09:15:34,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:34,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:15:34,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:34,487 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-03 09:15:34,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:15:34,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2025-03-03 09:15:34,983 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-03 09:15:34,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:15:35,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-03 09:15:35,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-03 09:15:35,562 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-03 09:15:35,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046805691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:15:35,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:15:35,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 17] total 50 [2025-03-03 09:15:35,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016259906] [2025-03-03 09:15:35,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:15:35,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-03 09:15:35,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:15:35,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-03 09:15:35,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2247, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 09:15:35,564 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-03 09:15:38,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:15:38,043 INFO L93 Difference]: Finished difference Result 253 states and 295 transitions. [2025-03-03 09:15:38,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-03 09:15:38,044 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-03 09:15:38,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:15:38,045 INFO L225 Difference]: With dead ends: 253 [2025-03-03 09:15:38,045 INFO L226 Difference]: Without dead ends: 244 [2025-03-03 09:15:38,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2368 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=978, Invalid=8724, Unknown=0, NotChecked=0, Total=9702 [2025-03-03 09:15:38,046 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 580 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 3748 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:15:38,046 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.3s Time] [2025-03-03 09:15:38,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-03 09:15:38,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 139. [2025-03-03 09:15:38,064 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-03 09:15:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2025-03-03 09:15:38,065 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 86 [2025-03-03 09:15:38,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:15:38,065 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2025-03-03 09:15:38,065 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-03 09:15:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2025-03-03 09:15:38,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 09:15:38,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:15:38,066 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-03 09:15:38,075 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-03 09:15:38,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 09:15:38,266 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:15:38,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:15:38,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1485944189, now seen corresponding path program 10 times [2025-03-03 09:15:38,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:15:38,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169486087] [2025-03-03 09:15:38,267 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:15:38,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:15:38,279 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 91 statements into 2 equivalence classes. [2025-03-03 09:15:38,299 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 09:15:38,299 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:15:38,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:15:38,739 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-03 09:15:38,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:15:38,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169486087] [2025-03-03 09:15:38,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169486087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:15:38,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778827006] [2025-03-03 09:15:38,740 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:15:38,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:15:38,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:15:38,742 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:15:38,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:15:38,839 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 91 statements into 2 equivalence classes. [2025-03-03 09:15:38,884 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 09:15:38,884 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:15:38,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:15:38,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-03 09:15:38,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:15:38,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:15:38,973 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-03 09:15:39,294 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-03 09:15:39,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:15:39,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:15:39,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-03 09:15:39,393 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-03 09:15:39,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778827006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:15:39,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:15:39,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 18] total 36 [2025-03-03 09:15:39,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719384863] [2025-03-03 09:15:39,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:15:39,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 09:15:39,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:15:39,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 09:15:39,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1125, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 09:15:39,394 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-03 09:15:40,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:15:40,456 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2025-03-03 09:15:40,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-03 09:15:40,456 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-03 09:15:40,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:15:40,457 INFO L225 Difference]: With dead ends: 203 [2025-03-03 09:15:40,457 INFO L226 Difference]: Without dead ends: 201 [2025-03-03 09:15:40,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=558, Invalid=4992, Unknown=0, NotChecked=0, Total=5550 [2025-03-03 09:15:40,458 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 101 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:15:40,458 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.6s Time] [2025-03-03 09:15:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-03 09:15:40,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 144. [2025-03-03 09:15:40,477 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-03 09:15:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2025-03-03 09:15:40,477 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 91 [2025-03-03 09:15:40,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:15:40,477 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2025-03-03 09:15:40,477 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-03 09:15:40,477 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2025-03-03 09:15:40,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 09:15:40,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:15:40,478 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-03 09:15:40,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 09:15:40,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:15:40,678 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:15:40,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:15:40,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1051689744, now seen corresponding path program 11 times [2025-03-03 09:15:40,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:15:40,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853523533] [2025-03-03 09:15:40,679 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:15:40,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:15:40,697 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 96 statements into 11 equivalence classes. [2025-03-03 09:15:40,713 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 09:15:40,713 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-03 09:15:40,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:15:41,256 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-03 09:15:41,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:15:41,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853523533] [2025-03-03 09:15:41,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853523533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:15:41,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959304197] [2025-03-03 09:15:41,257 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:15:41,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:15:41,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:15:41,259 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:15:41,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:15:41,361 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 96 statements into 11 equivalence classes. [2025-03-03 09:15:48,096 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 09:15:48,096 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-03 09:15:48,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:15:48,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 09:15:48,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:15:48,731 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-03 09:15:48,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:15:48,988 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-03 09:15:48,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959304197] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:15:48,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:15:48,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 18] total 48 [2025-03-03 09:15:48,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091926894] [2025-03-03 09:15:48,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:15:48,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-03 09:15:48,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:15:48,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-03 09:15:48,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1684, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 09:15:48,990 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-03 09:15:49,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:15:49,372 INFO L93 Difference]: Finished difference Result 274 states and 294 transitions. [2025-03-03 09:15:49,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 09:15:49,373 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-03 09:15:49,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:15:49,374 INFO L225 Difference]: With dead ends: 274 [2025-03-03 09:15:49,374 INFO L226 Difference]: Without dead ends: 122 [2025-03-03 09:15:49,374 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-03 09:15:49,375 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-03 09:15:49,375 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-03 09:15:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-03 09:15:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2025-03-03 09:15:49,388 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-03 09:15:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2025-03-03 09:15:49,388 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 96 [2025-03-03 09:15:49,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:15:49,389 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2025-03-03 09:15:49,389 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-03 09:15:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2025-03-03 09:15:49,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 09:15:49,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:15:49,389 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-03 09:15:49,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-03 09:15:49,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 09:15:49,590 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:15:49,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:15:49,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1898140187, now seen corresponding path program 12 times [2025-03-03 09:15:49,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:15:49,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497099546] [2025-03-03 09:15:49,590 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:15:49,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:15:49,606 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 111 statements into 11 equivalence classes. [2025-03-03 09:15:49,738 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 09:15:49,738 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-03 09:15:49,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:15:55,523 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-03 09:15:55,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:15:55,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497099546] [2025-03-03 09:15:55,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497099546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:15:55,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633462648] [2025-03-03 09:15:55,523 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:15:55,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:15:55,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:15:55,530 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:15:55,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:15:55,715 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 111 statements into 11 equivalence classes.