./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/mbpr4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/mbpr4.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 d3770c63a87ff983494c9353997301d9eb30588c650f83b67bcf55f325443055 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:23:58,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:23:58,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:23:58,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:23:58,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:23:58,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:23:58,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:23:58,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:23:58,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:23:58,532 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:23:58,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:23:58,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:23:58,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:23:58,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:23:58,532 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:23:58,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:23:58,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:23:58,532 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:23:58,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:23:58,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:23:58,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:23:58,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:23:58,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:23:58,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:23:58,533 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:23:58,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:23:58,533 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:23:58,533 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:23:58,533 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:23:58,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:23:58,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:23:58,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:23:58,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:23:58,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:23:58,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:23:58,533 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:23:58,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:23:58,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:23:58,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:23:58,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:23:58,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:23:58,534 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:23:58,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:23:58,534 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 -> d3770c63a87ff983494c9353997301d9eb30588c650f83b67bcf55f325443055 [2025-03-08 00:23:58,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:23:58,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:23:58,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:23:58,743 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:23:58,743 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:23:58,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mbpr4.c [2025-03-08 00:23:59,962 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ea9830d/76df545e27f8433294563ba564f5e05c/FLAG0bef5c49b [2025-03-08 00:24:00,144 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:24:00,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr4.c [2025-03-08 00:24:00,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ea9830d/76df545e27f8433294563ba564f5e05c/FLAG0bef5c49b [2025-03-08 00:24:00,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ea9830d/76df545e27f8433294563ba564f5e05c [2025-03-08 00:24:00,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:24:00,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:24:00,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:24:00,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:24:00,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:24:00,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:24:00" (1/1) ... [2025-03-08 00:24:00,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f9e4635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:00, skipping insertion in model container [2025-03-08 00:24:00,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:24:00" (1/1) ... [2025-03-08 00:24:00,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:24:00,288 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/mbpr4.c[396,409] [2025-03-08 00:24:00,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:24:00,319 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:24:00,328 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/mbpr4.c[396,409] [2025-03-08 00:24:00,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:24:00,348 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:24:00,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:00 WrapperNode [2025-03-08 00:24:00,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:24:00,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:24:00,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:24:00,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:24:00,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:00" (1/1) ... [2025-03-08 00:24:00,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:00" (1/1) ... [2025-03-08 00:24:00,385 INFO L138 Inliner]: procedures = 15, calls = 54, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 131 [2025-03-08 00:24:00,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:24:00,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:24:00,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:24:00,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:24:00,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:00" (1/1) ... [2025-03-08 00:24:00,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:00" (1/1) ... [2025-03-08 00:24:00,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:00" (1/1) ... [2025-03-08 00:24:00,406 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 34, 8]. 77 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 0, 8]. The 20 writes are split as follows [0, 20, 0]. [2025-03-08 00:24:00,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:00" (1/1) ... [2025-03-08 00:24:00,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:00" (1/1) ... [2025-03-08 00:24:00,416 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:00" (1/1) ... [2025-03-08 00:24:00,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:00" (1/1) ... [2025-03-08 00:24:00,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:00" (1/1) ... [2025-03-08 00:24:00,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:00" (1/1) ... [2025-03-08 00:24:00,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:24:00,425 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:24:00,425 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:24:00,425 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:24:00,426 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:00" (1/1) ... [2025-03-08 00:24:00,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:24:00,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:00,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:24:00,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:24:00,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:24:00,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:24:00,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:24:00,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:24:00,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:24:00,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:24:00,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:24:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:24:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:24:00,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:24:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:24:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:24:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:24:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:24:00,535 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:24:00,537 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:24:00,705 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 00:24:00,706 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:24:00,714 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:24:00,715 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:24:00,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:24:00 BoogieIcfgContainer [2025-03-08 00:24:00,715 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:24:00,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:24:00,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:24:00,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:24:00,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:24:00" (1/3) ... [2025-03-08 00:24:00,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5092de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:24:00, skipping insertion in model container [2025-03-08 00:24:00,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:24:00" (2/3) ... [2025-03-08 00:24:00,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5092de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:24:00, skipping insertion in model container [2025-03-08 00:24:00,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:24:00" (3/3) ... [2025-03-08 00:24:00,723 INFO L128 eAbstractionObserver]: Analyzing ICFG mbpr4.c [2025-03-08 00:24:00,733 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:24:00,734 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mbpr4.c that has 1 procedures, 29 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-08 00:24:00,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:24:00,781 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;@6fa622a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:24:00,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:24:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 00:24:00,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:00,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:00,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:00,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:00,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1239568918, now seen corresponding path program 1 times [2025-03-08 00:24:00,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:00,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263533516] [2025-03-08 00:24:00,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:00,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:00,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 00:24:00,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:24:00,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:00,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:00,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:00,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263533516] [2025-03-08 00:24:00,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263533516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:24:00,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:24:00,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:24:00,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851154531] [2025-03-08 00:24:00,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:24:00,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:24:00,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:00,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:24:00,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:24:00,952 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:00,962 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2025-03-08 00:24:00,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:24:00,964 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-03-08 00:24:00,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:00,967 INFO L225 Difference]: With dead ends: 53 [2025-03-08 00:24:00,967 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 00:24:00,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:24:00,972 INFO L435 NwaCegarLoop]: 40 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, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:00,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:24:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 00:24:00,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 00:24:00,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-03-08 00:24:00,993 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 15 [2025-03-08 00:24:00,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:00,993 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-08 00:24:00,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:00,993 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-03-08 00:24:00,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 00:24:00,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:00,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:00,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:24:00,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:00,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:00,994 INFO L85 PathProgramCache]: Analyzing trace with hash -557382441, now seen corresponding path program 1 times [2025-03-08 00:24:00,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:00,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585958658] [2025-03-08 00:24:00,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:00,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:01,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 00:24:01,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:24:01,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:01,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:01,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:01,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585958658] [2025-03-08 00:24:01,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585958658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:24:01,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:24:01,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 00:24:01,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421639527] [2025-03-08 00:24:01,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:24:01,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:24:01,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:01,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:24:01,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:24:01,284 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:01,376 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2025-03-08 00:24:01,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:24:01,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-03-08 00:24:01,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:01,377 INFO L225 Difference]: With dead ends: 53 [2025-03-08 00:24:01,377 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 00:24:01,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:24:01,378 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 56 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:01,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 18 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:24:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 00:24:01,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2025-03-08 00:24:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:01,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2025-03-08 00:24:01,383 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 15 [2025-03-08 00:24:01,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:01,383 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2025-03-08 00:24:01,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:01,384 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2025-03-08 00:24:01,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 00:24:01,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:01,385 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] [2025-03-08 00:24:01,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:24:01,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:01,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:01,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1936116488, now seen corresponding path program 1 times [2025-03-08 00:24:01,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:01,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29708629] [2025-03-08 00:24:01,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:01,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:01,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 00:24:01,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:24:01,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:01,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:02,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:02,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29708629] [2025-03-08 00:24:02,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29708629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:02,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102935679] [2025-03-08 00:24:02,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:02,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:02,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:02,756 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:02,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:24:02,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 00:24:02,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:24:02,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:02,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:02,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 00:24:02,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:02,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:24:02,948 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 37 treesize of output 11 [2025-03-08 00:24:02,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:24:03,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 11 [2025-03-08 00:24:03,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:24:03,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:03,078 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 48 treesize of output 18 [2025-03-08 00:24:03,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:24:03,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:03,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 25 [2025-03-08 00:24:03,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:24:03,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:03,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:03,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-08 00:24:03,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-08 00:24:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:03,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102935679] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:03,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:03,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-03-08 00:24:03,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129720452] [2025-03-08 00:24:03,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:03,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 00:24:03,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:03,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 00:24:03,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:24:03,414 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:03,666 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2025-03-08 00:24:03,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:24:03,666 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 00:24:03,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:03,667 INFO L225 Difference]: With dead ends: 76 [2025-03-08 00:24:03,667 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 00:24:03,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:24:03,668 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 139 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:03,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 81 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:24:03,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 00:24:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2025-03-08 00:24:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2025-03-08 00:24:03,677 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 27 [2025-03-08 00:24:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:03,677 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2025-03-08 00:24:03,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2025-03-08 00:24:03,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 00:24:03,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:03,678 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] [2025-03-08 00:24:03,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:24:03,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:03,879 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:03,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:03,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1936086697, now seen corresponding path program 1 times [2025-03-08 00:24:03,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:03,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291413493] [2025-03-08 00:24:03,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:03,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:03,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 00:24:03,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:24:03,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:03,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:24:03,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:03,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291413493] [2025-03-08 00:24:03,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291413493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:24:03,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:24:03,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:24:03,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771867754] [2025-03-08 00:24:03,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:24:03,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:24:03,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:03,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:24:03,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:24:03,956 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:03,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:03,972 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-03-08 00:24:03,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:24:03,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 00:24:03,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:03,973 INFO L225 Difference]: With dead ends: 35 [2025-03-08 00:24:03,974 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 00:24:03,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:24:03,975 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:03,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:24:03,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 00:24:03,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-08 00:24:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2025-03-08 00:24:03,982 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 27 [2025-03-08 00:24:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:03,982 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-03-08 00:24:03,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2025-03-08 00:24:03,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 00:24:03,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:03,983 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] [2025-03-08 00:24:03,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:24:03,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:03,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:03,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1800935562, now seen corresponding path program 1 times [2025-03-08 00:24:03,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:03,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855342984] [2025-03-08 00:24:03,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:03,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:03,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 00:24:04,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:24:04,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:04,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:24:04,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:04,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855342984] [2025-03-08 00:24:04,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855342984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:04,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80647259] [2025-03-08 00:24:04,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:04,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:04,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:04,679 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:04,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:24:04,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 00:24:04,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:24:04,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:04,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:04,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 00:24:04,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:04,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:24:04,830 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 37 treesize of output 11 [2025-03-08 00:24:04,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:24:04,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2025-03-08 00:24:04,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:24:04,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:04,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 25 [2025-03-08 00:24:04,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:24:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:24:04,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:05,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-08 00:24:05,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-08 00:24:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:05,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80647259] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:05,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:05,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-08 00:24:05,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808240638] [2025-03-08 00:24:05,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:05,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 00:24:05,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:05,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 00:24:05,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:24:05,155 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:05,412 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2025-03-08 00:24:05,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:24:05,413 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-08 00:24:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:05,413 INFO L225 Difference]: With dead ends: 75 [2025-03-08 00:24:05,413 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 00:24:05,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:24:05,414 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 113 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:05,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 109 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:24:05,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 00:24:05,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2025-03-08 00:24:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-03-08 00:24:05,418 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 32 [2025-03-08 00:24:05,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:05,418 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-03-08 00:24:05,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-03-08 00:24:05,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:24:05,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:05,419 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] [2025-03-08 00:24:05,426 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-08 00:24:05,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:05,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:05,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:05,623 INFO L85 PathProgramCache]: Analyzing trace with hash -84208712, now seen corresponding path program 2 times [2025-03-08 00:24:05,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:05,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051105794] [2025-03-08 00:24:05,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:05,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:05,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 00:24:05,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:24:05,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:05,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:24:06,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:06,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051105794] [2025-03-08 00:24:06,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051105794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:06,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411701290] [2025-03-08 00:24:06,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:06,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:06,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:06,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:06,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:24:06,070 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 00:24:06,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:24:06,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:06,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:06,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 00:24:06,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:06,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:24:06,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:06,203 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 37 treesize of output 18 [2025-03-08 00:24:06,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:24:06,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:06,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 25 [2025-03-08 00:24:06,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:24:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:24:06,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:06,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-08 00:24:06,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-08 00:24:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:06,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411701290] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:06,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:06,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2025-03-08 00:24:06,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592051563] [2025-03-08 00:24:06,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:06,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 00:24:06,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:06,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 00:24:06,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:24:06,516 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 22 states, 22 states have (on average 4.5) internal successors, (99), 22 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:06,914 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2025-03-08 00:24:06,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:24:06,915 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.5) internal successors, (99), 22 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-08 00:24:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:06,916 INFO L225 Difference]: With dead ends: 90 [2025-03-08 00:24:06,916 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 00:24:06,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 00:24:06,917 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 85 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:06,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 122 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:24:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 00:24:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2025-03-08 00:24:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-08 00:24:06,922 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 37 [2025-03-08 00:24:06,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:06,923 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-08 00:24:06,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.5) internal successors, (99), 22 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:06,923 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-03-08 00:24:06,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 00:24:06,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:06,923 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] [2025-03-08 00:24:06,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:24:07,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:07,124 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:07,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:07,124 INFO L85 PathProgramCache]: Analyzing trace with hash 375603382, now seen corresponding path program 3 times [2025-03-08 00:24:07,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:07,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57327235] [2025-03-08 00:24:07,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:24:07,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:07,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-03-08 00:24:07,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 00:24:07,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:24:07,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:07,673 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:24:07,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:07,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57327235] [2025-03-08 00:24:07,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57327235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:07,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050041820] [2025-03-08 00:24:07,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:24:07,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:07,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:07,675 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:07,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:24:07,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-03-08 00:24:07,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 00:24:07,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:24:07,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:07,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 00:24:07,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:07,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 00:24:07,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:07,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 38 [2025-03-08 00:24:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:07,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:08,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-08 00:24:08,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-08 00:24:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:24:08,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050041820] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:08,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:08,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 32 [2025-03-08 00:24:08,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590140812] [2025-03-08 00:24:08,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:08,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 00:24:08,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:08,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 00:24:08,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:24:08,110 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 32 states, 32 states have (on average 3.15625) internal successors, (101), 32 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:09,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:09,224 INFO L93 Difference]: Finished difference Result 195 states and 231 transitions. [2025-03-08 00:24:09,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 00:24:09,224 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.15625) internal successors, (101), 32 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-08 00:24:09,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:09,226 INFO L225 Difference]: With dead ends: 195 [2025-03-08 00:24:09,226 INFO L226 Difference]: Without dead ends: 146 [2025-03-08 00:24:09,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=791, Invalid=4611, Unknown=0, NotChecked=0, Total=5402 [2025-03-08 00:24:09,229 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 290 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:09,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 145 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:24:09,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-08 00:24:09,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 89. [2025-03-08 00:24:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 88 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2025-03-08 00:24:09,240 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 42 [2025-03-08 00:24:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:09,240 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2025-03-08 00:24:09,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.15625) internal successors, (101), 32 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:09,240 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2025-03-08 00:24:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 00:24:09,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:09,241 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] [2025-03-08 00:24:09,248 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-08 00:24:09,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:09,442 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:09,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:09,442 INFO L85 PathProgramCache]: Analyzing trace with hash -869161099, now seen corresponding path program 1 times [2025-03-08 00:24:09,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:09,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742260368] [2025-03-08 00:24:09,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:24:09,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:09,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 00:24:09,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 00:24:09,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:09,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:09,490 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 00:24:09,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:09,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742260368] [2025-03-08 00:24:09,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742260368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:24:09,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:24:09,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:24:09,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072370173] [2025-03-08 00:24:09,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:24:09,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:24:09,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:09,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:24:09,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:24:09,493 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:09,506 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2025-03-08 00:24:09,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:24:09,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-08 00:24:09,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:09,507 INFO L225 Difference]: With dead ends: 121 [2025-03-08 00:24:09,507 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 00:24:09,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:24:09,509 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:09,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 26 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:24:09,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 00:24:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2025-03-08 00:24:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2025-03-08 00:24:09,517 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 42 [2025-03-08 00:24:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:09,517 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2025-03-08 00:24:09,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2025-03-08 00:24:09,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 00:24:09,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:09,518 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 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] [2025-03-08 00:24:09,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 00:24:09,518 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:09,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:09,518 INFO L85 PathProgramCache]: Analyzing trace with hash 652787382, now seen corresponding path program 4 times [2025-03-08 00:24:09,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:09,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203823895] [2025-03-08 00:24:09,520 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:24:09,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:09,605 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-03-08 00:24:09,639 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 00:24:09,640 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:24:09,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:10,912 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:24:10,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:10,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203823895] [2025-03-08 00:24:10,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203823895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:10,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581013472] [2025-03-08 00:24:10,913 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:24:10,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:10,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:10,915 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:10,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:24:10,971 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-03-08 00:24:11,007 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 00:24:11,007 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:24:11,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:11,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-08 00:24:11,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:11,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:24:11,121 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 37 treesize of output 11 [2025-03-08 00:24:11,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:24:11,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:11,206 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 21 [2025-03-08 00:24:11,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:11,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2025-03-08 00:24:11,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:11,288 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 59 treesize of output 28 [2025-03-08 00:24:11,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:11,353 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 30 treesize of output 35 [2025-03-08 00:24:11,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:11,393 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 55 treesize of output 38 [2025-03-08 00:24:11,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:11,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 42 [2025-03-08 00:24:11,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:11,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 45 [2025-03-08 00:24:11,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:11,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 45 treesize of output 45 [2025-03-08 00:24:11,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:11,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 59 treesize of output 52 [2025-03-08 00:24:11,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:11,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 45 treesize of output 45 [2025-03-08 00:24:11,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:11,615 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 59 treesize of output 45 [2025-03-08 00:24:11,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:11,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 13 [2025-03-08 00:24:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:11,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:16,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-08 00:24:16,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-08 00:24:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:24:16,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581013472] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:16,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:16,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22, 13] total 42 [2025-03-08 00:24:16,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188671498] [2025-03-08 00:24:16,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:16,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 00:24:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:16,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 00:24:16,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1532, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 00:24:16,439 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 42 states, 42 states have (on average 3.642857142857143) internal successors, (153), 42 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:20,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 00:24:24,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 00:24:29,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 00:24:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:31,708 INFO L93 Difference]: Finished difference Result 310 states and 356 transitions. [2025-03-08 00:24:31,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-08 00:24:31,709 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.642857142857143) internal successors, (153), 42 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-08 00:24:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:31,710 INFO L225 Difference]: With dead ends: 310 [2025-03-08 00:24:31,710 INFO L226 Difference]: Without dead ends: 301 [2025-03-08 00:24:31,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 94 SyntacticMatches, 10 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4110 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1810, Invalid=11762, Unknown=0, NotChecked=0, Total=13572 [2025-03-08 00:24:31,713 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 820 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 303 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:31,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 366 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1782 Invalid, 3 Unknown, 0 Unchecked, 13.4s Time] [2025-03-08 00:24:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-08 00:24:31,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 117. [2025-03-08 00:24:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.1293103448275863) internal successors, (131), 116 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2025-03-08 00:24:31,727 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 59 [2025-03-08 00:24:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:31,727 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2025-03-08 00:24:31,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.642857142857143) internal successors, (153), 42 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2025-03-08 00:24:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 00:24:31,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:31,731 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 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] [2025-03-08 00:24:31,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 00:24:31,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:31,931 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:31,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:31,932 INFO L85 PathProgramCache]: Analyzing trace with hash 534692984, now seen corresponding path program 5 times [2025-03-08 00:24:31,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:31,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260236006] [2025-03-08 00:24:31,932 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:24:31,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:31,943 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 64 statements into 6 equivalence classes. [2025-03-08 00:24:31,984 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 00:24:31,984 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:24:31,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:32,943 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:32,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:32,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260236006] [2025-03-08 00:24:32,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260236006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:32,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007833281] [2025-03-08 00:24:32,944 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:24:32,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:32,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:32,946 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:32,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:24:33,007 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 64 statements into 6 equivalence classes. [2025-03-08 00:24:33,636 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 00:24:33,636 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:24:33,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:33,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-08 00:24:33,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:33,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:24:33,757 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 37 treesize of output 11 [2025-03-08 00:24:33,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:24:33,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:33,830 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 28 [2025-03-08 00:24:33,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:33,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2025-03-08 00:24:33,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:33,893 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 48 treesize of output 28 [2025-03-08 00:24:33,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:33,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 28 [2025-03-08 00:24:33,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:33,975 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 48 treesize of output 42 [2025-03-08 00:24:33,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:33,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 28 [2025-03-08 00:24:34,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:34,012 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 48 treesize of output 35 [2025-03-08 00:24:34,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:34,330 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 26 treesize of output 10 [2025-03-08 00:24:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 75 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:24:34,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:34,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-08 00:24:34,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-08 00:24:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:24:34,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007833281] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:34,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:34,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 13] total 40 [2025-03-08 00:24:34,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358474025] [2025-03-08 00:24:34,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:34,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 00:24:34,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:34,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 00:24:34,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1376, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 00:24:34,723 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 40 states, 40 states have (on average 4.2) internal successors, (168), 40 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:36,534 INFO L93 Difference]: Finished difference Result 290 states and 329 transitions. [2025-03-08 00:24:36,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-08 00:24:36,535 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.2) internal successors, (168), 40 states have internal predecessors, (168), 0 states have call successors, (0), 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 64 [2025-03-08 00:24:36,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:36,536 INFO L225 Difference]: With dead ends: 290 [2025-03-08 00:24:36,536 INFO L226 Difference]: Without dead ends: 276 [2025-03-08 00:24:36,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 110 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2530 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1094, Invalid=7278, Unknown=0, NotChecked=0, Total=8372 [2025-03-08 00:24:36,538 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 419 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:36,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 342 Invalid, 1887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 00:24:36,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-08 00:24:36,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 114. [2025-03-08 00:24:36,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.1238938053097345) internal successors, (127), 113 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2025-03-08 00:24:36,551 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 64 [2025-03-08 00:24:36,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:36,552 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2025-03-08 00:24:36,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.2) internal successors, (168), 40 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:36,553 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2025-03-08 00:24:36,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 00:24:36,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:36,555 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 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] [2025-03-08 00:24:36,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 00:24:36,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:36,756 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:36,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:36,756 INFO L85 PathProgramCache]: Analyzing trace with hash 775111480, now seen corresponding path program 6 times [2025-03-08 00:24:36,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:36,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400986191] [2025-03-08 00:24:36,756 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:24:36,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:36,767 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 74 statements into 8 equivalence classes. [2025-03-08 00:24:36,806 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 00:24:36,807 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-08 00:24:36,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 75 proven. 68 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:24:37,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:37,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400986191] [2025-03-08 00:24:37,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400986191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:37,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142794938] [2025-03-08 00:24:37,585 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:24:37,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:37,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:37,587 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:37,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:24:37,648 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 74 statements into 8 equivalence classes. [2025-03-08 00:24:38,159 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 00:24:38,159 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-08 00:24:38,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:38,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 00:24:38,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:38,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 00:24:38,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:38,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 40 [2025-03-08 00:24:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:24:38,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:38,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-08 00:24:38,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-08 00:24:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:24:38,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142794938] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:38,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:38,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 42 [2025-03-08 00:24:38,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118935724] [2025-03-08 00:24:38,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:38,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 00:24:38,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:38,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 00:24:38,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1563, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 00:24:38,650 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:40,505 INFO L93 Difference]: Finished difference Result 255 states and 282 transitions. [2025-03-08 00:24:40,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-08 00:24:40,505 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 states have internal predecessors, (168), 0 states have call successors, (0), 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 74 [2025-03-08 00:24:40,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:40,506 INFO L225 Difference]: With dead ends: 255 [2025-03-08 00:24:40,506 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 00:24:40,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3035 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=999, Invalid=9101, Unknown=0, NotChecked=0, Total=10100 [2025-03-08 00:24:40,508 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 240 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:40,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 285 Invalid, 1813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 00:24:40,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 00:24:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 173. [2025-03-08 00:24:40,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.1046511627906976) internal successors, (190), 172 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 190 transitions. [2025-03-08 00:24:40,528 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 190 transitions. Word has length 74 [2025-03-08 00:24:40,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:40,528 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 190 transitions. [2025-03-08 00:24:40,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 190 transitions. [2025-03-08 00:24:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 00:24:40,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:40,529 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:40,537 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-08 00:24:40,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:40,730 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:40,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1075526257, now seen corresponding path program 7 times [2025-03-08 00:24:40,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:40,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561113089] [2025-03-08 00:24:40,730 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:24:40,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:40,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 00:24:40,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 00:24:40,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:40,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 00:24:40,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:40,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561113089] [2025-03-08 00:24:40,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561113089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:40,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124100206] [2025-03-08 00:24:40,987 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:24:40,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:40,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:40,989 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:40,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:24:41,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 00:24:41,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 00:24:41,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:24:41,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:41,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:24:41,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 00:24:41,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 00:24:41,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124100206] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:41,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:41,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2025-03-08 00:24:41,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406784627] [2025-03-08 00:24:41,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:41,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 00:24:41,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:41,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 00:24:41,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:24:41,356 INFO L87 Difference]: Start difference. First operand 173 states and 190 transitions. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:41,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:41,641 INFO L93 Difference]: Finished difference Result 364 states and 400 transitions. [2025-03-08 00:24:41,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:24:41,641 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-08 00:24:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:41,643 INFO L225 Difference]: With dead ends: 364 [2025-03-08 00:24:41,643 INFO L226 Difference]: Without dead ends: 187 [2025-03-08 00:24:41,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 144 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:24:41,644 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 181 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:41,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 82 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:24:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-08 00:24:41,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 179. [2025-03-08 00:24:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.095505617977528) internal successors, (195), 178 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 195 transitions. [2025-03-08 00:24:41,665 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 195 transitions. Word has length 78 [2025-03-08 00:24:41,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:41,666 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 195 transitions. [2025-03-08 00:24:41,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:41,666 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 195 transitions. [2025-03-08 00:24:41,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 00:24:41,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:41,668 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:24:41,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 00:24:41,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 00:24:41,868 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:41,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:41,869 INFO L85 PathProgramCache]: Analyzing trace with hash -550162736, now seen corresponding path program 8 times [2025-03-08 00:24:41,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:41,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819916834] [2025-03-08 00:24:41,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:41,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:41,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-03-08 00:24:41,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 00:24:41,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:41,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-08 00:24:42,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:42,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819916834] [2025-03-08 00:24:42,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819916834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:42,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267037701] [2025-03-08 00:24:42,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:24:42,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:42,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:42,066 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:42,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:24:42,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-03-08 00:24:42,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 00:24:42,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:24:42,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:42,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:24:42,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-03-08 00:24:42,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-03-08 00:24:42,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267037701] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:42,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:42,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2025-03-08 00:24:42,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725130219] [2025-03-08 00:24:42,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:42,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 00:24:42,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:42,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 00:24:42,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:24:42,524 INFO L87 Difference]: Start difference. First operand 179 states and 195 transitions. Second operand has 23 states, 23 states have (on average 3.739130434782609) internal successors, (86), 23 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:42,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:24:42,967 INFO L93 Difference]: Finished difference Result 346 states and 382 transitions. [2025-03-08 00:24:42,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 00:24:42,967 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.739130434782609) internal successors, (86), 23 states have internal predecessors, (86), 0 states have call successors, (0), 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 84 [2025-03-08 00:24:42,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:24:42,968 INFO L225 Difference]: With dead ends: 346 [2025-03-08 00:24:42,968 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 00:24:42,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 157 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=343, Invalid=1379, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 00:24:42,969 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 335 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:24:42,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 61 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:24:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 00:24:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 181. [2025-03-08 00:24:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.0944444444444446) internal successors, (197), 180 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 197 transitions. [2025-03-08 00:24:42,989 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 197 transitions. Word has length 84 [2025-03-08 00:24:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:24:42,989 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 197 transitions. [2025-03-08 00:24:42,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.739130434782609) internal successors, (86), 23 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:24:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2025-03-08 00:24:42,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 00:24:42,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:24:42,989 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 6, 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] [2025-03-08 00:24:42,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 00:24:43,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 00:24:43,190 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:24:43,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:24:43,190 INFO L85 PathProgramCache]: Analyzing trace with hash -885571818, now seen corresponding path program 9 times [2025-03-08 00:24:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:24:43,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322684333] [2025-03-08 00:24:43,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:24:43,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:24:43,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 9 equivalence classes. [2025-03-08 00:24:43,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 00:24:43,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-08 00:24:43,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 17 proven. 202 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:24:46,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:24:46,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322684333] [2025-03-08 00:24:46,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322684333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:24:46,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800990259] [2025-03-08 00:24:46,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:24:46,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:24:46,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:24:46,173 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:24:46,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:24:46,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 9 equivalence classes. [2025-03-08 00:24:48,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 00:24:48,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-08 00:24:48,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:24:48,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-08 00:24:48,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:24:48,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:24:48,336 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 37 treesize of output 11 [2025-03-08 00:24:48,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:24:48,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:48,428 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 21 [2025-03-08 00:24:48,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:48,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 00:24:48,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:48,513 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 31 [2025-03-08 00:24:48,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:48,561 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 35 [2025-03-08 00:24:48,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:48,617 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 70 treesize of output 38 [2025-03-08 00:24:48,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:48,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 45 [2025-03-08 00:24:48,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:48,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 48 [2025-03-08 00:24:48,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:48,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 55 [2025-03-08 00:24:48,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:48,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 73 treesize of output 58 [2025-03-08 00:24:49,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:49,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 56 treesize of output 62 [2025-03-08 00:24:49,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:49,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 92 treesize of output 65 [2025-03-08 00:24:49,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:49,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 67 treesize of output 65 [2025-03-08 00:24:49,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:49,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 81 treesize of output 72 [2025-03-08 00:24:49,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:49,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 67 treesize of output 65 [2025-03-08 00:24:49,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:49,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 81 treesize of output 72 [2025-03-08 00:24:49,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:49,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 67 treesize of output 65 [2025-03-08 00:24:49,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:49,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 65 [2025-03-08 00:24:50,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:24:50,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 59 treesize of output 19 [2025-03-08 00:24:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 16 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:50,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:24:52,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-08 00:24:52,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-08 00:24:52,756 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 28 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:24:52,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800990259] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:24:52,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:24:52,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 36, 29] total 88 [2025-03-08 00:24:52,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138949817] [2025-03-08 00:24:52,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:24:52,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2025-03-08 00:24:52,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:24:52,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2025-03-08 00:24:52,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=6871, Unknown=0, NotChecked=0, Total=7656 [2025-03-08 00:24:52,760 INFO L87 Difference]: Start difference. First operand 181 states and 197 transitions. Second operand has 88 states, 88 states have (on average 2.977272727272727) internal successors, (262), 88 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:25:03,874 INFO L93 Difference]: Finished difference Result 421 states and 466 transitions. [2025-03-08 00:25:03,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2025-03-08 00:25:03,874 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 2.977272727272727) internal successors, (262), 88 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-08 00:25:03,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:25:03,876 INFO L225 Difference]: With dead ends: 421 [2025-03-08 00:25:03,876 INFO L226 Difference]: Without dead ends: 412 [2025-03-08 00:25:03,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 121 SyntacticMatches, 16 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21393 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=6892, Invalid=56360, Unknown=0, NotChecked=0, Total=63252 [2025-03-08 00:25:03,881 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1918 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 3933 mSolverCounterSat, 962 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1918 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 4895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 962 IncrementalHoareTripleChecker+Valid, 3933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:25:03,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1918 Valid, 762 Invalid, 4895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [962 Valid, 3933 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 00:25:03,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-08 00:25:03,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 243. [2025-03-08 00:25:03,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 1.078512396694215) internal successors, (261), 242 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 261 transitions. [2025-03-08 00:25:03,913 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 261 transitions. Word has length 91 [2025-03-08 00:25:03,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:25:03,913 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 261 transitions. [2025-03-08 00:25:03,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 2.977272727272727) internal successors, (262), 88 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 261 transitions. [2025-03-08 00:25:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 00:25:03,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:25:03,914 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:25:03,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 00:25:04,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 00:25:04,114 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:25:04,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:25:04,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1973649482, now seen corresponding path program 10 times [2025-03-08 00:25:04,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:25:04,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692657237] [2025-03-08 00:25:04,115 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:25:04,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:25:04,128 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-08 00:25:04,136 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 00:25:04,136 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:25:04,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-08 00:25:04,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:25:04,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692657237] [2025-03-08 00:25:04,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692657237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:25:04,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884599645] [2025-03-08 00:25:04,418 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:25:04,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:04,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:25:04,420 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:25:04,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 00:25:04,521 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-08 00:25:04,563 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 00:25:04,564 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:25:04,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:04,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:25:04,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:25:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-08 00:25:04,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:25:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-08 00:25:05,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884599645] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:25:05,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:25:05,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-03-08 00:25:05,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618100140] [2025-03-08 00:25:05,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:25:05,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 00:25:05,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:25:05,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 00:25:05,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:25:05,061 INFO L87 Difference]: Start difference. First operand 243 states and 261 transitions. Second operand has 27 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 27 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:25:06,196 INFO L93 Difference]: Finished difference Result 497 states and 539 transitions. [2025-03-08 00:25:06,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 00:25:06,197 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 27 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 93 [2025-03-08 00:25:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:25:06,198 INFO L225 Difference]: With dead ends: 497 [2025-03-08 00:25:06,198 INFO L226 Difference]: Without dead ends: 293 [2025-03-08 00:25:06,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 174 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=729, Invalid=3827, Unknown=0, NotChecked=0, Total=4556 [2025-03-08 00:25:06,199 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 717 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:25:06,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 334 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:25:06,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-08 00:25:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 268. [2025-03-08 00:25:06,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.0636704119850187) internal successors, (284), 267 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:06,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 284 transitions. [2025-03-08 00:25:06,235 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 284 transitions. Word has length 93 [2025-03-08 00:25:06,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:25:06,235 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 284 transitions. [2025-03-08 00:25:06,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 27 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:25:06,235 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 284 transitions. [2025-03-08 00:25:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 00:25:06,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:25:06,236 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:25:06,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 00:25:06,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 00:25:06,437 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:25:06,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:25:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash -69635696, now seen corresponding path program 11 times [2025-03-08 00:25:06,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:25:06,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231407717] [2025-03-08 00:25:06,437 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:25:06,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:25:06,453 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 102 statements into 7 equivalence classes. [2025-03-08 00:25:06,474 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 00:25:06,474 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-08 00:25:06,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:25:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 8 proven. 49 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-03-08 00:25:06,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:25:06,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231407717] [2025-03-08 00:25:06,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231407717] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:25:06,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343760319] [2025-03-08 00:25:06,794 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:25:06,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:25:06,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:25:06,796 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:25:06,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 00:25:06,894 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 102 statements into 7 equivalence classes.