./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/theatreSquare.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/theatreSquare.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 90f363148c6ea94b18bb0ae0702d2476b109719554576ef0704192e7e62145c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:39:39,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:39:39,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:39:39,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:39:39,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:39:39,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:39:39,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:39:39,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:39:39,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:39:39,756 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:39:39,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:39:39,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:39:39,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:39:39,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:39:39,758 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:39:39,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:39:39,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:39:39,758 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:39:39,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:39:39,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:39:39,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:39:39,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:39:39,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:39:39,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:39:39,759 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:39:39,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:39:39,759 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:39:39,759 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:39:39,759 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:39:39,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:39:39,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:39:39,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:39:39,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:39:39,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:39:39,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:39:39,760 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:39:39,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:39:39,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:39:39,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:39:39,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:39:39,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:39:39,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:39:39,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:39:39,761 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 -> 90f363148c6ea94b18bb0ae0702d2476b109719554576ef0704192e7e62145c3 [2025-03-03 13:39:39,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:39:39,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:39:39,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:39:39,970 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:39:39,971 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:39:39,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/theatreSquare.c [2025-03-03 13:39:41,055 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4833dfcd5/703cead613724554b2bc9a3d0ed42395/FLAG3e71f8b68 [2025-03-03 13:39:41,251 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:39:41,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/theatreSquare.c [2025-03-03 13:39:41,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4833dfcd5/703cead613724554b2bc9a3d0ed42395/FLAG3e71f8b68 [2025-03-03 13:39:41,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4833dfcd5/703cead613724554b2bc9a3d0ed42395 [2025-03-03 13:39:41,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:39:41,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:39:41,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:39:41,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:39:41,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:39:41,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:39:41" (1/1) ... [2025-03-03 13:39:41,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ede9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:41, skipping insertion in model container [2025-03-03 13:39:41,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:39:41" (1/1) ... [2025-03-03 13:39:41,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:39:41,388 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/loops-crafted-1/theatreSquare.c[370,383] [2025-03-03 13:39:41,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:39:41,415 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:39:41,421 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/loops-crafted-1/theatreSquare.c[370,383] [2025-03-03 13:39:41,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:39:41,444 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:39:41,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:41 WrapperNode [2025-03-03 13:39:41,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:39:41,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:39:41,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:39:41,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:39:41,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:41" (1/1) ... [2025-03-03 13:39:41,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:41" (1/1) ... [2025-03-03 13:39:41,468 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 85 [2025-03-03 13:39:41,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:39:41,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:39:41,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:39:41,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:39:41,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:41" (1/1) ... [2025-03-03 13:39:41,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:41" (1/1) ... [2025-03-03 13:39:41,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:41" (1/1) ... [2025-03-03 13:39:41,486 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 13:39:41,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:41" (1/1) ... [2025-03-03 13:39:41,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:41" (1/1) ... [2025-03-03 13:39:41,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:41" (1/1) ... [2025-03-03 13:39:41,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:41" (1/1) ... [2025-03-03 13:39:41,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:41" (1/1) ... [2025-03-03 13:39:41,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:41" (1/1) ... [2025-03-03 13:39:41,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:39:41,497 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:39:41,497 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:39:41,498 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:39:41,498 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:41" (1/1) ... [2025-03-03 13:39:41,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:39:41,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:41,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 13:39:41,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 13:39:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:39:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:39:41,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:39:41,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:39:41,580 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:39:41,582 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:39:41,696 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-03 13:39:41,697 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:39:41,702 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:39:41,702 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:39:41,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:39:41 BoogieIcfgContainer [2025-03-03 13:39:41,702 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:39:41,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:39:41,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:39:41,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:39:41,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:39:41" (1/3) ... [2025-03-03 13:39:41,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3d1cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:39:41, skipping insertion in model container [2025-03-03 13:39:41,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:41" (2/3) ... [2025-03-03 13:39:41,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3d1cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:39:41, skipping insertion in model container [2025-03-03 13:39:41,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:39:41" (3/3) ... [2025-03-03 13:39:41,709 INFO L128 eAbstractionObserver]: Analyzing ICFG theatreSquare.c [2025-03-03 13:39:41,718 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:39:41,720 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG theatreSquare.c that has 1 procedures, 19 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-03 13:39:41,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:39:41,760 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;@2c88abbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:39:41,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:39:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:41,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-03 13:39:41,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:41,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-03 13:39:41,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:41,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:41,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1714837421, now seen corresponding path program 1 times [2025-03-03 13:39:41,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:41,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660756693] [2025-03-03 13:39:41,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:41,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:41,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-03 13:39:41,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-03 13:39:41,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:41,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:39:41,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:41,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660756693] [2025-03-03 13:39:41,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660756693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:41,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:39:41,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:39:41,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589244658] [2025-03-03 13:39:41,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:41,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:39:41,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:41,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:39:41,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:39:41,996 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:42,028 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2025-03-03 13:39:42,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:39:42,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-03-03 13:39:42,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:42,034 INFO L225 Difference]: With dead ends: 27 [2025-03-03 13:39:42,034 INFO L226 Difference]: Without dead ends: 15 [2025-03-03 13:39:42,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:39:42,039 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:42,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 55 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-03 13:39:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-03 13:39:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2025-03-03 13:39:42,064 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 6 [2025-03-03 13:39:42,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:42,065 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-03 13:39:42,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:42,065 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2025-03-03 13:39:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 13:39:42,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:42,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:42,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:39:42,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:42,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:42,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1106869208, now seen corresponding path program 1 times [2025-03-03 13:39:42,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:42,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310178745] [2025-03-03 13:39:42,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:42,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:42,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 13:39:42,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 13:39:42,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:42,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:39:42,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:42,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310178745] [2025-03-03 13:39:42,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310178745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:42,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:39:42,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 13:39:42,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621126740] [2025-03-03 13:39:42,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:42,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 13:39:42,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:42,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 13:39:42,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:39:42,255 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:42,356 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2025-03-03 13:39:42,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:39:42,357 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-03-03 13:39:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:42,357 INFO L225 Difference]: With dead ends: 28 [2025-03-03 13:39:42,357 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 13:39:42,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:39:42,358 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:42,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 93 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 13:39:42,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2025-03-03 13:39:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2025-03-03 13:39:42,364 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 14 [2025-03-03 13:39:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:42,364 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2025-03-03 13:39:42,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2025-03-03 13:39:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 13:39:42,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:42,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:42,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:39:42,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:42,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:42,365 INFO L85 PathProgramCache]: Analyzing trace with hash -16284978, now seen corresponding path program 1 times [2025-03-03 13:39:42,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:42,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458074880] [2025-03-03 13:39:42,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:42,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:42,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 13:39:42,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:39:42,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:42,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:39:42,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:42,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458074880] [2025-03-03 13:39:42,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458074880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:42,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:39:42,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:39:42,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121981056] [2025-03-03 13:39:42,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:42,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:39:42,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:42,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:39:42,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:39:42,463 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-03 13:39:42,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:42,475 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2025-03-03 13:39:42,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:39:42,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-03 13:39:42,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:42,477 INFO L225 Difference]: With dead ends: 32 [2025-03-03 13:39:42,477 INFO L226 Difference]: Without dead ends: 24 [2025-03-03 13:39:42,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:39:42,478 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:42,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:42,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-03 13:39:42,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-03 13:39:42,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2025-03-03 13:39:42,482 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2025-03-03 13:39:42,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:42,482 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-03-03 13:39:42,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-03 13:39:42,483 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2025-03-03 13:39:42,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 13:39:42,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:42,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:42,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:39:42,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:42,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:42,483 INFO L85 PathProgramCache]: Analyzing trace with hash 606243120, now seen corresponding path program 1 times [2025-03-03 13:39:42,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:42,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681944126] [2025-03-03 13:39:42,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:42,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:42,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 13:39:42,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:39:42,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:42,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:39:42,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:42,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681944126] [2025-03-03 13:39:42,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681944126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:42,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:39:42,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:39:42,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636624603] [2025-03-03 13:39:42,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:42,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:39:42,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:42,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:39:42,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:39:42,550 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-03 13:39:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:42,562 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2025-03-03 13:39:42,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:39:42,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-03 13:39:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:42,563 INFO L225 Difference]: With dead ends: 40 [2025-03-03 13:39:42,563 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 13:39:42,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:39:42,564 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:42,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:42,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 13:39:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-03 13:39:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2025-03-03 13:39:42,570 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 15 [2025-03-03 13:39:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:42,570 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2025-03-03 13:39:42,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-03 13:39:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2025-03-03 13:39:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 13:39:42,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:42,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:42,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 13:39:42,571 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:42,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:42,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1150403381, now seen corresponding path program 1 times [2025-03-03 13:39:42,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:42,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382753436] [2025-03-03 13:39:42,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:42,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:42,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 13:39:42,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 13:39:42,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:42,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:39:42,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:42,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382753436] [2025-03-03 13:39:42,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382753436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:42,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:39:42,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:39:42,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374854656] [2025-03-03 13:39:42,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:42,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:39:42,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:42,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:39:42,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:39:42,651 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:42,665 INFO L93 Difference]: Finished difference Result 49 states and 71 transitions. [2025-03-03 13:39:42,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:39:42,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-03 13:39:42,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:42,666 INFO L225 Difference]: With dead ends: 49 [2025-03-03 13:39:42,666 INFO L226 Difference]: Without dead ends: 29 [2025-03-03 13:39:42,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:39:42,667 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:42,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-03 13:39:42,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-03 13:39:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 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-03 13:39:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2025-03-03 13:39:42,674 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 16 [2025-03-03 13:39:42,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:42,674 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2025-03-03 13:39:42,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2025-03-03 13:39:42,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 13:39:42,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:42,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:42,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 13:39:42,675 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:42,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:42,675 INFO L85 PathProgramCache]: Analyzing trace with hash 287933843, now seen corresponding path program 1 times [2025-03-03 13:39:42,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:42,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306175806] [2025-03-03 13:39:42,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:42,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 13:39:42,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 13:39:42,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:42,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:42,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:39:42,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:42,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306175806] [2025-03-03 13:39:42,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306175806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:42,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:39:42,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:39:42,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160574693] [2025-03-03 13:39:42,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:42,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:39:42,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:42,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:39:42,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:39:42,741 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:42,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:42,757 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2025-03-03 13:39:42,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:39:42,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-03 13:39:42,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:42,758 INFO L225 Difference]: With dead ends: 34 [2025-03-03 13:39:42,759 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 13:39:42,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:39:42,764 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:42,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:42,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 13:39:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-03 13:39:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:42,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2025-03-03 13:39:42,770 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 17 [2025-03-03 13:39:42,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:42,770 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2025-03-03 13:39:42,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:42,770 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2025-03-03 13:39:42,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 13:39:42,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:42,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:42,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 13:39:42,772 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:42,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:42,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1370525523, now seen corresponding path program 1 times [2025-03-03 13:39:42,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:42,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583980720] [2025-03-03 13:39:42,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:42,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:42,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 13:39:42,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 13:39:42,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:42,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:39:42,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:42,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583980720] [2025-03-03 13:39:42,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583980720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:42,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:39:42,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:39:42,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999308836] [2025-03-03 13:39:42,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:42,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:39:42,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:42,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:39:42,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:39:42,821 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:42,832 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2025-03-03 13:39:42,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:39:42,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-03 13:39:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:42,833 INFO L225 Difference]: With dead ends: 38 [2025-03-03 13:39:42,833 INFO L226 Difference]: Without dead ends: 24 [2025-03-03 13:39:42,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:39:42,833 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:42,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:42,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-03 13:39:42,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-03 13:39:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2025-03-03 13:39:42,839 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 17 [2025-03-03 13:39:42,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:42,839 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-03-03 13:39:42,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:42,839 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2025-03-03 13:39:42,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:39:42,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:42,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:42,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 13:39:42,840 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:42,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:42,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1876442482, now seen corresponding path program 1 times [2025-03-03 13:39:42,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:42,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196363837] [2025-03-03 13:39:42,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:42,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:42,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:39:42,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:39:42,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:42,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:42,895 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-03 13:39:42,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:42,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196363837] [2025-03-03 13:39:42,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196363837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:42,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223757484] [2025-03-03 13:39:42,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:42,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:42,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:42,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:42,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 13:39:42,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:39:42,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:39:42,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:42,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:42,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 13:39:42,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:39:42,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:39:42,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223757484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:42,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:39:42,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-03 13:39:42,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043504892] [2025-03-03 13:39:42,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:42,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:39:42,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:42,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:39:42,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:39:42,994 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:43,010 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2025-03-03 13:39:43,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:39:43,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-03-03 13:39:43,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:43,011 INFO L225 Difference]: With dead ends: 30 [2025-03-03 13:39:43,011 INFO L226 Difference]: Without dead ends: 19 [2025-03-03 13:39:43,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:39:43,011 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:43,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 43 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:43,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-03 13:39:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-03 13:39:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-03-03 13:39:43,014 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 18 [2025-03-03 13:39:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:43,014 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-03 13:39:43,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:43,014 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2025-03-03 13:39:43,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:39:43,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:43,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:43,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 13:39:43,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:43,220 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:43,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:43,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1314852342, now seen corresponding path program 1 times [2025-03-03 13:39:43,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:43,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4954639] [2025-03-03 13:39:43,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:43,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:43,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:39:43,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:39:43,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:43,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:43,264 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-03 13:39:43,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:43,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4954639] [2025-03-03 13:39:43,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4954639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:43,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045243215] [2025-03-03 13:39:43,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:43,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:43,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:43,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:43,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 13:39:43,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:39:43,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:39:43,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:43,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:43,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:39:43,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:43,350 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-03 13:39:43,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:39:43,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045243215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:43,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:39:43,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-03 13:39:43,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981145190] [2025-03-03 13:39:43,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:43,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:39:43,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:43,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:39:43,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:39:43,351 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:43,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:43,361 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2025-03-03 13:39:43,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:39:43,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-03-03 13:39:43,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:43,362 INFO L225 Difference]: With dead ends: 26 [2025-03-03 13:39:43,362 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 13:39:43,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:39:43,363 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:43,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 13:39:43,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-03 13:39:43,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-03 13:39:43,365 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 18 [2025-03-03 13:39:43,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:43,365 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-03 13:39:43,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-03-03 13:39:43,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 13:39:43,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:43,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:43,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:43,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 13:39:43,570 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:43,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:43,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1242609584, now seen corresponding path program 1 times [2025-03-03 13:39:43,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:43,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426719936] [2025-03-03 13:39:43,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:43,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:43,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:39:43,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:39:43,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:43,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:43,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:43,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426719936] [2025-03-03 13:39:43,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426719936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:43,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543600723] [2025-03-03 13:39:43,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:43,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:43,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:43,623 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:43,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:39:43,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:39:43,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:39:43,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:43,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:43,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 13:39:43,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:43,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:39:43,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543600723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:43,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:39:43,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-03 13:39:43,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810922830] [2025-03-03 13:39:43,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:43,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:39:43,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:43,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:39:43,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:39:43,690 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:43,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:43,706 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2025-03-03 13:39:43,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:39:43,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-03 13:39:43,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:43,707 INFO L225 Difference]: With dead ends: 26 [2025-03-03 13:39:43,707 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 13:39:43,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:39:43,707 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:43,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 43 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:43,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 13:39:43,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-03 13:39:43,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-03-03 13:39:43,713 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 19 [2025-03-03 13:39:43,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:43,713 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-03 13:39:43,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:43,713 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2025-03-03 13:39:43,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 13:39:43,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:43,714 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] [2025-03-03 13:39:43,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 13:39:43,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:43,918 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:43,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:43,918 INFO L85 PathProgramCache]: Analyzing trace with hash 164316502, now seen corresponding path program 1 times [2025-03-03 13:39:43,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:43,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939523510] [2025-03-03 13:39:43,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:43,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:43,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 13:39:43,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:39:43,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:43,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:39:44,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:44,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939523510] [2025-03-03 13:39:44,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939523510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:44,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207647198] [2025-03-03 13:39:44,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:44,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:44,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:44,101 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:44,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:39:44,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 13:39:44,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:39:44,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:44,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:44,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 13:39:44,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:39:44,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:39:44,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207647198] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:44,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:44,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 23 [2025-03-03 13:39:44,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536013296] [2025-03-03 13:39:44,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:44,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 13:39:44,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:44,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 13:39:44,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:39:44,368 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:44,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:44,534 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2025-03-03 13:39:44,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 13:39:44,534 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-03 13:39:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:44,535 INFO L225 Difference]: With dead ends: 40 [2025-03-03 13:39:44,535 INFO L226 Difference]: Without dead ends: 35 [2025-03-03 13:39:44,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2025-03-03 13:39:44,535 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:44,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 158 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:39:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-03 13:39:44,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2025-03-03 13:39:44,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-03-03 13:39:44,543 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 20 [2025-03-03 13:39:44,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:44,543 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-03-03 13:39:44,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-03-03 13:39:44,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 13:39:44,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:44,543 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:44,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:44,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:44,744 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:44,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash 829352208, now seen corresponding path program 2 times [2025-03-03 13:39:44,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:44,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635229823] [2025-03-03 13:39:44,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:39:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:44,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-03 13:39:44,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:39:44,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:39:44,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:44,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:44,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:44,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635229823] [2025-03-03 13:39:44,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635229823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:44,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297592022] [2025-03-03 13:39:44,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:39:44,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:44,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:44,821 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:44,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:39:44,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-03 13:39:44,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:39:44,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:39:44,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:44,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:39:44,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:44,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:44,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297592022] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:44,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:44,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 13:39:44,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104523891] [2025-03-03 13:39:44,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:44,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 13:39:44,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:44,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 13:39:44,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:39:44,922 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:44,942 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2025-03-03 13:39:44,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:39:44,943 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 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 21 [2025-03-03 13:39:44,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:44,943 INFO L225 Difference]: With dead ends: 46 [2025-03-03 13:39:44,943 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 13:39:44,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:39:44,944 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:44,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 13:39:44,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2025-03-03 13:39:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2025-03-03 13:39:44,950 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 21 [2025-03-03 13:39:44,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:44,950 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2025-03-03 13:39:44,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2025-03-03 13:39:44,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 13:39:44,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:44,950 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:44,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:45,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 13:39:45,151 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:45,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:45,151 INFO L85 PathProgramCache]: Analyzing trace with hash -835301072, now seen corresponding path program 3 times [2025-03-03 13:39:45,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:45,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172155587] [2025-03-03 13:39:45,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:39:45,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:45,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-03 13:39:45,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:39:45,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 13:39:45,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:45,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:45,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172155587] [2025-03-03 13:39:45,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172155587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:45,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445972370] [2025-03-03 13:39:45,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:39:45,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:45,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:45,301 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:45,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 13:39:45,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-03 13:39:45,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:39:45,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 13:39:45,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:45,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 13:39:45,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:45,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:45,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:45,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:45,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445972370] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:45,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:45,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-03 13:39:45,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593280006] [2025-03-03 13:39:45,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:45,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:39:45,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:45,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:39:45,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:39:45,478 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:45,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:45,538 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2025-03-03 13:39:45,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:39:45,538 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 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) Word has length 21 [2025-03-03 13:39:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:45,539 INFO L225 Difference]: With dead ends: 58 [2025-03-03 13:39:45,539 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 13:39:45,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:39:45,539 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:45,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 82 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:45,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 13:39:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-03 13:39:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2025-03-03 13:39:45,546 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 21 [2025-03-03 13:39:45,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:45,546 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2025-03-03 13:39:45,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:45,546 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2025-03-03 13:39:45,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 13:39:45,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:45,547 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:45,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:45,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:45,748 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:45,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:45,748 INFO L85 PathProgramCache]: Analyzing trace with hash 707097812, now seen corresponding path program 4 times [2025-03-03 13:39:45,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:45,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58311169] [2025-03-03 13:39:45,748 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:39:45,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:45,752 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-03 13:39:45,755 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:39:45,755 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:39:45,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:45,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:45,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58311169] [2025-03-03 13:39:45,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58311169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:45,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801413103] [2025-03-03 13:39:45,787 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:39:45,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:45,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:45,789 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:45,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 13:39:45,824 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-03 13:39:45,837 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:39:45,837 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:39:45,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:45,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:39:45,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:45,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:45,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801413103] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:45,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:45,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-03 13:39:45,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712077815] [2025-03-03 13:39:45,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:45,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 13:39:45,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:45,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 13:39:45,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:39:45,886 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:45,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:45,904 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2025-03-03 13:39:45,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:39:45,904 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-03 13:39:45,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:45,904 INFO L225 Difference]: With dead ends: 80 [2025-03-03 13:39:45,904 INFO L226 Difference]: Without dead ends: 53 [2025-03-03 13:39:45,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:39:45,905 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:45,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:45,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-03 13:39:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-03 13:39:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2025-03-03 13:39:45,911 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 21 [2025-03-03 13:39:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:45,911 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2025-03-03 13:39:45,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2025-03-03 13:39:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 13:39:45,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:45,914 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:45,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:46,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:46,115 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:46,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:46,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1709090996, now seen corresponding path program 5 times [2025-03-03 13:39:46,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:46,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617709887] [2025-03-03 13:39:46,115 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:39:46,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:46,122 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-03 13:39:46,128 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:39:46,129 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:39:46,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:46,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:46,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617709887] [2025-03-03 13:39:46,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617709887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:46,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941722152] [2025-03-03 13:39:46,193 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:39:46,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:46,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:46,195 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:46,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 13:39:46,223 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-03 13:39:46,236 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:39:46,236 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:39:46,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:46,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 13:39:46,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:46,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:46,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941722152] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:46,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:46,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-03 13:39:46,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880178590] [2025-03-03 13:39:46,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:46,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 13:39:46,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:46,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 13:39:46,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:39:46,375 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:46,437 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2025-03-03 13:39:46,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:39:46,437 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-03 13:39:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:46,437 INFO L225 Difference]: With dead ends: 64 [2025-03-03 13:39:46,437 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 13:39:46,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:39:46,438 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:46,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 13:39:46,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-03 13:39:46,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2025-03-03 13:39:46,443 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 21 [2025-03-03 13:39:46,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:46,443 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2025-03-03 13:39:46,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2025-03-03 13:39:46,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 13:39:46,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:46,444 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:46,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:46,644 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,SelfDestructingSolverStorable14 [2025-03-03 13:39:46,644 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:46,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:46,645 INFO L85 PathProgramCache]: Analyzing trace with hash 759191321, now seen corresponding path program 6 times [2025-03-03 13:39:46,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:46,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938562269] [2025-03-03 13:39:46,645 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:39:46,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:46,649 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-03 13:39:46,653 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:39:46,653 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-03 13:39:46,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 13:39:46,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:46,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938562269] [2025-03-03 13:39:46,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938562269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:46,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237106552] [2025-03-03 13:39:46,731 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:39:46,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:46,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:46,733 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:46,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 13:39:46,763 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-03 13:39:46,777 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:39:46,777 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-03 13:39:46,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:46,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 13:39:46,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:46,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:39:46,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:39:46,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237106552] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:46,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:46,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-03-03 13:39:46,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525630019] [2025-03-03 13:39:46,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:46,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 13:39:46,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:46,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 13:39:46,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:39:46,897 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:46,948 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2025-03-03 13:39:46,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:39:46,949 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-03 13:39:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:46,949 INFO L225 Difference]: With dead ends: 71 [2025-03-03 13:39:46,949 INFO L226 Difference]: Without dead ends: 59 [2025-03-03 13:39:46,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:39:46,950 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:46,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 112 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:46,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-03 13:39:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2025-03-03 13:39:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.290909090909091) internal successors, (71), 55 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2025-03-03 13:39:46,958 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 22 [2025-03-03 13:39:46,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:46,958 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2025-03-03 13:39:46,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:46,958 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2025-03-03 13:39:46,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 13:39:46,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:46,958 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:46,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:47,159 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,SelfDestructingSolverStorable15 [2025-03-03 13:39:47,159 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:47,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:47,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1309902835, now seen corresponding path program 7 times [2025-03-03 13:39:47,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:47,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872887092] [2025-03-03 13:39:47,160 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:39:47,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:47,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 13:39:47,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:39:47,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:47,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 13:39:47,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:47,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872887092] [2025-03-03 13:39:47,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872887092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:47,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656847776] [2025-03-03 13:39:47,256 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:39:47,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:47,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:47,258 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:47,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 13:39:47,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 13:39:47,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:39:47,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:47,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:47,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 13:39:47,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:39:47,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:39:47,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656847776] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:47,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:47,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-03-03 13:39:47,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597384084] [2025-03-03 13:39:47,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:47,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 13:39:47,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:47,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 13:39:47,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:39:47,408 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:47,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:47,470 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2025-03-03 13:39:47,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:39:47,470 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-03 13:39:47,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:47,471 INFO L225 Difference]: With dead ends: 74 [2025-03-03 13:39:47,471 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 13:39:47,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:39:47,472 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:47,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 129 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:47,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 13:39:47,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-03 13:39:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2025-03-03 13:39:47,478 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 22 [2025-03-03 13:39:47,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:47,478 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2025-03-03 13:39:47,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2025-03-03 13:39:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 13:39:47,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:47,479 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:47,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 13:39:47,679 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,SelfDestructingSolverStorable16 [2025-03-03 13:39:47,680 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:47,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:47,680 INFO L85 PathProgramCache]: Analyzing trace with hash -191932014, now seen corresponding path program 8 times [2025-03-03 13:39:47,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:47,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479208831] [2025-03-03 13:39:47,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:39:47,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:47,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-03 13:39:47,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:39:47,691 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:39:47,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:39:47,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:47,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479208831] [2025-03-03 13:39:47,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479208831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:47,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198960196] [2025-03-03 13:39:47,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:39:47,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:47,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:47,878 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:47,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 13:39:47,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-03 13:39:47,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:39:47,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:39:47,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:47,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-03 13:39:47,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:39:48,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:39:48,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198960196] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:48,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:48,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 26 [2025-03-03 13:39:48,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985790275] [2025-03-03 13:39:48,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:48,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 13:39:48,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:48,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 13:39:48,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2025-03-03 13:39:48,135 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:48,356 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2025-03-03 13:39:48,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 13:39:48,356 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-03 13:39:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:48,356 INFO L225 Difference]: With dead ends: 86 [2025-03-03 13:39:48,356 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 13:39:48,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 13:39:48,357 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:48,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 258 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:39:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 13:39:48,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2025-03-03 13:39:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2025-03-03 13:39:48,368 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 22 [2025-03-03 13:39:48,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:48,368 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2025-03-03 13:39:48,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2025-03-03 13:39:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:39:48,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:48,370 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:48,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 13:39:48,570 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,SelfDestructingSolverStorable17 [2025-03-03 13:39:48,570 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:48,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1370165682, now seen corresponding path program 9 times [2025-03-03 13:39:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:48,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819003983] [2025-03-03 13:39:48,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:39:48,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:48,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-03 13:39:48,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:39:48,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 13:39:48,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:48,617 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:39:48,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:48,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819003983] [2025-03-03 13:39:48,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819003983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:48,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015965632] [2025-03-03 13:39:48,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:39:48,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:48,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:48,619 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:48,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 13:39:48,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-03 13:39:48,665 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:39:48,665 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 13:39:48,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:48,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:39:48,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:39:48,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:39:48,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015965632] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:48,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:48,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 13:39:48,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227886087] [2025-03-03 13:39:48,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:48,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 13:39:48,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:48,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 13:39:48,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:39:48,721 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:48,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:48,772 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2025-03-03 13:39:48,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:39:48,773 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 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 23 [2025-03-03 13:39:48,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:48,773 INFO L225 Difference]: With dead ends: 86 [2025-03-03 13:39:48,773 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 13:39:48,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:39:48,774 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:48,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 93 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 13:39:48,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2025-03-03 13:39:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2025-03-03 13:39:48,781 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 23 [2025-03-03 13:39:48,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:48,781 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2025-03-03 13:39:48,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2025-03-03 13:39:48,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:39:48,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:48,782 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:48,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:48,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:48,983 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:48,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:48,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1302521008, now seen corresponding path program 10 times [2025-03-03 13:39:48,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:48,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165914808] [2025-03-03 13:39:48,983 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:39:48,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:48,987 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-03 13:39:48,991 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:39:48,991 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:39:48,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:39:49,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:49,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165914808] [2025-03-03 13:39:49,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165914808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:49,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581155828] [2025-03-03 13:39:49,024 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:39:49,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:49,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:49,026 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:49,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 13:39:49,056 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-03 13:39:49,069 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:39:49,069 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:39:49,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:49,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:39:49,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:39:49,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:49,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:39:49,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581155828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:49,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:49,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-03-03 13:39:49,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578472999] [2025-03-03 13:39:49,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:49,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 13:39:49,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:49,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 13:39:49,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:39:49,125 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:49,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:49,155 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2025-03-03 13:39:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:39:49,155 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-03 13:39:49,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:49,156 INFO L225 Difference]: With dead ends: 61 [2025-03-03 13:39:49,156 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 13:39:49,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:39:49,157 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:49,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 82 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:49,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 13:39:49,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-03 13:39:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2025-03-03 13:39:49,164 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 23 [2025-03-03 13:39:49,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:49,164 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2025-03-03 13:39:49,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2025-03-03 13:39:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:39:49,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:49,165 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:49,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:49,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-03 13:39:49,370 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:49,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:49,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1005896820, now seen corresponding path program 11 times [2025-03-03 13:39:49,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:49,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197327834] [2025-03-03 13:39:49,370 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:39:49,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:49,377 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-03-03 13:39:49,381 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:39:49,381 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 13:39:49,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:49,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:49,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197327834] [2025-03-03 13:39:49,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197327834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:49,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326370034] [2025-03-03 13:39:49,472 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:39:49,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:49,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:49,473 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:49,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 13:39:49,506 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-03-03 13:39:49,519 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:39:49,519 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 13:39:49,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:49,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 13:39:49,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:49,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:49,728 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:49,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326370034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:49,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:49,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-03 13:39:49,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347548740] [2025-03-03 13:39:49,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:49,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 13:39:49,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:49,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 13:39:49,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-03 13:39:49,730 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 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-03 13:39:49,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:49,822 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2025-03-03 13:39:49,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:39:49,822 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 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) Word has length 23 [2025-03-03 13:39:49,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:49,823 INFO L225 Difference]: With dead ends: 81 [2025-03-03 13:39:49,823 INFO L226 Difference]: Without dead ends: 61 [2025-03-03 13:39:49,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2025-03-03 13:39:49,824 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:49,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 123 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:49,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-03 13:39:49,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2025-03-03 13:39:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 58 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2025-03-03 13:39:49,830 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 23 [2025-03-03 13:39:49,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:49,831 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2025-03-03 13:39:49,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 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-03 13:39:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2025-03-03 13:39:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:39:49,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:49,831 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:49,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:50,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:50,032 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:50,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:50,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1722327696, now seen corresponding path program 12 times [2025-03-03 13:39:50,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:50,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412816910] [2025-03-03 13:39:50,032 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:39:50,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:50,037 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-03-03 13:39:50,041 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:39:50,041 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 13:39:50,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:50,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:50,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412816910] [2025-03-03 13:39:50,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412816910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:50,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474007543] [2025-03-03 13:39:50,148 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:39:50,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:50,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:50,150 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:50,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 13:39:50,180 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-03-03 13:39:50,192 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:39:50,192 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 13:39:50,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:50,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 13:39:50,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:50,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:50,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474007543] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:50,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:50,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2025-03-03 13:39:50,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975534462] [2025-03-03 13:39:50,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:50,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 13:39:50,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:50,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 13:39:50,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-03 13:39:50,404 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:50,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:50,543 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2025-03-03 13:39:50,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:39:50,546 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-03 13:39:50,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:50,546 INFO L225 Difference]: With dead ends: 71 [2025-03-03 13:39:50,546 INFO L226 Difference]: Without dead ends: 61 [2025-03-03 13:39:50,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:39:50,547 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:50,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 163 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:39:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-03 13:39:50,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-03 13:39:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2025-03-03 13:39:50,557 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 23 [2025-03-03 13:39:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:50,557 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2025-03-03 13:39:50,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2025-03-03 13:39:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:39:50,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:50,558 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:50,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-03 13:39:50,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:50,758 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:50,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:50,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1753953526, now seen corresponding path program 13 times [2025-03-03 13:39:50,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:50,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163685152] [2025-03-03 13:39:50,759 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:39:50,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:50,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 13:39:50,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:39:50,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:50,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:39:50,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:50,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163685152] [2025-03-03 13:39:50,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163685152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:50,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034019215] [2025-03-03 13:39:50,905 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:39:50,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:50,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:50,907 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:50,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 13:39:50,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 13:39:50,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:39:50,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:50,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:50,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 13:39:50,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:39:51,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:39:51,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034019215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:51,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:51,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 27 [2025-03-03 13:39:51,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444379777] [2025-03-03 13:39:51,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:51,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 13:39:51,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:51,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 13:39:51,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2025-03-03 13:39:51,176 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 27 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 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-03 13:39:51,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:51,362 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2025-03-03 13:39:51,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 13:39:51,363 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 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) Word has length 24 [2025-03-03 13:39:51,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:51,363 INFO L225 Difference]: With dead ends: 78 [2025-03-03 13:39:51,363 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 13:39:51,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=1074, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 13:39:51,364 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:51,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 236 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:39:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 13:39:51,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2025-03-03 13:39:51,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.25) internal successors, (85), 68 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2025-03-03 13:39:51,371 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 24 [2025-03-03 13:39:51,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:51,371 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2025-03-03 13:39:51,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 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-03 13:39:51,371 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2025-03-03 13:39:51,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:39:51,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:51,372 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:51,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:51,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 13:39:51,572 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:51,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:51,572 INFO L85 PathProgramCache]: Analyzing trace with hash 808270934, now seen corresponding path program 14 times [2025-03-03 13:39:51,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:51,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823573126] [2025-03-03 13:39:51,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:39:51,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:51,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:39:51,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:39:51,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:39:51,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:51,767 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:39:51,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:51,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823573126] [2025-03-03 13:39:51,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823573126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:51,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110483274] [2025-03-03 13:39:51,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:39:51,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:51,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:51,769 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:51,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 13:39:51,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:39:51,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:39:51,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:39:51,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:51,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 13:39:51,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:39:51,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:39:52,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110483274] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:52,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:52,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 29 [2025-03-03 13:39:52,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869201510] [2025-03-03 13:39:52,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:52,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 13:39:52,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:52,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 13:39:52,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2025-03-03 13:39:52,049 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 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-03 13:39:52,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:52,335 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2025-03-03 13:39:52,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 13:39:52,336 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 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) Word has length 24 [2025-03-03 13:39:52,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:52,336 INFO L225 Difference]: With dead ends: 91 [2025-03-03 13:39:52,336 INFO L226 Difference]: Without dead ends: 84 [2025-03-03 13:39:52,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=1289, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 13:39:52,337 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:52,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 366 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:39:52,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-03 13:39:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2025-03-03 13:39:52,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.24) internal successors, (93), 75 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2025-03-03 13:39:52,352 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 24 [2025-03-03 13:39:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:52,352 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2025-03-03 13:39:52,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 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-03 13:39:52,352 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2025-03-03 13:39:52,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:39:52,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:52,352 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:52,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-03 13:39:52,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:52,553 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:52,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:52,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1431507600, now seen corresponding path program 15 times [2025-03-03 13:39:52,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:52,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625525212] [2025-03-03 13:39:52,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:39:52,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:52,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-03 13:39:52,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:39:52,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:39:52,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:39:52,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:52,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625525212] [2025-03-03 13:39:52,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625525212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:52,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154941319] [2025-03-03 13:39:52,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:39:52,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:52,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:52,609 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:52,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 13:39:52,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-03 13:39:52,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:39:52,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:39:52,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:52,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:39:52,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:39:52,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:39:52,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154941319] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:52,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:52,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-03 13:39:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718587800] [2025-03-03 13:39:52,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:52,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:39:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:52,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:39:52,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:39:52,713 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:52,758 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2025-03-03 13:39:52,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:39:52,758 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-03 13:39:52,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:52,758 INFO L225 Difference]: With dead ends: 101 [2025-03-03 13:39:52,758 INFO L226 Difference]: Without dead ends: 90 [2025-03-03 13:39:52,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:39:52,759 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:52,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-03 13:39:52,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-03-03 13:39:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 87 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2025-03-03 13:39:52,768 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 25 [2025-03-03 13:39:52,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:52,768 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2025-03-03 13:39:52,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2025-03-03 13:39:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:39:52,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:52,769 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:52,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:52,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:52,969 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:52,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:52,970 INFO L85 PathProgramCache]: Analyzing trace with hash -182598834, now seen corresponding path program 16 times [2025-03-03 13:39:52,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:52,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525859862] [2025-03-03 13:39:52,970 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:39:52,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:52,973 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-03 13:39:52,975 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:39:52,975 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:39:52,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:39:53,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:53,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525859862] [2025-03-03 13:39:53,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525859862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:53,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444437687] [2025-03-03 13:39:53,010 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:39:53,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:53,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:53,012 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:53,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 13:39:53,049 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-03 13:39:53,063 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:39:53,063 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:39:53,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:53,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:39:53,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:39:53,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:39:53,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444437687] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:53,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:53,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-03-03 13:39:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819311090] [2025-03-03 13:39:53,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:53,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 13:39:53,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:53,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 13:39:53,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:39:53,125 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:53,164 INFO L93 Difference]: Finished difference Result 145 states and 184 transitions. [2025-03-03 13:39:53,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:39:53,165 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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 25 [2025-03-03 13:39:53,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:53,166 INFO L225 Difference]: With dead ends: 145 [2025-03-03 13:39:53,166 INFO L226 Difference]: Without dead ends: 102 [2025-03-03 13:39:53,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:39:53,166 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:53,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 92 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-03 13:39:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-03 13:39:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 101 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2025-03-03 13:39:53,177 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 25 [2025-03-03 13:39:53,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:53,177 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2025-03-03 13:39:53,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2025-03-03 13:39:53,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:39:53,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:53,178 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:53,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:53,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:53,380 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:53,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:53,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1947417136, now seen corresponding path program 17 times [2025-03-03 13:39:53,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:53,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642798861] [2025-03-03 13:39:53,381 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:39:53,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:53,384 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-03-03 13:39:53,388 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:39:53,388 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 13:39:53,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:53,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:53,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642798861] [2025-03-03 13:39:53,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642798861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:53,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242463778] [2025-03-03 13:39:53,488 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:39:53,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:53,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:53,490 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:53,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-03 13:39:53,524 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-03-03 13:39:53,538 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:39:53,538 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 13:39:53,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:53,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 13:39:53,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:53,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:53,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242463778] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:53,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:53,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-03 13:39:53,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308133202] [2025-03-03 13:39:53,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:53,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 13:39:53,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:53,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 13:39:53,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:39:53,789 INFO L87 Difference]: Start difference. First operand 102 states and 127 transitions. Second operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:53,919 INFO L93 Difference]: Finished difference Result 144 states and 179 transitions. [2025-03-03 13:39:53,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 13:39:53,919 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-03 13:39:53,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:53,921 INFO L225 Difference]: With dead ends: 144 [2025-03-03 13:39:53,921 INFO L226 Difference]: Without dead ends: 121 [2025-03-03 13:39:53,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2025-03-03 13:39:53,921 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:53,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 146 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:39:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-03 13:39:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2025-03-03 13:39:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.2727272727272727) internal successors, (140), 110 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 140 transitions. [2025-03-03 13:39:53,935 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 140 transitions. Word has length 25 [2025-03-03 13:39:53,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:53,935 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 140 transitions. [2025-03-03 13:39:53,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:53,935 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 140 transitions. [2025-03-03 13:39:53,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:39:53,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:53,936 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:53,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:54,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 13:39:54,136 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:54,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:54,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1023164236, now seen corresponding path program 18 times [2025-03-03 13:39:54,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:54,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331866248] [2025-03-03 13:39:54,137 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:39:54,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:54,141 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-03-03 13:39:54,145 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:39:54,145 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 13:39:54,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:54,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:54,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331866248] [2025-03-03 13:39:54,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331866248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:54,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935220694] [2025-03-03 13:39:54,258 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:39:54,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:54,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:54,259 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:54,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-03 13:39:54,297 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-03-03 13:39:54,311 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:39:54,311 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 13:39:54,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:54,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 13:39:54,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:54,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:54,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935220694] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:54,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:54,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2025-03-03 13:39:54,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963883336] [2025-03-03 13:39:54,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:54,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 13:39:54,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:54,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 13:39:54,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2025-03-03 13:39:54,614 INFO L87 Difference]: Start difference. First operand 111 states and 140 transitions. Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:54,844 INFO L93 Difference]: Finished difference Result 125 states and 157 transitions. [2025-03-03 13:39:54,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 13:39:54,844 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-03 13:39:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:54,845 INFO L225 Difference]: With dead ends: 125 [2025-03-03 13:39:54,845 INFO L226 Difference]: Without dead ends: 114 [2025-03-03 13:39:54,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2025-03-03 13:39:54,847 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:54,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 249 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:39:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-03 13:39:54,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-03 13:39:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 113 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 143 transitions. [2025-03-03 13:39:54,864 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 143 transitions. Word has length 25 [2025-03-03 13:39:54,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:54,865 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 143 transitions. [2025-03-03 13:39:54,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 143 transitions. [2025-03-03 13:39:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:39:54,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:54,865 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:54,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:55,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-03 13:39:55,066 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:55,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:55,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1338243859, now seen corresponding path program 19 times [2025-03-03 13:39:55,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:55,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013710763] [2025-03-03 13:39:55,066 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:39:55,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:55,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:39:55,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:39:55,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:55,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:55,159 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 13:39:55,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:55,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013710763] [2025-03-03 13:39:55,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013710763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:55,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174498291] [2025-03-03 13:39:55,161 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:39:55,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:55,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:55,163 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:55,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-03 13:39:55,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:39:55,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:39:55,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:55,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:55,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 13:39:55,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 13:39:55,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 13:39:55,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174498291] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:55,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:55,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-03 13:39:55,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236803874] [2025-03-03 13:39:55,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:55,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 13:39:55,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:55,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 13:39:55,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-03 13:39:55,390 INFO L87 Difference]: Start difference. First operand 114 states and 143 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:55,517 INFO L93 Difference]: Finished difference Result 147 states and 179 transitions. [2025-03-03 13:39:55,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:39:55,517 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-03 13:39:55,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:55,518 INFO L225 Difference]: With dead ends: 147 [2025-03-03 13:39:55,518 INFO L226 Difference]: Without dead ends: 130 [2025-03-03 13:39:55,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:39:55,522 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:55,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:39:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-03 13:39:55,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2025-03-03 13:39:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.232) internal successors, (154), 125 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2025-03-03 13:39:55,539 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 26 [2025-03-03 13:39:55,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:55,539 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2025-03-03 13:39:55,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2025-03-03 13:39:55,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:39:55,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:55,540 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:55,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:55,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 13:39:55,744 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:55,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:55,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1466426489, now seen corresponding path program 20 times [2025-03-03 13:39:55,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:55,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144908389] [2025-03-03 13:39:55,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:39:55,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:55,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-03 13:39:55,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:39:55,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:39:55,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 13:39:55,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:55,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144908389] [2025-03-03 13:39:55,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144908389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:55,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595970334] [2025-03-03 13:39:55,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:39:55,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:55,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:55,859 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:55,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-03 13:39:55,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-03 13:39:55,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:39:55,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:39:55,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:55,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 13:39:55,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 13:39:55,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:56,085 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 13:39:56,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595970334] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:56,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:56,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2025-03-03 13:39:56,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432707699] [2025-03-03 13:39:56,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:56,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 13:39:56,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:56,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 13:39:56,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-03 13:39:56,086 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 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-03 13:39:56,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:56,198 INFO L93 Difference]: Finished difference Result 154 states and 187 transitions. [2025-03-03 13:39:56,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:39:56,198 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 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) Word has length 26 [2025-03-03 13:39:56,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:56,199 INFO L225 Difference]: With dead ends: 154 [2025-03-03 13:39:56,199 INFO L226 Difference]: Without dead ends: 123 [2025-03-03 13:39:56,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2025-03-03 13:39:56,200 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:56,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 175 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:39:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-03 13:39:56,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-03 13:39:56,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.2049180327868851) internal successors, (147), 122 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2025-03-03 13:39:56,215 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 26 [2025-03-03 13:39:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:56,215 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2025-03-03 13:39:56,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 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-03 13:39:56,215 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2025-03-03 13:39:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:39:56,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:56,215 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:56,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:56,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:56,416 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:56,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:56,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1053690328, now seen corresponding path program 21 times [2025-03-03 13:39:56,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:56,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242637502] [2025-03-03 13:39:56,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:39:56,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:56,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-03 13:39:56,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:39:56,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 13:39:56,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:39:56,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:56,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242637502] [2025-03-03 13:39:56,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242637502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:56,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507606759] [2025-03-03 13:39:56,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:39:56,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:56,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:56,625 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:56,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-03 13:39:56,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-03 13:39:56,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:39:56,671 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 13:39:56,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:56,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 13:39:56,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:39:56,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:39:56,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507606759] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:56,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:56,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 30 [2025-03-03 13:39:56,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996693514] [2025-03-03 13:39:56,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:56,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 13:39:56,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:56,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 13:39:56,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2025-03-03 13:39:56,888 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand has 30 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:57,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:57,128 INFO L93 Difference]: Finished difference Result 148 states and 175 transitions. [2025-03-03 13:39:57,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 13:39:57,128 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 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 26 [2025-03-03 13:39:57,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:57,129 INFO L225 Difference]: With dead ends: 148 [2025-03-03 13:39:57,129 INFO L226 Difference]: Without dead ends: 130 [2025-03-03 13:39:57,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=1355, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 13:39:57,130 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 35 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:57,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 319 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:39:57,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-03 13:39:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2025-03-03 13:39:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 122 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2025-03-03 13:39:57,148 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 148 transitions. Word has length 26 [2025-03-03 13:39:57,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:57,149 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 148 transitions. [2025-03-03 13:39:57,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2025-03-03 13:39:57,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:39:57,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:57,149 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:57,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-03 13:39:57,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:57,350 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:57,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:57,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1007501714, now seen corresponding path program 22 times [2025-03-03 13:39:57,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:57,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400823334] [2025-03-03 13:39:57,350 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:39:57,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:57,353 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-03 13:39:57,357 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:39:57,357 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:39:57,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:57,568 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:39:57,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:57,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400823334] [2025-03-03 13:39:57,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400823334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:57,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764566786] [2025-03-03 13:39:57,568 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:39:57,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:57,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:57,570 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:57,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-03 13:39:57,607 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-03 13:39:57,621 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:39:57,622 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:39:57,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:57,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 13:39:57,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:39:57,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:39:57,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764566786] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:57,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:57,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 31 [2025-03-03 13:39:57,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301309783] [2025-03-03 13:39:57,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:57,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 13:39:57,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:57,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 13:39:57,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2025-03-03 13:39:57,847 INFO L87 Difference]: Start difference. First operand 123 states and 148 transitions. Second operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:58,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:58,177 INFO L93 Difference]: Finished difference Result 151 states and 180 transitions. [2025-03-03 13:39:58,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 13:39:58,178 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 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) Word has length 26 [2025-03-03 13:39:58,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:58,178 INFO L225 Difference]: With dead ends: 151 [2025-03-03 13:39:58,179 INFO L226 Difference]: Without dead ends: 144 [2025-03-03 13:39:58,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=1516, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 13:39:58,179 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 40 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:58,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 462 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:39:58,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-03 13:39:58,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 130. [2025-03-03 13:39:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.2093023255813953) internal successors, (156), 129 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 156 transitions. [2025-03-03 13:39:58,200 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 156 transitions. Word has length 26 [2025-03-03 13:39:58,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:58,200 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 156 transitions. [2025-03-03 13:39:58,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 156 transitions. [2025-03-03 13:39:58,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 13:39:58,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:58,201 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:58,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:58,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-03 13:39:58,405 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:58,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1367909716, now seen corresponding path program 23 times [2025-03-03 13:39:58,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:58,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158758802] [2025-03-03 13:39:58,405 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:39:58,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:58,408 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-03 13:39:58,411 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:39:58,411 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 13:39:58,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:58,460 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 13:39:58,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:58,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158758802] [2025-03-03 13:39:58,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158758802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:58,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995691247] [2025-03-03 13:39:58,460 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:39:58,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:58,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:58,462 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:58,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-03 13:39:58,501 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-03 13:39:58,515 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:39:58,515 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 13:39:58,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:58,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 13:39:58,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 13:39:58,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 13:39:58,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995691247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:58,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:58,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-03 13:39:58,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336854371] [2025-03-03 13:39:58,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:58,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 13:39:58,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:58,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 13:39:58,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:39:58,581 INFO L87 Difference]: Start difference. First operand 130 states and 156 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:58,640 INFO L93 Difference]: Finished difference Result 159 states and 190 transitions. [2025-03-03 13:39:58,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 13:39:58,640 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 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-03 13:39:58,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:58,641 INFO L225 Difference]: With dead ends: 159 [2025-03-03 13:39:58,641 INFO L226 Difference]: Without dead ends: 118 [2025-03-03 13:39:58,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:39:58,641 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:58,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 57 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-03 13:39:58,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-03 13:39:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 117 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 140 transitions. [2025-03-03 13:39:58,661 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 140 transitions. Word has length 27 [2025-03-03 13:39:58,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:58,661 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 140 transitions. [2025-03-03 13:39:58,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 140 transitions. [2025-03-03 13:39:58,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 13:39:58,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:58,661 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:58,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:58,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-03 13:39:58,862 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:58,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:58,862 INFO L85 PathProgramCache]: Analyzing trace with hash -94325168, now seen corresponding path program 24 times [2025-03-03 13:39:58,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:58,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843486497] [2025-03-03 13:39:58,862 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:39:58,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:58,869 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 3 equivalence classes. [2025-03-03 13:39:58,872 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:39:58,872 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 13:39:58,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 13:39:58,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:58,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843486497] [2025-03-03 13:39:58,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843486497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:58,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351056409] [2025-03-03 13:39:58,917 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:39:58,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:58,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:58,919 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:58,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-03 13:39:58,958 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 3 equivalence classes. [2025-03-03 13:39:58,971 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:39:58,971 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 13:39:58,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:58,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 13:39:58,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 13:39:59,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:59,037 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 13:39:59,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351056409] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:59,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:59,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-03 13:39:59,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342697737] [2025-03-03 13:39:59,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:59,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 13:39:59,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:59,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 13:39:59,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:39:59,038 INFO L87 Difference]: Start difference. First operand 118 states and 140 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:59,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:59,094 INFO L93 Difference]: Finished difference Result 126 states and 148 transitions. [2025-03-03 13:39:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 13:39:59,098 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 13:39:59,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:59,098 INFO L225 Difference]: With dead ends: 126 [2025-03-03 13:39:59,099 INFO L226 Difference]: Without dead ends: 121 [2025-03-03 13:39:59,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2025-03-03 13:39:59,099 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:59,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 116 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:59,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-03 13:39:59,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-03-03 13:39:59,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.194915254237288) internal successors, (141), 118 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2025-03-03 13:39:59,116 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 27 [2025-03-03 13:39:59,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:59,116 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2025-03-03 13:39:59,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:59,116 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2025-03-03 13:39:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 13:39:59,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:59,116 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:59,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:59,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:59,317 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:59,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:59,317 INFO L85 PathProgramCache]: Analyzing trace with hash -466363276, now seen corresponding path program 25 times [2025-03-03 13:39:59,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:59,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127307687] [2025-03-03 13:39:59,317 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:39:59,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:59,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 13:39:59,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:39:59,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:59,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:59,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:59,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127307687] [2025-03-03 13:39:59,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127307687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:59,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344453388] [2025-03-03 13:39:59,454 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:39:59,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:59,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:59,456 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:59,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-03 13:39:59,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 13:39:59,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:39:59,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:59,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:59,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 13:39:59,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:59,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:39:59,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344453388] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:59,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:59,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2025-03-03 13:39:59,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122605598] [2025-03-03 13:39:59,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:59,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 13:39:59,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:59,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 13:39:59,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2025-03-03 13:39:59,894 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:00,103 INFO L93 Difference]: Finished difference Result 171 states and 202 transitions. [2025-03-03 13:40:00,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 13:40:00,103 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 13:40:00,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:00,104 INFO L225 Difference]: With dead ends: 171 [2025-03-03 13:40:00,104 INFO L226 Difference]: Without dead ends: 146 [2025-03-03 13:40:00,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=1155, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 13:40:00,104 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:00,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 230 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-03 13:40:00,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2025-03-03 13:40:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.196969696969697) internal successors, (158), 132 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 158 transitions. [2025-03-03 13:40:00,125 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 158 transitions. Word has length 27 [2025-03-03 13:40:00,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:00,125 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 158 transitions. [2025-03-03 13:40:00,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 158 transitions. [2025-03-03 13:40:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 13:40:00,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:00,125 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:00,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-03 13:40:00,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:00,326 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:00,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:00,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1934894704, now seen corresponding path program 26 times [2025-03-03 13:40:00,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:00,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075188288] [2025-03-03 13:40:00,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:00,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:00,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-03 13:40:00,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:40:00,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:00,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:00,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:00,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075188288] [2025-03-03 13:40:00,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075188288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:00,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531272138] [2025-03-03 13:40:00,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:00,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:00,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:00,495 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:00,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-03 13:40:00,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-03 13:40:00,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:40:00,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:00,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:00,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 13:40:00,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:00,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:00,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531272138] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:00,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:00,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 30 [2025-03-03 13:40:00,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108550620] [2025-03-03 13:40:00,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:00,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 13:40:00,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:00,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 13:40:00,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2025-03-03 13:40:00,898 INFO L87 Difference]: Start difference. First operand 133 states and 158 transitions. Second operand has 30 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 30 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:01,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:01,145 INFO L93 Difference]: Finished difference Result 148 states and 176 transitions. [2025-03-03 13:40:01,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 13:40:01,145 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 30 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 13:40:01,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:01,146 INFO L225 Difference]: With dead ends: 148 [2025-03-03 13:40:01,146 INFO L226 Difference]: Without dead ends: 136 [2025-03-03 13:40:01,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=1191, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 13:40:01,146 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:01,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 224 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-03 13:40:01,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-03 13:40:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.1925925925925926) internal successors, (161), 135 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:01,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 161 transitions. [2025-03-03 13:40:01,167 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 161 transitions. Word has length 27 [2025-03-03 13:40:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:01,167 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 161 transitions. [2025-03-03 13:40:01,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 30 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 161 transitions. [2025-03-03 13:40:01,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 13:40:01,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:01,168 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:01,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-03 13:40:01,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:01,368 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:01,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:01,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1401395030, now seen corresponding path program 27 times [2025-03-03 13:40:01,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:01,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563942401] [2025-03-03 13:40:01,369 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:01,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:01,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-03-03 13:40:01,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 13:40:01,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:40:01,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:40:01,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:01,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563942401] [2025-03-03 13:40:01,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563942401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:01,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258471078] [2025-03-03 13:40:01,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:01,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:01,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:01,565 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:01,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-03 13:40:01,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-03-03 13:40:01,622 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 13:40:01,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:40:01,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:01,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 13:40:01,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:40:01,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:40:01,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258471078] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:01,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:01,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 32 [2025-03-03 13:40:01,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890654848] [2025-03-03 13:40:01,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:01,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 13:40:01,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:01,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 13:40:01,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2025-03-03 13:40:01,913 INFO L87 Difference]: Start difference. First operand 136 states and 161 transitions. Second operand has 32 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:02,163 INFO L93 Difference]: Finished difference Result 155 states and 183 transitions. [2025-03-03 13:40:02,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 13:40:02,164 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-03 13:40:02,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:02,164 INFO L225 Difference]: With dead ends: 155 [2025-03-03 13:40:02,164 INFO L226 Difference]: Without dead ends: 150 [2025-03-03 13:40:02,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=1501, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 13:40:02,165 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:02,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 267 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-03 13:40:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 145. [2025-03-03 13:40:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.1944444444444444) internal successors, (172), 144 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 172 transitions. [2025-03-03 13:40:02,187 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 172 transitions. Word has length 28 [2025-03-03 13:40:02,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:02,187 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 172 transitions. [2025-03-03 13:40:02,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 172 transitions. [2025-03-03 13:40:02,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 13:40:02,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:02,187 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:02,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:02,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-03 13:40:02,388 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:02,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash 537382710, now seen corresponding path program 28 times [2025-03-03 13:40:02,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:02,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506122195] [2025-03-03 13:40:02,388 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:02,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:02,392 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-03 13:40:02,395 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 13:40:02,395 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:02,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:40:02,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:02,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506122195] [2025-03-03 13:40:02,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506122195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:02,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164676241] [2025-03-03 13:40:02,610 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:02,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:02,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:02,611 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:02,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-03 13:40:02,648 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-03 13:40:02,660 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 13:40:02,660 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:02,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:02,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 13:40:02,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:40:02,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:40:02,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164676241] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:02,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:02,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 32 [2025-03-03 13:40:02,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139744327] [2025-03-03 13:40:02,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:02,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 13:40:02,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:02,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 13:40:02,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=913, Unknown=0, NotChecked=0, Total=992 [2025-03-03 13:40:02,919 INFO L87 Difference]: Start difference. First operand 145 states and 172 transitions. Second operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:03,199 INFO L93 Difference]: Finished difference Result 157 states and 183 transitions. [2025-03-03 13:40:03,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 13:40:03,199 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 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 28 [2025-03-03 13:40:03,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:03,200 INFO L225 Difference]: With dead ends: 157 [2025-03-03 13:40:03,200 INFO L226 Difference]: Without dead ends: 138 [2025-03-03 13:40:03,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=1589, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 13:40:03,201 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 35 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:03,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 404 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:40:03,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-03 13:40:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-03 13:40:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.197080291970803) internal successors, (164), 137 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2025-03-03 13:40:03,225 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 28 [2025-03-03 13:40:03,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:03,225 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2025-03-03 13:40:03,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2025-03-03 13:40:03,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 13:40:03,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:03,226 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:03,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-03 13:40:03,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-03 13:40:03,426 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:03,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:03,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1781951658, now seen corresponding path program 29 times [2025-03-03 13:40:03,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:03,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980757233] [2025-03-03 13:40:03,427 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:03,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:03,430 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-03-03 13:40:03,433 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 13:40:03,433 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 13:40:03,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:40:03,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:03,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980757233] [2025-03-03 13:40:03,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980757233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:03,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874451254] [2025-03-03 13:40:03,629 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:03,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:03,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:03,631 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:03,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-03 13:40:03,668 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-03-03 13:40:03,680 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 13:40:03,680 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 13:40:03,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:03,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-03 13:40:03,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:40:03,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:40:03,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874451254] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:03,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:03,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 34 [2025-03-03 13:40:03,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107920177] [2025-03-03 13:40:03,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:03,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 13:40:03,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:03,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 13:40:03,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1042, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 13:40:03,922 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:04,250 INFO L93 Difference]: Finished difference Result 168 states and 198 transitions. [2025-03-03 13:40:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 13:40:04,251 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-03 13:40:04,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:04,251 INFO L225 Difference]: With dead ends: 168 [2025-03-03 13:40:04,251 INFO L226 Difference]: Without dead ends: 161 [2025-03-03 13:40:04,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=1845, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 13:40:04,252 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 46 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:04,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 507 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:40:04,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-03 13:40:04,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 145. [2025-03-03 13:40:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.1944444444444444) internal successors, (172), 144 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:04,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 172 transitions. [2025-03-03 13:40:04,277 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 172 transitions. Word has length 28 [2025-03-03 13:40:04,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:04,277 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 172 transitions. [2025-03-03 13:40:04,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 172 transitions. [2025-03-03 13:40:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 13:40:04,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:04,278 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:04,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-03-03 13:40:04,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-03 13:40:04,478 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:04,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:04,478 INFO L85 PathProgramCache]: Analyzing trace with hash 524080912, now seen corresponding path program 30 times [2025-03-03 13:40:04,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:04,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080151365] [2025-03-03 13:40:04,478 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:04,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:04,482 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-03-03 13:40:04,486 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 13:40:04,486 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 13:40:04,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 13:40:04,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:04,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080151365] [2025-03-03 13:40:04,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080151365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:04,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668604832] [2025-03-03 13:40:04,541 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:04,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:04,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:04,543 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:04,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-03 13:40:04,581 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-03-03 13:40:04,593 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 13:40:04,593 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 13:40:04,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:04,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 13:40:04,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 13:40:04,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 13:40:04,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668604832] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:04,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:04,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-03-03 13:40:04,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224256556] [2025-03-03 13:40:04,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:04,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 13:40:04,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:04,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 13:40:04,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:40:04,674 INFO L87 Difference]: Start difference. First operand 145 states and 172 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:04,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:04,746 INFO L93 Difference]: Finished difference Result 180 states and 215 transitions. [2025-03-03 13:40:04,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 13:40:04,746 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-03 13:40:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:04,747 INFO L225 Difference]: With dead ends: 180 [2025-03-03 13:40:04,747 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 13:40:04,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2025-03-03 13:40:04,747 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:04,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 112 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:04,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 13:40:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 163. [2025-03-03 13:40:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.2098765432098766) internal successors, (196), 162 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 196 transitions. [2025-03-03 13:40:04,772 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 196 transitions. Word has length 29 [2025-03-03 13:40:04,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:04,772 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 196 transitions. [2025-03-03 13:40:04,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:04,772 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 196 transitions. [2025-03-03 13:40:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 13:40:04,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:04,773 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:04,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:04,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-03 13:40:04,973 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:04,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:04,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1855527532, now seen corresponding path program 31 times [2025-03-03 13:40:04,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:04,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532500401] [2025-03-03 13:40:04,974 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:04,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:04,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 13:40:04,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 13:40:04,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:04,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:05,036 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 13:40:05,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:05,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532500401] [2025-03-03 13:40:05,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532500401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:05,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200151420] [2025-03-03 13:40:05,037 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:05,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:05,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:05,039 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:05,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-03 13:40:05,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 13:40:05,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 13:40:05,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:05,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:05,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 13:40:05,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 13:40:05,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 13:40:05,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200151420] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:05,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:05,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-03-03 13:40:05,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055548518] [2025-03-03 13:40:05,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:05,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 13:40:05,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:05,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 13:40:05,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:40:05,171 INFO L87 Difference]: Start difference. First operand 163 states and 196 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:05,248 INFO L93 Difference]: Finished difference Result 260 states and 321 transitions. [2025-03-03 13:40:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 13:40:05,249 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-03 13:40:05,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:05,249 INFO L225 Difference]: With dead ends: 260 [2025-03-03 13:40:05,249 INFO L226 Difference]: Without dead ends: 190 [2025-03-03 13:40:05,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2025-03-03 13:40:05,250 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:05,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 116 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:05,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-03 13:40:05,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-03-03 13:40:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.2116402116402116) internal successors, (229), 189 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 229 transitions. [2025-03-03 13:40:05,283 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 229 transitions. Word has length 29 [2025-03-03 13:40:05,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:05,283 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 229 transitions. [2025-03-03 13:40:05,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:05,283 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 229 transitions. [2025-03-03 13:40:05,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 13:40:05,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:05,283 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:05,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:05,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:05,484 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:05,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1040071888, now seen corresponding path program 32 times [2025-03-03 13:40:05,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:05,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407148927] [2025-03-03 13:40:05,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:05,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:05,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-03 13:40:05,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 13:40:05,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:05,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:05,654 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:05,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:05,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407148927] [2025-03-03 13:40:05,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407148927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:05,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55863208] [2025-03-03 13:40:05,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:05,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:05,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:05,656 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:05,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-03-03 13:40:05,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-03 13:40:05,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 13:40:05,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:05,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:05,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 13:40:05,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:05,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:06,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55863208] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:06,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:06,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2025-03-03 13:40:06,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429804822] [2025-03-03 13:40:06,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:06,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 13:40:06,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:06,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 13:40:06,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1029, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 13:40:06,216 INFO L87 Difference]: Start difference. First operand 190 states and 229 transitions. Second operand has 34 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:06,529 INFO L93 Difference]: Finished difference Result 272 states and 324 transitions. [2025-03-03 13:40:06,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 13:40:06,530 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-03 13:40:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:06,531 INFO L225 Difference]: With dead ends: 272 [2025-03-03 13:40:06,531 INFO L226 Difference]: Without dead ends: 244 [2025-03-03 13:40:06,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=1659, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 13:40:06,531 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:06,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 262 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:06,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-03 13:40:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 211. [2025-03-03 13:40:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.2142857142857142) internal successors, (255), 210 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 255 transitions. [2025-03-03 13:40:06,570 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 255 transitions. Word has length 29 [2025-03-03 13:40:06,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:06,570 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 255 transitions. [2025-03-03 13:40:06,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:06,570 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 255 transitions. [2025-03-03 13:40:06,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 13:40:06,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:06,571 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:06,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-03-03 13:40:06,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-03-03 13:40:06,771 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:06,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:06,771 INFO L85 PathProgramCache]: Analyzing trace with hash 384481460, now seen corresponding path program 33 times [2025-03-03 13:40:06,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:06,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577388281] [2025-03-03 13:40:06,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:06,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:06,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-03-03 13:40:06,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 13:40:06,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:40:06,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:06,950 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:06,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:06,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577388281] [2025-03-03 13:40:06,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577388281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:06,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485899612] [2025-03-03 13:40:06,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:06,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:06,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:06,952 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:06,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-03-03 13:40:06,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-03-03 13:40:07,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 13:40:07,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:40:07,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:07,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 13:40:07,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:07,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:07,470 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:07,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485899612] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:07,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:07,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 35 [2025-03-03 13:40:07,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506861294] [2025-03-03 13:40:07,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:07,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 13:40:07,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:07,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 13:40:07,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1084, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 13:40:07,473 INFO L87 Difference]: Start difference. First operand 211 states and 255 transitions. Second operand has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:07,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:07,844 INFO L93 Difference]: Finished difference Result 228 states and 276 transitions. [2025-03-03 13:40:07,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 13:40:07,844 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-03 13:40:07,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:07,845 INFO L225 Difference]: With dead ends: 228 [2025-03-03 13:40:07,845 INFO L226 Difference]: Without dead ends: 215 [2025-03-03 13:40:07,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=1716, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 13:40:07,846 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:07,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 251 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:07,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-03 13:40:07,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-03-03 13:40:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.2102803738317758) internal successors, (259), 214 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 259 transitions. [2025-03-03 13:40:07,888 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 259 transitions. Word has length 29 [2025-03-03 13:40:07,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:07,888 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 259 transitions. [2025-03-03 13:40:07,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 259 transitions. [2025-03-03 13:40:07,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 13:40:07,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:07,889 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:07,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:08,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:08,090 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:08,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:08,090 INFO L85 PathProgramCache]: Analyzing trace with hash 988918489, now seen corresponding path program 34 times [2025-03-03 13:40:08,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:08,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446163696] [2025-03-03 13:40:08,090 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:08,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:08,093 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-03 13:40:08,096 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:40:08,096 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:08,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 13:40:08,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446163696] [2025-03-03 13:40:08,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446163696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896978932] [2025-03-03 13:40:08,176 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:08,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:08,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:08,178 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:08,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-03-03 13:40:08,223 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-03 13:40:08,236 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:40:08,236 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:08,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:08,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 13:40:08,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 13:40:08,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 13:40:08,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896978932] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:08,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:08,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-03 13:40:08,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797886191] [2025-03-03 13:40:08,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:08,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 13:40:08,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:08,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 13:40:08,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:40:08,447 INFO L87 Difference]: Start difference. First operand 215 states and 259 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:08,630 INFO L93 Difference]: Finished difference Result 267 states and 316 transitions. [2025-03-03 13:40:08,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 13:40:08,630 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-03 13:40:08,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:08,631 INFO L225 Difference]: With dead ends: 267 [2025-03-03 13:40:08,631 INFO L226 Difference]: Without dead ends: 245 [2025-03-03 13:40:08,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2025-03-03 13:40:08,631 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:08,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:08,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-03 13:40:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 240. [2025-03-03 13:40:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.1841004184100419) internal successors, (283), 239 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 283 transitions. [2025-03-03 13:40:08,675 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 283 transitions. Word has length 30 [2025-03-03 13:40:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:08,675 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 283 transitions. [2025-03-03 13:40:08,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 283 transitions. [2025-03-03 13:40:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 13:40:08,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:08,676 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:08,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:08,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:08,876 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:08,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:08,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1950217907, now seen corresponding path program 35 times [2025-03-03 13:40:08,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:08,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239392491] [2025-03-03 13:40:08,877 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:08,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:08,880 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-03-03 13:40:08,883 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:40:08,883 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 13:40:08,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 13:40:08,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:08,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239392491] [2025-03-03 13:40:08,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239392491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:08,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544322797] [2025-03-03 13:40:08,956 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:08,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:08,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:08,958 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:08,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-03-03 13:40:08,998 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-03-03 13:40:09,011 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:40:09,011 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 13:40:09,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:09,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 13:40:09,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:09,116 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 13:40:09,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 13:40:09,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544322797] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:09,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:09,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-03 13:40:09,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282624818] [2025-03-03 13:40:09,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:09,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 13:40:09,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:09,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 13:40:09,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:40:09,223 INFO L87 Difference]: Start difference. First operand 240 states and 283 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:09,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:09,421 INFO L93 Difference]: Finished difference Result 276 states and 326 transitions. [2025-03-03 13:40:09,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 13:40:09,421 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-03 13:40:09,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:09,422 INFO L225 Difference]: With dead ends: 276 [2025-03-03 13:40:09,422 INFO L226 Difference]: Without dead ends: 236 [2025-03-03 13:40:09,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2025-03-03 13:40:09,422 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:09,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:09,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-03 13:40:09,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-03-03 13:40:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.1617021276595745) internal successors, (273), 235 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 273 transitions. [2025-03-03 13:40:09,469 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 273 transitions. Word has length 30 [2025-03-03 13:40:09,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:09,469 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 273 transitions. [2025-03-03 13:40:09,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 273 transitions. [2025-03-03 13:40:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 13:40:09,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:09,470 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:09,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-03-03 13:40:09,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-03-03 13:40:09,670 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:09,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:09,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1191976750, now seen corresponding path program 36 times [2025-03-03 13:40:09,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:09,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560387146] [2025-03-03 13:40:09,670 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:09,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:09,673 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 3 equivalence classes. [2025-03-03 13:40:09,677 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:40:09,677 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 13:40:09,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:40:09,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:09,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560387146] [2025-03-03 13:40:09,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560387146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:09,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292183434] [2025-03-03 13:40:09,858 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:09,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:09,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:09,860 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:09,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-03-03 13:40:09,901 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 3 equivalence classes. [2025-03-03 13:40:09,915 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:40:09,915 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 13:40:09,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:09,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 13:40:09,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:40:10,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:40:10,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292183434] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:10,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:10,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 34 [2025-03-03 13:40:10,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805366758] [2025-03-03 13:40:10,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:10,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 13:40:10,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:10,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 13:40:10,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1032, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 13:40:10,197 INFO L87 Difference]: Start difference. First operand 236 states and 273 transitions. Second operand has 34 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:10,493 INFO L93 Difference]: Finished difference Result 264 states and 304 transitions. [2025-03-03 13:40:10,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 13:40:10,493 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 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 30 [2025-03-03 13:40:10,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:10,494 INFO L225 Difference]: With dead ends: 264 [2025-03-03 13:40:10,494 INFO L226 Difference]: Without dead ends: 243 [2025-03-03 13:40:10,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=1745, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 13:40:10,495 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:10,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 415 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:40:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-03 13:40:10,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 235. [2025-03-03 13:40:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.1666666666666667) internal successors, (273), 234 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 273 transitions. [2025-03-03 13:40:10,537 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 273 transitions. Word has length 30 [2025-03-03 13:40:10,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:10,537 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 273 transitions. [2025-03-03 13:40:10,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:10,537 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 273 transitions. [2025-03-03 13:40:10,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 13:40:10,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:10,538 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:10,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:10,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-03-03 13:40:10,738 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:10,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:10,739 INFO L85 PathProgramCache]: Analyzing trace with hash 346108824, now seen corresponding path program 37 times [2025-03-03 13:40:10,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:10,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558706618] [2025-03-03 13:40:10,739 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:10,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:10,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 13:40:10,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:40:10,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:10,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:40:10,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:10,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558706618] [2025-03-03 13:40:10,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558706618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:10,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204452000] [2025-03-03 13:40:10,961 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:10,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:10,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:10,963 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:10,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-03-03 13:40:11,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 13:40:11,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:40:11,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:11,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:11,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 13:40:11,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:40:11,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:40:11,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204452000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:11,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:11,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 36 [2025-03-03 13:40:11,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133434469] [2025-03-03 13:40:11,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:11,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 13:40:11,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:11,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 13:40:11,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 13:40:11,285 INFO L87 Difference]: Start difference. First operand 235 states and 273 transitions. Second operand has 36 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:11,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:11,610 INFO L93 Difference]: Finished difference Result 248 states and 285 transitions. [2025-03-03 13:40:11,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 13:40:11,611 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 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 30 [2025-03-03 13:40:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:11,612 INFO L225 Difference]: With dead ends: 248 [2025-03-03 13:40:11,612 INFO L226 Difference]: Without dead ends: 228 [2025-03-03 13:40:11,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=2013, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 13:40:11,612 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 39 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:11,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 534 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:40:11,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-03 13:40:11,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-03-03 13:40:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.1674008810572687) internal successors, (265), 227 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 265 transitions. [2025-03-03 13:40:11,661 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 265 transitions. Word has length 30 [2025-03-03 13:40:11,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:11,661 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 265 transitions. [2025-03-03 13:40:11,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:11,661 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 265 transitions. [2025-03-03 13:40:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 13:40:11,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:11,662 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:11,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2025-03-03 13:40:11,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-03-03 13:40:11,863 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:11,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:11,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1694845330, now seen corresponding path program 38 times [2025-03-03 13:40:11,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:11,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130570572] [2025-03-03 13:40:11,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:11,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:11,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-03 13:40:11,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:40:11,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:11,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:40:12,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:12,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130570572] [2025-03-03 13:40:12,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130570572] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:12,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707625825] [2025-03-03 13:40:12,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:12,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:12,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:12,130 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:12,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-03-03 13:40:12,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-03 13:40:12,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:40:12,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:12,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:12,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-03 13:40:12,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:40:12,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:40:12,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707625825] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:12,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:12,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 38 [2025-03-03 13:40:12,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638240212] [2025-03-03 13:40:12,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:12,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-03 13:40:12,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:12,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-03 13:40:12,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1314, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 13:40:12,457 INFO L87 Difference]: Start difference. First operand 228 states and 265 transitions. Second operand has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:12,848 INFO L93 Difference]: Finished difference Result 265 states and 307 transitions. [2025-03-03 13:40:12,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 13:40:12,849 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 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 30 [2025-03-03 13:40:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:12,849 INFO L225 Difference]: With dead ends: 265 [2025-03-03 13:40:12,849 INFO L226 Difference]: Without dead ends: 258 [2025-03-03 13:40:12,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=2299, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 13:40:12,850 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 53 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:12,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 591 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:40:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-03 13:40:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 235. [2025-03-03 13:40:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.1666666666666667) internal successors, (273), 234 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 273 transitions. [2025-03-03 13:40:12,896 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 273 transitions. Word has length 30 [2025-03-03 13:40:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:12,896 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 273 transitions. [2025-03-03 13:40:12,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 273 transitions. [2025-03-03 13:40:12,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 13:40:12,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:12,896 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:12,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2025-03-03 13:40:13,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-03 13:40:13,097 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:13,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:13,097 INFO L85 PathProgramCache]: Analyzing trace with hash -66268658, now seen corresponding path program 39 times [2025-03-03 13:40:13,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:13,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610011372] [2025-03-03 13:40:13,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:13,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:13,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-03-03 13:40:13,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 13:40:13,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:40:13,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:40:13,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:13,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610011372] [2025-03-03 13:40:13,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610011372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:13,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843672811] [2025-03-03 13:40:13,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:13,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:13,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:13,162 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:13,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-03-03 13:40:13,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-03-03 13:40:13,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 13:40:13,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:40:13,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:13,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 13:40:13,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:40:13,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:40:13,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843672811] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:13,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:13,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-03 13:40:13,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095410] [2025-03-03 13:40:13,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:13,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 13:40:13,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:13,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 13:40:13,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-03-03 13:40:13,306 INFO L87 Difference]: Start difference. First operand 235 states and 273 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:13,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:13,429 INFO L93 Difference]: Finished difference Result 285 states and 332 transitions. [2025-03-03 13:40:13,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 13:40:13,430 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-03 13:40:13,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:13,431 INFO L225 Difference]: With dead ends: 285 [2025-03-03 13:40:13,431 INFO L226 Difference]: Without dead ends: 223 [2025-03-03 13:40:13,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=327, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:40:13,431 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 25 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:13,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 123 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:13,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-03 13:40:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-03 13:40:13,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.1576576576576576) internal successors, (257), 222 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 257 transitions. [2025-03-03 13:40:13,474 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 257 transitions. Word has length 31 [2025-03-03 13:40:13,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:13,474 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 257 transitions. [2025-03-03 13:40:13,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:13,474 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 257 transitions. [2025-03-03 13:40:13,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 13:40:13,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:13,474 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:13,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:13,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:13,675 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:13,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:13,675 INFO L85 PathProgramCache]: Analyzing trace with hash -809776080, now seen corresponding path program 40 times [2025-03-03 13:40:13,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:13,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860511259] [2025-03-03 13:40:13,675 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:13,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:13,678 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-03 13:40:13,687 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 13:40:13,687 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:13,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:40:13,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:13,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860511259] [2025-03-03 13:40:13,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860511259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:13,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403239544] [2025-03-03 13:40:13,730 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:13,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:13,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:13,732 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:13,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-03-03 13:40:13,774 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-03 13:40:13,788 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 13:40:13,788 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:13,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:13,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 13:40:13,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:40:13,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:40:13,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403239544] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:13,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:13,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2025-03-03 13:40:13,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417096440] [2025-03-03 13:40:13,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:13,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 13:40:13,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:13,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 13:40:13,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:40:13,859 INFO L87 Difference]: Start difference. First operand 223 states and 257 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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-03 13:40:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:13,951 INFO L93 Difference]: Finished difference Result 234 states and 268 transitions. [2025-03-03 13:40:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 13:40:13,951 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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 31 [2025-03-03 13:40:13,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:13,952 INFO L225 Difference]: With dead ends: 234 [2025-03-03 13:40:13,952 INFO L226 Difference]: Without dead ends: 229 [2025-03-03 13:40:13,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=265, Unknown=0, NotChecked=0, Total=420 [2025-03-03 13:40:13,953 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 25 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:13,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 146 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-03 13:40:13,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 224. [2025-03-03 13:40:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.15695067264574) internal successors, (258), 223 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 258 transitions. [2025-03-03 13:40:13,998 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 258 transitions. Word has length 31 [2025-03-03 13:40:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:13,999 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 258 transitions. [2025-03-03 13:40:13,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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-03 13:40:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 258 transitions. [2025-03-03 13:40:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 13:40:13,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:13,999 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:14,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:14,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-03-03 13:40:14,199 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:14,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:14,200 INFO L85 PathProgramCache]: Analyzing trace with hash -633547660, now seen corresponding path program 41 times [2025-03-03 13:40:14,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:14,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15894605] [2025-03-03 13:40:14,200 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:14,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:14,203 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 5 equivalence classes. [2025-03-03 13:40:14,206 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 13:40:14,206 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 13:40:14,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:14,366 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:14,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:14,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15894605] [2025-03-03 13:40:14,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15894605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:14,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698234247] [2025-03-03 13:40:14,366 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:14,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:14,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:14,369 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:14,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-03-03 13:40:14,414 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 5 equivalence classes. [2025-03-03 13:40:14,431 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 13:40:14,431 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 13:40:14,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:14,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 13:40:14,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:14,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:14,915 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:14,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698234247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:14,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:14,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2025-03-03 13:40:14,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084639067] [2025-03-03 13:40:14,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:14,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-03 13:40:14,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:14,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-03 13:40:14,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 13:40:14,916 INFO L87 Difference]: Start difference. First operand 224 states and 258 transitions. Second operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:15,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:15,249 INFO L93 Difference]: Finished difference Result 322 states and 368 transitions. [2025-03-03 13:40:15,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 13:40:15,249 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-03 13:40:15,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:15,250 INFO L225 Difference]: With dead ends: 322 [2025-03-03 13:40:15,250 INFO L226 Difference]: Without dead ends: 292 [2025-03-03 13:40:15,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=2153, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 13:40:15,251 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:15,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 280 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:15,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-03 13:40:15,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 251. [2025-03-03 13:40:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.156) internal successors, (289), 250 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 289 transitions. [2025-03-03 13:40:15,302 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 289 transitions. Word has length 31 [2025-03-03 13:40:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:15,302 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 289 transitions. [2025-03-03 13:40:15,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 289 transitions. [2025-03-03 13:40:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 13:40:15,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:15,302 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:15,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2025-03-03 13:40:15,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:15,503 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:15,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:15,503 INFO L85 PathProgramCache]: Analyzing trace with hash 577933168, now seen corresponding path program 42 times [2025-03-03 13:40:15,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:15,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15932780] [2025-03-03 13:40:15,503 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:15,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:15,506 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 5 equivalence classes. [2025-03-03 13:40:15,514 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 13:40:15,514 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 13:40:15,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:15,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:15,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15932780] [2025-03-03 13:40:15,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15932780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:15,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561011238] [2025-03-03 13:40:15,683 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:15,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:15,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:15,684 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:15,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-03-03 13:40:15,727 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 5 equivalence classes. [2025-03-03 13:40:15,741 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 13:40:15,741 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 13:40:15,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:15,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 13:40:15,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:16,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:16,265 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:16,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561011238] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:16,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:16,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 39 [2025-03-03 13:40:16,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547099960] [2025-03-03 13:40:16,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:16,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 13:40:16,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:16,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 13:40:16,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1376, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 13:40:16,266 INFO L87 Difference]: Start difference. First operand 251 states and 289 transitions. Second operand has 39 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 39 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:16,754 INFO L93 Difference]: Finished difference Result 269 states and 311 transitions. [2025-03-03 13:40:16,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 13:40:16,754 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 39 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-03 13:40:16,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:16,755 INFO L225 Difference]: With dead ends: 269 [2025-03-03 13:40:16,755 INFO L226 Difference]: Without dead ends: 255 [2025-03-03 13:40:16,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=2253, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 13:40:16,755 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:16,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 396 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:40:16,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-03 13:40:16,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-03-03 13:40:16,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.1535433070866141) internal successors, (293), 254 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 293 transitions. [2025-03-03 13:40:16,811 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 293 transitions. Word has length 31 [2025-03-03 13:40:16,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:16,811 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 293 transitions. [2025-03-03 13:40:16,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 39 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 293 transitions. [2025-03-03 13:40:16,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 13:40:16,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:16,812 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:16,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2025-03-03 13:40:17,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2025-03-03 13:40:17,013 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:17,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:17,013 INFO L85 PathProgramCache]: Analyzing trace with hash 697253238, now seen corresponding path program 43 times [2025-03-03 13:40:17,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:17,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960329718] [2025-03-03 13:40:17,013 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:17,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:17,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 13:40:17,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 13:40:17,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:17,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 13:40:17,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:17,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960329718] [2025-03-03 13:40:17,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960329718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:17,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224411871] [2025-03-03 13:40:17,177 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:17,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:17,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:17,179 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:17,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-03-03 13:40:17,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 13:40:17,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 13:40:17,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:17,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:17,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 13:40:17,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 13:40:17,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 13:40:17,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224411871] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:17,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:17,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 35 [2025-03-03 13:40:17,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563762276] [2025-03-03 13:40:17,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:17,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 13:40:17,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:17,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 13:40:17,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1094, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 13:40:17,514 INFO L87 Difference]: Start difference. First operand 255 states and 293 transitions. Second operand has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:17,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:17,767 INFO L93 Difference]: Finished difference Result 276 states and 317 transitions. [2025-03-03 13:40:17,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 13:40:17,767 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-03 13:40:17,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:17,768 INFO L225 Difference]: With dead ends: 276 [2025-03-03 13:40:17,768 INFO L226 Difference]: Without dead ends: 271 [2025-03-03 13:40:17,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=1824, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 13:40:17,769 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:17,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 290 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:17,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-03 13:40:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 265. [2025-03-03 13:40:17,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.1553030303030303) internal successors, (305), 264 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 305 transitions. [2025-03-03 13:40:17,827 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 305 transitions. Word has length 32 [2025-03-03 13:40:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:17,827 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 305 transitions. [2025-03-03 13:40:17,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 305 transitions. [2025-03-03 13:40:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 13:40:17,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:17,828 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:17,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:18,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:18,029 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:18,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:18,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1533863510, now seen corresponding path program 44 times [2025-03-03 13:40:18,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:18,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211769744] [2025-03-03 13:40:18,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:18,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:18,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-03 13:40:18,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 13:40:18,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:18,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:40:18,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:18,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211769744] [2025-03-03 13:40:18,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211769744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:18,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708216573] [2025-03-03 13:40:18,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:18,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:18,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:18,233 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:18,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-03-03 13:40:18,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-03 13:40:18,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 13:40:18,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:18,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:18,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 13:40:18,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:40:18,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:40:18,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708216573] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:18,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:18,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 37 [2025-03-03 13:40:18,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075793885] [2025-03-03 13:40:18,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:18,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 13:40:18,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:18,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 13:40:18,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1235, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 13:40:18,581 INFO L87 Difference]: Start difference. First operand 265 states and 305 transitions. Second operand has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:18,896 INFO L93 Difference]: Finished difference Result 278 states and 317 transitions. [2025-03-03 13:40:18,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 13:40:18,896 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-03 13:40:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:18,897 INFO L225 Difference]: With dead ends: 278 [2025-03-03 13:40:18,897 INFO L226 Difference]: Without dead ends: 256 [2025-03-03 13:40:18,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=2098, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 13:40:18,898 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 35 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:18,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 417 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:40:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-03 13:40:18,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-03-03 13:40:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.1568627450980393) internal successors, (295), 255 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 295 transitions. [2025-03-03 13:40:18,950 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 295 transitions. Word has length 32 [2025-03-03 13:40:18,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:18,950 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 295 transitions. [2025-03-03 13:40:18,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 295 transitions. [2025-03-03 13:40:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 13:40:18,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:18,951 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:18,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2025-03-03 13:40:19,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:19,152 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:19,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:19,152 INFO L85 PathProgramCache]: Analyzing trace with hash 623335798, now seen corresponding path program 45 times [2025-03-03 13:40:19,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:19,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478897550] [2025-03-03 13:40:19,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:19,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:19,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-03-03 13:40:19,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 13:40:19,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:40:19,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:40:19,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:19,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478897550] [2025-03-03 13:40:19,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478897550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:19,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192090109] [2025-03-03 13:40:19,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:19,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:19,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:19,420 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:19,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2025-03-03 13:40:19,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-03-03 13:40:19,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 13:40:19,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:40:19,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:19,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-03 13:40:19,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:40:19,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:19,763 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:40:19,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192090109] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:19,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:19,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 39 [2025-03-03 13:40:19,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431325428] [2025-03-03 13:40:19,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:19,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 13:40:19,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:19,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 13:40:19,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1384, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 13:40:19,764 INFO L87 Difference]: Start difference. First operand 256 states and 295 transitions. Second operand has 39 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:20,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:20,145 INFO L93 Difference]: Finished difference Result 270 states and 308 transitions. [2025-03-03 13:40:20,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 13:40:20,146 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-03 13:40:20,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:20,146 INFO L225 Difference]: With dead ends: 270 [2025-03-03 13:40:20,146 INFO L226 Difference]: Without dead ends: 249 [2025-03-03 13:40:20,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=2390, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 13:40:20,147 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 45 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:20,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 586 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:40:20,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-03 13:40:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2025-03-03 13:40:20,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.157258064516129) internal successors, (287), 248 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 287 transitions. [2025-03-03 13:40:20,199 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 287 transitions. Word has length 32 [2025-03-03 13:40:20,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:20,199 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 287 transitions. [2025-03-03 13:40:20,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:20,199 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 287 transitions. [2025-03-03 13:40:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 13:40:20,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:20,199 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:20,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2025-03-03 13:40:20,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-03-03 13:40:20,401 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:20,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash -898086314, now seen corresponding path program 46 times [2025-03-03 13:40:20,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:20,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796730323] [2025-03-03 13:40:20,401 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:20,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:20,404 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-03 13:40:20,407 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 13:40:20,407 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:20,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:40:20,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:20,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796730323] [2025-03-03 13:40:20,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796730323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:20,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503256398] [2025-03-03 13:40:20,674 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:20,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:20,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:20,675 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:20,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2025-03-03 13:40:20,721 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-03 13:40:20,735 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 13:40:20,735 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:20,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:20,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-03 13:40:20,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:40:21,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:40:21,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503256398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:21,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:21,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 40 [2025-03-03 13:40:21,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806769084] [2025-03-03 13:40:21,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:21,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-03 13:40:21,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:21,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-03 13:40:21,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1466, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 13:40:21,072 INFO L87 Difference]: Start difference. First operand 249 states and 287 transitions. Second operand has 40 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:21,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:21,509 INFO L93 Difference]: Finished difference Result 288 states and 331 transitions. [2025-03-03 13:40:21,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 13:40:21,509 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-03 13:40:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:21,510 INFO L225 Difference]: With dead ends: 288 [2025-03-03 13:40:21,510 INFO L226 Difference]: Without dead ends: 281 [2025-03-03 13:40:21,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=2599, Unknown=0, NotChecked=0, Total=2756 [2025-03-03 13:40:21,511 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 61 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:21,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 713 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:40:21,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-03 13:40:21,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 256. [2025-03-03 13:40:21,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.1568627450980393) internal successors, (295), 255 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 295 transitions. [2025-03-03 13:40:21,566 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 295 transitions. Word has length 32 [2025-03-03 13:40:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:21,566 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 295 transitions. [2025-03-03 13:40:21,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 295 transitions. [2025-03-03 13:40:21,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 13:40:21,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:21,567 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:21,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2025-03-03 13:40:21,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2025-03-03 13:40:21,768 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:21,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:21,768 INFO L85 PathProgramCache]: Analyzing trace with hash 170521840, now seen corresponding path program 47 times [2025-03-03 13:40:21,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:21,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317085235] [2025-03-03 13:40:21,768 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:21,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:21,771 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-03-03 13:40:21,773 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:40:21,773 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 13:40:21,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:40:21,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:21,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317085235] [2025-03-03 13:40:21,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317085235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:21,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105187568] [2025-03-03 13:40:21,823 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:21,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:21,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:21,827 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:21,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2025-03-03 13:40:21,871 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-03-03 13:40:21,885 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:40:21,885 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 13:40:21,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:21,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:40:21,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:40:21,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:40:21,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105187568] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:21,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:21,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-03-03 13:40:21,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941905823] [2025-03-03 13:40:21,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:21,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 13:40:21,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:21,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 13:40:21,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-03-03 13:40:21,966 INFO L87 Difference]: Start difference. First operand 256 states and 295 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:22,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:22,098 INFO L93 Difference]: Finished difference Result 302 states and 351 transitions. [2025-03-03 13:40:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 13:40:22,098 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-03 13:40:22,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:22,099 INFO L225 Difference]: With dead ends: 302 [2025-03-03 13:40:22,099 INFO L226 Difference]: Without dead ends: 289 [2025-03-03 13:40:22,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2025-03-03 13:40:22,100 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:22,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 102 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:22,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-03 13:40:22,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 280. [2025-03-03 13:40:22,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 1.1720430107526882) internal successors, (327), 279 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 327 transitions. [2025-03-03 13:40:22,156 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 327 transitions. Word has length 33 [2025-03-03 13:40:22,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:22,156 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 327 transitions. [2025-03-03 13:40:22,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:22,157 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 327 transitions. [2025-03-03 13:40:22,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 13:40:22,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:22,157 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:22,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2025-03-03 13:40:22,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-03-03 13:40:22,358 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:22,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:22,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1403371762, now seen corresponding path program 48 times [2025-03-03 13:40:22,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:22,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669055352] [2025-03-03 13:40:22,358 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:22,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:22,361 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-03-03 13:40:22,364 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:40:22,364 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 13:40:22,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:22,429 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:40:22,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:22,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669055352] [2025-03-03 13:40:22,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669055352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:22,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495698444] [2025-03-03 13:40:22,430 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:22,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:22,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:22,431 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:22,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-03-03 13:40:22,480 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-03-03 13:40:22,495 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:40:22,495 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 13:40:22,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:22,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:40:22,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:40:22,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:40:22,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495698444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:22,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:22,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2025-03-03 13:40:22,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354559788] [2025-03-03 13:40:22,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:22,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 13:40:22,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:22,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 13:40:22,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-03 13:40:22,586 INFO L87 Difference]: Start difference. First operand 280 states and 327 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:22,739 INFO L93 Difference]: Finished difference Result 425 states and 510 transitions. [2025-03-03 13:40:22,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 13:40:22,739 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-03 13:40:22,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:22,740 INFO L225 Difference]: With dead ends: 425 [2025-03-03 13:40:22,740 INFO L226 Difference]: Without dead ends: 324 [2025-03-03 13:40:22,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2025-03-03 13:40:22,741 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:22,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 147 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-03 13:40:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2025-03-03 13:40:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.173374613003096) internal successors, (379), 323 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 379 transitions. [2025-03-03 13:40:22,844 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 379 transitions. Word has length 33 [2025-03-03 13:40:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:22,844 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 379 transitions. [2025-03-03 13:40:22,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:22,844 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 379 transitions. [2025-03-03 13:40:22,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 13:40:22,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:22,844 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:22,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2025-03-03 13:40:23,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-03-03 13:40:23,045 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:23,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:23,045 INFO L85 PathProgramCache]: Analyzing trace with hash 589950000, now seen corresponding path program 49 times [2025-03-03 13:40:23,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:23,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010285489] [2025-03-03 13:40:23,046 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:23,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:23,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 13:40:23,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:40:23,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:23,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:23,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:23,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010285489] [2025-03-03 13:40:23,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010285489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:23,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359405946] [2025-03-03 13:40:23,308 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:23,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:23,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:23,311 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:23,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-03-03 13:40:23,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 13:40:23,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:40:23,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:23,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:23,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 13:40:23,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:23,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:23,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359405946] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:23,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:23,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 44 [2025-03-03 13:40:23,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074129843] [2025-03-03 13:40:23,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:23,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-03 13:40:23,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:23,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-03 13:40:23,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1765, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 13:40:23,980 INFO L87 Difference]: Start difference. First operand 324 states and 379 transitions. Second operand has 44 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 44 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-03 13:40:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:24,480 INFO L93 Difference]: Finished difference Result 471 states and 542 transitions. [2025-03-03 13:40:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 13:40:24,480 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 44 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 33 [2025-03-03 13:40:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:24,481 INFO L225 Difference]: With dead ends: 471 [2025-03-03 13:40:24,481 INFO L226 Difference]: Without dead ends: 438 [2025-03-03 13:40:24,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=372, Invalid=2934, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 13:40:24,482 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:24,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 326 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-03 13:40:24,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 359. [2025-03-03 13:40:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.1731843575418994) internal successors, (420), 358 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 420 transitions. [2025-03-03 13:40:24,567 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 420 transitions. Word has length 33 [2025-03-03 13:40:24,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:24,567 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 420 transitions. [2025-03-03 13:40:24,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 44 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-03 13:40:24,567 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 420 transitions. [2025-03-03 13:40:24,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 13:40:24,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:24,567 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:24,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2025-03-03 13:40:24,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-03-03 13:40:24,768 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:24,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash -508849996, now seen corresponding path program 50 times [2025-03-03 13:40:24,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:24,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244515665] [2025-03-03 13:40:24,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:24,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:24,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-03 13:40:24,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:40:24,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:24,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:24,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:24,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244515665] [2025-03-03 13:40:24,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244515665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:24,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409311496] [2025-03-03 13:40:24,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:24,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:24,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:24,971 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:24,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-03-03 13:40:25,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-03 13:40:25,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:40:25,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:25,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:25,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 13:40:25,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:25,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:25,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409311496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:25,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:25,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 45 [2025-03-03 13:40:25,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860569969] [2025-03-03 13:40:25,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:25,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-03 13:40:25,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:25,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-03 13:40:25,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1842, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 13:40:25,686 INFO L87 Difference]: Start difference. First operand 359 states and 420 transitions. Second operand has 45 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 45 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:26,309 INFO L93 Difference]: Finished difference Result 379 states and 445 transitions. [2025-03-03 13:40:26,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 13:40:26,310 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 45 states have internal predecessors, (71), 0 states have call successors, (0), 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 33 [2025-03-03 13:40:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:26,311 INFO L225 Difference]: With dead ends: 379 [2025-03-03 13:40:26,311 INFO L226 Difference]: Without dead ends: 364 [2025-03-03 13:40:26,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=252, Invalid=3054, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 13:40:26,311 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:26,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 396 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:40:26,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-03 13:40:26,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2025-03-03 13:40:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 1.1707988980716253) internal successors, (425), 363 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:26,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 425 transitions. [2025-03-03 13:40:26,398 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 425 transitions. Word has length 33 [2025-03-03 13:40:26,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:26,398 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 425 transitions. [2025-03-03 13:40:26,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 45 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:26,398 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 425 transitions. [2025-03-03 13:40:26,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 13:40:26,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:26,398 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:26,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2025-03-03 13:40:26,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-03-03 13:40:26,599 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:26,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:26,599 INFO L85 PathProgramCache]: Analyzing trace with hash -847060525, now seen corresponding path program 51 times [2025-03-03 13:40:26,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:26,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509863202] [2025-03-03 13:40:26,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:26,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:26,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-03-03 13:40:26,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 13:40:26,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:40:26,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:26,700 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 13:40:26,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:26,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509863202] [2025-03-03 13:40:26,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509863202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:26,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929400771] [2025-03-03 13:40:26,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:26,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:26,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:26,702 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:26,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-03-03 13:40:26,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-03-03 13:40:26,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 13:40:26,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:40:26,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:26,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 13:40:26,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 13:40:26,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 13:40:27,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929400771] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:27,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:27,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2025-03-03 13:40:27,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174379013] [2025-03-03 13:40:27,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:27,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 13:40:27,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:27,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 13:40:27,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2025-03-03 13:40:27,048 INFO L87 Difference]: Start difference. First operand 364 states and 425 transitions. Second operand has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:27,355 INFO L93 Difference]: Finished difference Result 439 states and 507 transitions. [2025-03-03 13:40:27,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 13:40:27,355 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-03 13:40:27,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:27,356 INFO L225 Difference]: With dead ends: 439 [2025-03-03 13:40:27,356 INFO L226 Difference]: Without dead ends: 412 [2025-03-03 13:40:27,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=1195, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 13:40:27,357 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:27,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:27,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-03 13:40:27,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 406. [2025-03-03 13:40:27,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.1506172839506172) internal successors, (466), 405 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 466 transitions. [2025-03-03 13:40:27,450 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 466 transitions. Word has length 34 [2025-03-03 13:40:27,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:27,450 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 466 transitions. [2025-03-03 13:40:27,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:27,450 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 466 transitions. [2025-03-03 13:40:27,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 13:40:27,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:27,450 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:27,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2025-03-03 13:40:27,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:27,651 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:27,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:27,652 INFO L85 PathProgramCache]: Analyzing trace with hash -727398343, now seen corresponding path program 52 times [2025-03-03 13:40:27,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:27,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465374340] [2025-03-03 13:40:27,652 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:27,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:27,655 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-03 13:40:27,658 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 13:40:27,658 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:27,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:27,750 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 13:40:27,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:27,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465374340] [2025-03-03 13:40:27,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465374340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:27,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912176731] [2025-03-03 13:40:27,751 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:27,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:27,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:27,752 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:27,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-03-03 13:40:27,800 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-03 13:40:27,814 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 13:40:27,814 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:27,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:27,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 13:40:27,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 13:40:27,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 13:40:28,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912176731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:28,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:28,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 28 [2025-03-03 13:40:28,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711261593] [2025-03-03 13:40:28,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:28,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 13:40:28,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:28,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 13:40:28,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2025-03-03 13:40:28,072 INFO L87 Difference]: Start difference. First operand 406 states and 466 transitions. Second operand has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:28,309 INFO L93 Difference]: Finished difference Result 450 states and 519 transitions. [2025-03-03 13:40:28,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 13:40:28,310 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-03 13:40:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:28,311 INFO L225 Difference]: With dead ends: 450 [2025-03-03 13:40:28,311 INFO L226 Difference]: Without dead ends: 401 [2025-03-03 13:40:28,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=1084, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 13:40:28,311 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:28,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 239 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:28,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-03 13:40:28,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-03-03 13:40:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 1.1325) internal successors, (453), 400 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:28,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 453 transitions. [2025-03-03 13:40:28,407 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 453 transitions. Word has length 34 [2025-03-03 13:40:28,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:28,407 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 453 transitions. [2025-03-03 13:40:28,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:28,407 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 453 transitions. [2025-03-03 13:40:28,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 13:40:28,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:28,408 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:28,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2025-03-03 13:40:28,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:28,608 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:28,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:28,609 INFO L85 PathProgramCache]: Analyzing trace with hash -367057384, now seen corresponding path program 53 times [2025-03-03 13:40:28,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:28,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423296107] [2025-03-03 13:40:28,609 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:28,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:28,612 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 3 equivalence classes. [2025-03-03 13:40:28,616 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 13:40:28,616 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 13:40:28,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 13:40:28,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:28,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423296107] [2025-03-03 13:40:28,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423296107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:28,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009629380] [2025-03-03 13:40:28,794 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:28,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:28,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:28,796 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:28,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-03-03 13:40:28,843 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 3 equivalence classes. [2025-03-03 13:40:28,857 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 13:40:28,857 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 13:40:28,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:28,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-03 13:40:28,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 13:40:29,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 13:40:29,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009629380] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:29,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:29,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 37 [2025-03-03 13:40:29,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974688026] [2025-03-03 13:40:29,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:29,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 13:40:29,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:29,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 13:40:29,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1234, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 13:40:29,142 INFO L87 Difference]: Start difference. First operand 401 states and 453 transitions. Second operand has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:29,476 INFO L93 Difference]: Finished difference Result 432 states and 487 transitions. [2025-03-03 13:40:29,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 13:40:29,476 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-03 13:40:29,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:29,477 INFO L225 Difference]: With dead ends: 432 [2025-03-03 13:40:29,477 INFO L226 Difference]: Without dead ends: 408 [2025-03-03 13:40:29,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=2094, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 13:40:29,478 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:29,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 397 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-03 13:40:29,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 399. [2025-03-03 13:40:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 1.135678391959799) internal successors, (452), 398 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 452 transitions. [2025-03-03 13:40:29,573 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 452 transitions. Word has length 34 [2025-03-03 13:40:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:29,573 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 452 transitions. [2025-03-03 13:40:29,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 452 transitions. [2025-03-03 13:40:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 13:40:29,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:29,574 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:29,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2025-03-03 13:40:29,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:29,774 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:29,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:29,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1004982482, now seen corresponding path program 54 times [2025-03-03 13:40:29,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:29,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635046486] [2025-03-03 13:40:29,774 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:29,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:29,777 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 3 equivalence classes. [2025-03-03 13:40:29,781 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 13:40:29,781 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 13:40:29,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:40:30,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:30,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635046486] [2025-03-03 13:40:30,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635046486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:30,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591672320] [2025-03-03 13:40:30,007 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:30,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:30,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:30,009 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:30,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-03-03 13:40:30,056 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 3 equivalence classes. [2025-03-03 13:40:30,070 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 13:40:30,070 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 13:40:30,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:30,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-03 13:40:30,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:40:30,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:40:30,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591672320] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:30,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:30,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 41 [2025-03-03 13:40:30,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104987798] [2025-03-03 13:40:30,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:30,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-03 13:40:30,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:30,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-03 13:40:30,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1533, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 13:40:30,394 INFO L87 Difference]: Start difference. First operand 399 states and 452 transitions. Second operand has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:30,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:30,837 INFO L93 Difference]: Finished difference Result 413 states and 465 transitions. [2025-03-03 13:40:30,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 13:40:30,837 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 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 34 [2025-03-03 13:40:30,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:30,838 INFO L225 Difference]: With dead ends: 413 [2025-03-03 13:40:30,838 INFO L226 Difference]: Without dead ends: 390 [2025-03-03 13:40:30,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=2584, Unknown=0, NotChecked=0, Total=2756 [2025-03-03 13:40:30,839 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 41 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:30,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 541 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:40:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-03 13:40:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-03-03 13:40:30,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.1362467866323906) internal successors, (442), 389 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 442 transitions. [2025-03-03 13:40:30,936 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 442 transitions. Word has length 34 [2025-03-03 13:40:30,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:30,936 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 442 transitions. [2025-03-03 13:40:30,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:30,936 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 442 transitions. [2025-03-03 13:40:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 13:40:30,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:30,937 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:30,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2025-03-03 13:40:31,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:31,137 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:31,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:31,138 INFO L85 PathProgramCache]: Analyzing trace with hash -426676904, now seen corresponding path program 55 times [2025-03-03 13:40:31,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:31,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74741056] [2025-03-03 13:40:31,138 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:31,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:31,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 13:40:31,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 13:40:31,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:31,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:40:31,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:31,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74741056] [2025-03-03 13:40:31,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74741056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:31,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628708620] [2025-03-03 13:40:31,383 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:31,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:31,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:31,385 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:31,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-03-03 13:40:31,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 13:40:31,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 13:40:31,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:31,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:31,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-03 13:40:31,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:40:31,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:31,791 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:40:31,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628708620] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:31,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:31,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 42 [2025-03-03 13:40:31,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7982089] [2025-03-03 13:40:31,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:31,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-03 13:40:31,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:31,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-03 13:40:31,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1617, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 13:40:31,792 INFO L87 Difference]: Start difference. First operand 390 states and 442 transitions. Second operand has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:32,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:32,279 INFO L93 Difference]: Finished difference Result 405 states and 456 transitions. [2025-03-03 13:40:32,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 13:40:32,280 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 0 states have call successors, (0), 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 34 [2025-03-03 13:40:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:32,281 INFO L225 Difference]: With dead ends: 405 [2025-03-03 13:40:32,281 INFO L226 Difference]: Without dead ends: 383 [2025-03-03 13:40:32,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=2799, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 13:40:32,281 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 51 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:32,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 719 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:40:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-03 13:40:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2025-03-03 13:40:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.1361256544502618) internal successors, (434), 382 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:32,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 434 transitions. [2025-03-03 13:40:32,372 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 434 transitions. Word has length 34 [2025-03-03 13:40:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:32,372 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 434 transitions. [2025-03-03 13:40:32,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 434 transitions. [2025-03-03 13:40:32,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 13:40:32,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:32,372 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:32,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2025-03-03 13:40:32,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2025-03-03 13:40:32,573 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:32,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:32,573 INFO L85 PathProgramCache]: Analyzing trace with hash -228626030, now seen corresponding path program 56 times [2025-03-03 13:40:32,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:32,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671963727] [2025-03-03 13:40:32,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:32,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:32,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-03 13:40:32,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 13:40:32,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:32,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:40:32,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:32,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671963727] [2025-03-03 13:40:32,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671963727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:32,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181491804] [2025-03-03 13:40:32,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:32,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:32,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:32,910 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:32,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-03-03 13:40:32,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-03 13:40:32,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 13:40:32,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:32,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:32,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-03 13:40:32,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:40:33,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:40:33,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181491804] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:33,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:33,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 44 [2025-03-03 13:40:33,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243775146] [2025-03-03 13:40:33,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:33,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-03 13:40:33,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:33,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-03 13:40:33,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1786, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 13:40:33,301 INFO L87 Difference]: Start difference. First operand 383 states and 434 transitions. Second operand has 44 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:33,856 INFO L93 Difference]: Finished difference Result 430 states and 487 transitions. [2025-03-03 13:40:33,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 13:40:33,856 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 0 states have call successors, (0), 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 34 [2025-03-03 13:40:33,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:33,857 INFO L225 Difference]: With dead ends: 430 [2025-03-03 13:40:33,857 INFO L226 Difference]: Without dead ends: 423 [2025-03-03 13:40:33,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=3133, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 13:40:33,858 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 68 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:33,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 802 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:40:33,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-03 13:40:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 390. [2025-03-03 13:40:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.1362467866323906) internal successors, (442), 389 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:33,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 442 transitions. [2025-03-03 13:40:33,957 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 442 transitions. Word has length 34 [2025-03-03 13:40:33,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:33,957 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 442 transitions. [2025-03-03 13:40:33,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:33,957 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 442 transitions. [2025-03-03 13:40:33,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 13:40:33,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:33,958 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:33,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2025-03-03 13:40:34,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2025-03-03 13:40:34,158 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:34,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:34,158 INFO L85 PathProgramCache]: Analyzing trace with hash -661619180, now seen corresponding path program 57 times [2025-03-03 13:40:34,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:34,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622823305] [2025-03-03 13:40:34,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:34,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:34,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-03-03 13:40:34,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 13:40:34,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:40:34,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 13:40:34,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:34,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622823305] [2025-03-03 13:40:34,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622823305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:34,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955593547] [2025-03-03 13:40:34,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:34,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:34,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:34,229 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:34,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2025-03-03 13:40:34,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-03-03 13:40:34,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 13:40:34,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:40:34,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:34,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 13:40:34,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 13:40:34,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 13:40:34,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955593547] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:34,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:34,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-03-03 13:40:34,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214889841] [2025-03-03 13:40:34,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:34,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 13:40:34,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:34,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 13:40:34,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2025-03-03 13:40:34,396 INFO L87 Difference]: Start difference. First operand 390 states and 442 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:34,577 INFO L93 Difference]: Finished difference Result 465 states and 530 transitions. [2025-03-03 13:40:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 13:40:34,577 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-03 13:40:34,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:34,578 INFO L225 Difference]: With dead ends: 465 [2025-03-03 13:40:34,578 INFO L226 Difference]: Without dead ends: 378 [2025-03-03 13:40:34,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2025-03-03 13:40:34,579 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 30 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:34,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 200 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-03 13:40:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-03-03 13:40:34,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.129973474801061) internal successors, (426), 377 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 426 transitions. [2025-03-03 13:40:34,672 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 426 transitions. Word has length 35 [2025-03-03 13:40:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:34,672 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 426 transitions. [2025-03-03 13:40:34,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 426 transitions. [2025-03-03 13:40:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 13:40:34,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:34,672 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:34,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:34,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:34,873 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:34,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:34,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1900460976, now seen corresponding path program 58 times [2025-03-03 13:40:34,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:34,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943737331] [2025-03-03 13:40:34,873 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:34,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:34,878 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-03-03 13:40:34,881 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 13:40:34,881 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:34,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:34,938 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 13:40:34,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:34,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943737331] [2025-03-03 13:40:34,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943737331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:34,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646193944] [2025-03-03 13:40:34,938 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:34,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:34,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:34,940 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:34,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-03-03 13:40:34,989 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-03-03 13:40:35,004 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 13:40:35,004 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:35,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:35,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 13:40:35,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 13:40:35,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 13:40:35,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646193944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:35,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:35,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-03-03 13:40:35,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878019957] [2025-03-03 13:40:35,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:35,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 13:40:35,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:35,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 13:40:35,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2025-03-03 13:40:35,099 INFO L87 Difference]: Start difference. First operand 378 states and 426 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:35,266 INFO L93 Difference]: Finished difference Result 393 states and 441 transitions. [2025-03-03 13:40:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 13:40:35,266 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-03 13:40:35,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:35,267 INFO L225 Difference]: With dead ends: 393 [2025-03-03 13:40:35,267 INFO L226 Difference]: Without dead ends: 388 [2025-03-03 13:40:35,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 54 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=483, Unknown=0, NotChecked=0, Total=756 [2025-03-03 13:40:35,267 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 45 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:35,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 89 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:35,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-03 13:40:35,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 379. [2025-03-03 13:40:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 1.1296296296296295) internal successors, (427), 378 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 427 transitions. [2025-03-03 13:40:35,360 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 427 transitions. Word has length 35 [2025-03-03 13:40:35,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:35,361 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 427 transitions. [2025-03-03 13:40:35,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 427 transitions. [2025-03-03 13:40:35,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 13:40:35,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:35,361 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:35,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2025-03-03 13:40:35,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:35,561 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:35,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash -131617676, now seen corresponding path program 59 times [2025-03-03 13:40:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:35,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631603012] [2025-03-03 13:40:35,562 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:35,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:35,565 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 6 equivalence classes. [2025-03-03 13:40:35,569 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 13:40:35,569 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 13:40:35,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:35,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:35,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631603012] [2025-03-03 13:40:35,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631603012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:35,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538050363] [2025-03-03 13:40:35,766 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:35,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:35,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:35,768 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:35,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2025-03-03 13:40:35,818 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 6 equivalence classes. [2025-03-03 13:40:35,833 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 13:40:35,833 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 13:40:35,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:35,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 13:40:35,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:36,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:36,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538050363] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:36,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:36,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 48 [2025-03-03 13:40:36,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378989997] [2025-03-03 13:40:36,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:36,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-03 13:40:36,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:36,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-03 13:40:36,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 13:40:36,537 INFO L87 Difference]: Start difference. First operand 379 states and 427 transitions. Second operand has 48 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 48 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:37,116 INFO L93 Difference]: Finished difference Result 550 states and 613 transitions. [2025-03-03 13:40:37,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 13:40:37,116 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 48 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-03 13:40:37,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:37,118 INFO L225 Difference]: With dead ends: 550 [2025-03-03 13:40:37,118 INFO L226 Difference]: Without dead ends: 515 [2025-03-03 13:40:37,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=446, Invalid=3586, Unknown=0, NotChecked=0, Total=4032 [2025-03-03 13:40:37,118 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:37,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 329 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:37,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-03 13:40:37,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 421. [2025-03-03 13:40:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.1285714285714286) internal successors, (474), 420 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 474 transitions. [2025-03-03 13:40:37,230 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 474 transitions. Word has length 35 [2025-03-03 13:40:37,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:37,230 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 474 transitions. [2025-03-03 13:40:37,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 48 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:37,230 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 474 transitions. [2025-03-03 13:40:37,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 13:40:37,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:37,230 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:37,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2025-03-03 13:40:37,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2025-03-03 13:40:37,431 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:37,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:37,431 INFO L85 PathProgramCache]: Analyzing trace with hash 165320816, now seen corresponding path program 60 times [2025-03-03 13:40:37,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:37,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048644722] [2025-03-03 13:40:37,431 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:37,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:37,434 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 6 equivalence classes. [2025-03-03 13:40:37,439 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 13:40:37,439 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-03 13:40:37,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:37,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:37,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048644722] [2025-03-03 13:40:37,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048644722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:37,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323402700] [2025-03-03 13:40:37,641 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:37,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:37,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:37,643 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:37,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2025-03-03 13:40:37,695 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 6 equivalence classes. [2025-03-03 13:40:37,714 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 13:40:37,714 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-03 13:40:37,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:37,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 13:40:37,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:38,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:38,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323402700] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:38,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:38,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 49 [2025-03-03 13:40:38,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117757210] [2025-03-03 13:40:38,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:38,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-03 13:40:38,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:38,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-03 13:40:38,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 13:40:38,466 INFO L87 Difference]: Start difference. First operand 421 states and 474 transitions. Second operand has 49 states, 49 states have (on average 1.530612244897959) internal successors, (75), 49 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:39,246 INFO L93 Difference]: Finished difference Result 442 states and 500 transitions. [2025-03-03 13:40:39,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 13:40:39,246 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.530612244897959) internal successors, (75), 49 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 35 [2025-03-03 13:40:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:39,247 INFO L225 Difference]: With dead ends: 442 [2025-03-03 13:40:39,247 INFO L226 Difference]: Without dead ends: 426 [2025-03-03 13:40:39,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 33 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=285, Invalid=3875, Unknown=0, NotChecked=0, Total=4160 [2025-03-03 13:40:39,248 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:39,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 520 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:40:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-03 13:40:39,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2025-03-03 13:40:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 1.1270588235294117) internal successors, (479), 425 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:39,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 479 transitions. [2025-03-03 13:40:39,364 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 479 transitions. Word has length 35 [2025-03-03 13:40:39,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:39,364 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 479 transitions. [2025-03-03 13:40:39,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.530612244897959) internal successors, (75), 49 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 479 transitions. [2025-03-03 13:40:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:40:39,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:39,365 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:39,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2025-03-03 13:40:39,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2025-03-03 13:40:39,565 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:39,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:39,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1245759830, now seen corresponding path program 61 times [2025-03-03 13:40:39,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:39,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822588390] [2025-03-03 13:40:39,566 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:39,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:39,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:40:39,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:40:39,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:39,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 13:40:39,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:39,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822588390] [2025-03-03 13:40:39,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822588390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:39,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009387124] [2025-03-03 13:40:39,778 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:39,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:39,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:39,780 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:39,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2025-03-03 13:40:39,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:40:39,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:40:39,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:39,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:39,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 13:40:39,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 13:40:40,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 13:40:40,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009387124] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:40,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:40,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 39 [2025-03-03 13:40:40,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653685116] [2025-03-03 13:40:40,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:40,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 13:40:40,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:40,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 13:40:40,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1373, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 13:40:40,194 INFO L87 Difference]: Start difference. First operand 426 states and 479 transitions. Second operand has 39 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:40,564 INFO L93 Difference]: Finished difference Result 449 states and 505 transitions. [2025-03-03 13:40:40,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 13:40:40,564 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-03 13:40:40,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:40,566 INFO L225 Difference]: With dead ends: 449 [2025-03-03 13:40:40,566 INFO L226 Difference]: Without dead ends: 444 [2025-03-03 13:40:40,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=2274, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 13:40:40,566 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:40,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 318 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:40:40,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-03 13:40:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 437. [2025-03-03 13:40:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.128440366972477) internal successors, (492), 436 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 492 transitions. [2025-03-03 13:40:40,683 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 492 transitions. Word has length 36 [2025-03-03 13:40:40,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:40,683 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 492 transitions. [2025-03-03 13:40:40,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 492 transitions. [2025-03-03 13:40:40,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:40:40,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:40,683 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:40,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2025-03-03 13:40:40,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:40,884 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:40,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:40,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1510072394, now seen corresponding path program 62 times [2025-03-03 13:40:40,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:40,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243927697] [2025-03-03 13:40:40,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:40,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:40,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-03 13:40:40,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:40:40,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:40,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 13:40:41,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:41,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243927697] [2025-03-03 13:40:41,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243927697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:41,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596234128] [2025-03-03 13:40:41,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:41,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:41,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:41,129 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:41,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-03-03 13:40:41,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-03 13:40:41,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:40:41,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:41,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:41,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-03 13:40:41,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 13:40:41,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 13:40:41,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596234128] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:41,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:41,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 41 [2025-03-03 13:40:41,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253369125] [2025-03-03 13:40:41,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:41,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-03 13:40:41,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:41,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-03 13:40:41,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1530, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 13:40:41,553 INFO L87 Difference]: Start difference. First operand 437 states and 492 transitions. Second operand has 41 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:41,957 INFO L93 Difference]: Finished difference Result 451 states and 505 transitions. [2025-03-03 13:40:41,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 13:40:41,957 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-03 13:40:41,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:41,958 INFO L225 Difference]: With dead ends: 451 [2025-03-03 13:40:41,958 INFO L226 Difference]: Without dead ends: 426 [2025-03-03 13:40:41,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=2578, Unknown=0, NotChecked=0, Total=2756 [2025-03-03 13:40:41,959 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 35 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:41,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 437 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:40:41,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-03 13:40:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2025-03-03 13:40:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 1.1294117647058823) internal successors, (480), 425 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 480 transitions. [2025-03-03 13:40:42,073 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 480 transitions. Word has length 36 [2025-03-03 13:40:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:42,073 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 480 transitions. [2025-03-03 13:40:42,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 480 transitions. [2025-03-03 13:40:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:40:42,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:42,074 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:42,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2025-03-03 13:40:42,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable71 [2025-03-03 13:40:42,274 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:42,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:42,275 INFO L85 PathProgramCache]: Analyzing trace with hash -219507370, now seen corresponding path program 63 times [2025-03-03 13:40:42,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:42,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867268898] [2025-03-03 13:40:42,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:42,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:42,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 4 equivalence classes. [2025-03-03 13:40:42,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:40:42,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:40:42,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:40:42,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:42,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867268898] [2025-03-03 13:40:42,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867268898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:42,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155773815] [2025-03-03 13:40:42,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:42,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:42,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:42,579 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:42,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-03-03 13:40:42,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 4 equivalence classes. [2025-03-03 13:40:42,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:40:42,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:40:42,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:42,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-03 13:40:42,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:40:42,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:40:42,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155773815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:42,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:42,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 43 [2025-03-03 13:40:42,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528291848] [2025-03-03 13:40:42,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:43,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 13:40:43,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:43,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 13:40:43,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1695, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 13:40:43,000 INFO L87 Difference]: Start difference. First operand 426 states and 480 transitions. Second operand has 43 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:43,503 INFO L93 Difference]: Finished difference Result 441 states and 494 transitions. [2025-03-03 13:40:43,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 13:40:43,503 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-03 13:40:43,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:43,505 INFO L225 Difference]: With dead ends: 441 [2025-03-03 13:40:43,505 INFO L226 Difference]: Without dead ends: 417 [2025-03-03 13:40:43,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=2900, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 13:40:43,505 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 47 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:43,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 671 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:40:43,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-03 13:40:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2025-03-03 13:40:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.1298076923076923) internal successors, (470), 416 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 470 transitions. [2025-03-03 13:40:43,615 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 470 transitions. Word has length 36 [2025-03-03 13:40:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:43,615 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 470 transitions. [2025-03-03 13:40:43,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 470 transitions. [2025-03-03 13:40:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:40:43,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:43,616 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:43,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:43,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:43,816 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:43,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:43,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1991103414, now seen corresponding path program 64 times [2025-03-03 13:40:43,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:43,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728126414] [2025-03-03 13:40:43,817 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:43,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:43,820 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-03 13:40:43,823 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:40:43,823 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:43,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:40:44,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:44,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728126414] [2025-03-03 13:40:44,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728126414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:44,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985452940] [2025-03-03 13:40:44,104 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:44,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:44,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:44,106 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:44,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2025-03-03 13:40:44,157 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-03 13:40:44,172 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:40:44,172 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:44,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:44,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-03 13:40:44,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:40:44,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:40:44,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985452940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:44,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:44,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 44 [2025-03-03 13:40:44,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106663698] [2025-03-03 13:40:44,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:44,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-03 13:40:44,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:44,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-03 13:40:44,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1785, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 13:40:44,534 INFO L87 Difference]: Start difference. First operand 417 states and 470 transitions. Second operand has 44 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:45,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:45,074 INFO L93 Difference]: Finished difference Result 433 states and 485 transitions. [2025-03-03 13:40:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 13:40:45,075 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-03 13:40:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:45,076 INFO L225 Difference]: With dead ends: 433 [2025-03-03 13:40:45,076 INFO L226 Difference]: Without dead ends: 410 [2025-03-03 13:40:45,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=3129, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 13:40:45,076 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 59 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:45,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 779 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:40:45,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-03 13:40:45,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2025-03-03 13:40:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.1295843520782396) internal successors, (462), 409 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 462 transitions. [2025-03-03 13:40:45,187 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 462 transitions. Word has length 36 [2025-03-03 13:40:45,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:45,187 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 462 transitions. [2025-03-03 13:40:45,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 462 transitions. [2025-03-03 13:40:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:40:45,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:45,187 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:45,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2025-03-03 13:40:45,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:45,388 INFO L396 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:45,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:45,388 INFO L85 PathProgramCache]: Analyzing trace with hash -804167338, now seen corresponding path program 65 times [2025-03-03 13:40:45,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:45,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841862002] [2025-03-03 13:40:45,388 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:45,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:45,391 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 6 equivalence classes. [2025-03-03 13:40:45,395 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:40:45,395 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 13:40:45,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:45,688 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:40:45,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:45,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841862002] [2025-03-03 13:40:45,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841862002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:45,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700375724] [2025-03-03 13:40:45,688 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:45,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:45,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:45,690 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:45,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-03-03 13:40:45,743 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 6 equivalence classes. [2025-03-03 13:40:45,758 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:40:45,758 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 13:40:45,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:45,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-03 13:40:45,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:40:46,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:40:46,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700375724] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:46,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:46,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 46 [2025-03-03 13:40:46,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540035933] [2025-03-03 13:40:46,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:46,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-03 13:40:46,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:46,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-03 13:40:46,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1962, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 13:40:46,118 INFO L87 Difference]: Start difference. First operand 410 states and 462 transitions. Second operand has 46 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:46,754 INFO L93 Difference]: Finished difference Result 459 states and 517 transitions. [2025-03-03 13:40:46,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 13:40:46,754 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-03 13:40:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:46,755 INFO L225 Difference]: With dead ends: 459 [2025-03-03 13:40:46,755 INFO L226 Difference]: Without dead ends: 452 [2025-03-03 13:40:46,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=3481, Unknown=0, NotChecked=0, Total=3660 [2025-03-03 13:40:46,756 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 72 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:46,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 976 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:40:46,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-03 13:40:46,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 417. [2025-03-03 13:40:46,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.1298076923076923) internal successors, (470), 416 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 470 transitions. [2025-03-03 13:40:46,867 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 470 transitions. Word has length 36 [2025-03-03 13:40:46,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:46,867 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 470 transitions. [2025-03-03 13:40:46,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:46,867 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 470 transitions. [2025-03-03 13:40:46,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 13:40:46,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:46,868 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:46,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2025-03-03 13:40:47,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2025-03-03 13:40:47,068 INFO L396 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:47,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:47,068 INFO L85 PathProgramCache]: Analyzing trace with hash -5642992, now seen corresponding path program 66 times [2025-03-03 13:40:47,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:47,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719138559] [2025-03-03 13:40:47,068 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:47,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:47,071 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-03-03 13:40:47,075 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:40:47,075 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 13:40:47,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 13:40:47,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:47,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719138559] [2025-03-03 13:40:47,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719138559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:47,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092720971] [2025-03-03 13:40:47,145 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:47,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:47,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:47,147 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:47,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2025-03-03 13:40:47,200 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-03-03 13:40:47,215 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:40:47,215 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 13:40:47,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:47,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 13:40:47,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 13:40:47,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 13:40:47,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092720971] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:47,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:47,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2025-03-03 13:40:47,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401264996] [2025-03-03 13:40:47,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:47,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 13:40:47,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:47,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 13:40:47,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 13:40:47,325 INFO L87 Difference]: Start difference. First operand 417 states and 470 transitions. Second operand has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:47,565 INFO L93 Difference]: Finished difference Result 475 states and 540 transitions. [2025-03-03 13:40:47,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 13:40:47,566 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 13:40:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:47,567 INFO L225 Difference]: With dead ends: 475 [2025-03-03 13:40:47,567 INFO L226 Difference]: Without dead ends: 461 [2025-03-03 13:40:47,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=327, Invalid=933, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 13:40:47,567 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:47,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 121 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-03 13:40:47,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2025-03-03 13:40:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.1434977578475336) internal successors, (510), 446 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 510 transitions. [2025-03-03 13:40:47,686 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 510 transitions. Word has length 37 [2025-03-03 13:40:47,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:47,686 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 510 transitions. [2025-03-03 13:40:47,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 510 transitions. [2025-03-03 13:40:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 13:40:47,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:47,686 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:47,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2025-03-03 13:40:47,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:47,887 INFO L396 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:47,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:47,887 INFO L85 PathProgramCache]: Analyzing trace with hash 244966996, now seen corresponding path program 67 times [2025-03-03 13:40:47,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:47,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833155232] [2025-03-03 13:40:47,887 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:47,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:47,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 13:40:47,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:40:47,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:47,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:47,959 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 13:40:47,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:47,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833155232] [2025-03-03 13:40:47,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833155232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:47,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620820642] [2025-03-03 13:40:47,959 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:47,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:47,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:47,960 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:47,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2025-03-03 13:40:48,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 13:40:48,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:40:48,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:48,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:48,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 13:40:48,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 13:40:48,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 13:40:48,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620820642] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:48,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:48,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2025-03-03 13:40:48,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338637359] [2025-03-03 13:40:48,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:48,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 13:40:48,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:48,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 13:40:48,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 13:40:48,146 INFO L87 Difference]: Start difference. First operand 447 states and 510 transitions. Second operand has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:48,401 INFO L93 Difference]: Finished difference Result 648 states and 759 transitions. [2025-03-03 13:40:48,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 13:40:48,401 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 13:40:48,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:48,402 INFO L225 Difference]: With dead ends: 648 [2025-03-03 13:40:48,402 INFO L226 Difference]: Without dead ends: 512 [2025-03-03 13:40:48,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=327, Invalid=933, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 13:40:48,403 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:48,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 109 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:48,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-03 13:40:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2025-03-03 13:40:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 1.1448140900195696) internal successors, (585), 511 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:48,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 585 transitions. [2025-03-03 13:40:48,544 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 585 transitions. Word has length 37 [2025-03-03 13:40:48,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:48,544 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 585 transitions. [2025-03-03 13:40:48,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:48,544 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 585 transitions. [2025-03-03 13:40:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 13:40:48,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:48,544 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:48,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2025-03-03 13:40:48,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:48,745 INFO L396 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:48,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:48,745 INFO L85 PathProgramCache]: Analyzing trace with hash -793529040, now seen corresponding path program 68 times [2025-03-03 13:40:48,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:48,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795323498] [2025-03-03 13:40:48,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:48,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:48,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-03 13:40:48,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:40:48,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:48,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:49,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:49,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795323498] [2025-03-03 13:40:49,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795323498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:49,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915551691] [2025-03-03 13:40:49,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:49,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:49,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:49,008 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:49,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2025-03-03 13:40:49,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-03 13:40:49,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:40:49,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:49,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:49,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 13:40:49,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:49,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:49,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915551691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:49,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:49,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 54 [2025-03-03 13:40:49,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200651927] [2025-03-03 13:40:49,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:49,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-03 13:40:49,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:49,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-03 13:40:49,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2705, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 13:40:49,946 INFO L87 Difference]: Start difference. First operand 512 states and 585 transitions. Second operand has 54 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 54 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:50,757 INFO L93 Difference]: Finished difference Result 757 states and 849 transitions. [2025-03-03 13:40:50,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 13:40:50,757 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 54 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 13:40:50,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:50,759 INFO L225 Difference]: With dead ends: 757 [2025-03-03 13:40:50,759 INFO L226 Difference]: Without dead ends: 719 [2025-03-03 13:40:50,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=535, Invalid=4577, Unknown=0, NotChecked=0, Total=5112 [2025-03-03 13:40:50,759 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:50,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 412 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:40:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-03-03 13:40:50,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 563. [2025-03-03 13:40:50,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 1.1441281138790036) internal successors, (643), 562 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 643 transitions. [2025-03-03 13:40:50,923 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 643 transitions. Word has length 37 [2025-03-03 13:40:50,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:50,923 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 643 transitions. [2025-03-03 13:40:50,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 54 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 643 transitions. [2025-03-03 13:40:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 13:40:50,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:50,924 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:50,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:51,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:51,124 INFO L396 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:51,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:51,125 INFO L85 PathProgramCache]: Analyzing trace with hash -178370380, now seen corresponding path program 69 times [2025-03-03 13:40:51,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:51,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004262878] [2025-03-03 13:40:51,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:51,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:51,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 6 equivalence classes. [2025-03-03 13:40:51,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:40:51,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 13:40:51,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:51,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:51,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004262878] [2025-03-03 13:40:51,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004262878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:51,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721890645] [2025-03-03 13:40:51,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:51,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:51,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:51,399 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:51,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2025-03-03 13:40:51,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 6 equivalence classes. [2025-03-03 13:40:51,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:40:51,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 13:40:51,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:51,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 13:40:51,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:51,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:52,348 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:40:52,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721890645] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:52,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:52,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 55 [2025-03-03 13:40:52,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622900802] [2025-03-03 13:40:52,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:52,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-03 13:40:52,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:52,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-03 13:40:52,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2800, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 13:40:52,349 INFO L87 Difference]: Start difference. First operand 563 states and 643 transitions. Second operand has 55 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 55 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:53,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:53,392 INFO L93 Difference]: Finished difference Result 586 states and 672 transitions. [2025-03-03 13:40:53,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 13:40:53,393 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 55 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 13:40:53,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:53,394 INFO L225 Difference]: With dead ends: 586 [2025-03-03 13:40:53,394 INFO L226 Difference]: Without dead ends: 569 [2025-03-03 13:40:53,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 33 SyntacticMatches, 10 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=336, Invalid=4776, Unknown=0, NotChecked=0, Total=5112 [2025-03-03 13:40:53,395 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:53,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 511 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:40:53,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-03 13:40:53,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2025-03-03 13:40:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.142605633802817) internal successors, (649), 568 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 649 transitions. [2025-03-03 13:40:53,566 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 649 transitions. Word has length 37 [2025-03-03 13:40:53,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:53,566 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 649 transitions. [2025-03-03 13:40:53,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 55 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:53,566 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 649 transitions. [2025-03-03 13:40:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:40:53,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:53,567 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:53,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2025-03-03 13:40:53,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2025-03-03 13:40:53,767 INFO L396 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:53,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:53,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1366924953, now seen corresponding path program 70 times [2025-03-03 13:40:53,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:53,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459687207] [2025-03-03 13:40:53,768 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:53,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:53,772 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-03 13:40:53,775 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:40:53,775 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:53,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 13:40:53,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:53,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459687207] [2025-03-03 13:40:53,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459687207] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:53,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279171902] [2025-03-03 13:40:53,887 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:53,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:53,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:53,888 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:53,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2025-03-03 13:40:53,945 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-03 13:40:53,961 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:40:53,961 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:53,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:53,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 13:40:53,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 13:40:54,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 13:40:54,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279171902] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:54,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:54,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 33 [2025-03-03 13:40:54,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317952141] [2025-03-03 13:40:54,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:54,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 13:40:54,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:54,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 13:40:54,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 13:40:54,322 INFO L87 Difference]: Start difference. First operand 569 states and 649 transitions. Second operand has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:54,765 INFO L93 Difference]: Finished difference Result 671 states and 760 transitions. [2025-03-03 13:40:54,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 13:40:54,766 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 0 states have call successors, (0), 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 38 [2025-03-03 13:40:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:54,767 INFO L225 Difference]: With dead ends: 671 [2025-03-03 13:40:54,767 INFO L226 Difference]: Without dead ends: 639 [2025-03-03 13:40:54,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=1563, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 13:40:54,768 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:54,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:54,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-03-03 13:40:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 632. [2025-03-03 13:40:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 1.126782884310618) internal successors, (711), 631 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 711 transitions. [2025-03-03 13:40:54,950 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 711 transitions. Word has length 38 [2025-03-03 13:40:54,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:54,950 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 711 transitions. [2025-03-03 13:40:54,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:54,950 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 711 transitions. [2025-03-03 13:40:54,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:40:54,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:54,950 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:54,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2025-03-03 13:40:55,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:55,151 INFO L396 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:55,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:55,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1467553139, now seen corresponding path program 71 times [2025-03-03 13:40:55,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:55,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104768353] [2025-03-03 13:40:55,151 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:55,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:55,154 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-03-03 13:40:55,158 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:40:55,158 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 13:40:55,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 13:40:55,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:55,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104768353] [2025-03-03 13:40:55,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104768353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:55,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566164415] [2025-03-03 13:40:55,271 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:55,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:55,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:55,273 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:55,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2025-03-03 13:40:55,328 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-03-03 13:40:55,344 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:40:55,344 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 13:40:55,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:55,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 13:40:55,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 13:40:55,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 13:40:55,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566164415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:55,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:55,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 33 [2025-03-03 13:40:55,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267518390] [2025-03-03 13:40:55,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:55,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 13:40:55,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:55,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 13:40:55,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 13:40:55,686 INFO L87 Difference]: Start difference. First operand 632 states and 711 transitions. Second operand has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:56,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:56,079 INFO L93 Difference]: Finished difference Result 684 states and 774 transitions. [2025-03-03 13:40:56,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 13:40:56,079 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 0 states have call successors, (0), 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 38 [2025-03-03 13:40:56,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:56,081 INFO L225 Difference]: With dead ends: 684 [2025-03-03 13:40:56,081 INFO L226 Difference]: Without dead ends: 626 [2025-03-03 13:40:56,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=1573, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 13:40:56,081 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:56,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:56,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-03 13:40:56,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2025-03-03 13:40:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 625 states have (on average 1.112) internal successors, (695), 625 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 695 transitions. [2025-03-03 13:40:56,270 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 695 transitions. Word has length 38 [2025-03-03 13:40:56,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:56,270 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 695 transitions. [2025-03-03 13:40:56,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 695 transitions. [2025-03-03 13:40:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:40:56,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:56,270 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:56,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2025-03-03 13:40:56,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:56,471 INFO L396 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:56,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:56,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1926440942, now seen corresponding path program 72 times [2025-03-03 13:40:56,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:56,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766395206] [2025-03-03 13:40:56,471 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:56,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:56,474 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-03-03 13:40:56,478 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:40:56,479 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 13:40:56,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 13:40:56,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:56,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766395206] [2025-03-03 13:40:56,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766395206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:56,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422905496] [2025-03-03 13:40:56,742 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:56,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:56,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:56,743 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:56,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-03-03 13:40:56,800 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-03-03 13:40:56,819 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:40:56,819 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 13:40:56,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:56,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-03 13:40:56,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 13:40:57,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:57,204 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 13:40:57,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422905496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:57,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:57,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 42 [2025-03-03 13:40:57,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738413128] [2025-03-03 13:40:57,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:57,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-03 13:40:57,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:57,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-03 13:40:57,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1606, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 13:40:57,205 INFO L87 Difference]: Start difference. First operand 626 states and 695 transitions. Second operand has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:57,763 INFO L93 Difference]: Finished difference Result 660 states and 732 transitions. [2025-03-03 13:40:57,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 13:40:57,763 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 0 states have call successors, (0), 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 38 [2025-03-03 13:40:57,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:57,765 INFO L225 Difference]: With dead ends: 660 [2025-03-03 13:40:57,765 INFO L226 Difference]: Without dead ends: 633 [2025-03-03 13:40:57,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=2675, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 13:40:57,765 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:57,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 463 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:40:57,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-03 13:40:57,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 623. [2025-03-03 13:40:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 622 states have (on average 1.1141479099678457) internal successors, (693), 622 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 693 transitions. [2025-03-03 13:40:57,950 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 693 transitions. Word has length 38 [2025-03-03 13:40:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:57,950 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 693 transitions. [2025-03-03 13:40:57,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 693 transitions. [2025-03-03 13:40:57,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:40:57,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:57,951 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:57,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2025-03-03 13:40:58,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2025-03-03 13:40:58,151 INFO L396 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:58,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:58,151 INFO L85 PathProgramCache]: Analyzing trace with hash -80435240, now seen corresponding path program 73 times [2025-03-03 13:40:58,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:58,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116592914] [2025-03-03 13:40:58,152 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:58,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:58,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:40:58,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:40:58,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:58,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:58,398 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 13:40:58,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:58,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116592914] [2025-03-03 13:40:58,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116592914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:58,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453969146] [2025-03-03 13:40:58,398 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:58,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:58,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:58,400 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:58,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2025-03-03 13:40:58,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:40:58,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:40:58,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:58,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:58,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-03 13:40:58,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 13:40:58,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 13:40:58,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453969146] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:58,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:58,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 44 [2025-03-03 13:40:58,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806341351] [2025-03-03 13:40:58,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:58,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-03 13:40:58,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:58,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-03 13:40:58,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1775, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 13:40:58,857 INFO L87 Difference]: Start difference. First operand 623 states and 693 transitions. Second operand has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:59,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:59,406 INFO L93 Difference]: Finished difference Result 638 states and 707 transitions. [2025-03-03 13:40:59,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 13:40:59,406 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 0 states have call successors, (0), 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 38 [2025-03-03 13:40:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:59,408 INFO L225 Difference]: With dead ends: 638 [2025-03-03 13:40:59,408 INFO L226 Difference]: Without dead ends: 612 [2025-03-03 13:40:59,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=3003, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 13:40:59,408 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 41 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:59,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 561 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:40:59,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-03-03 13:40:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2025-03-03 13:40:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 611 states have (on average 1.1145662847790507) internal successors, (681), 611 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 681 transitions. [2025-03-03 13:40:59,591 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 681 transitions. Word has length 38 [2025-03-03 13:40:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:59,591 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 681 transitions. [2025-03-03 13:40:59,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:59,591 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 681 transitions. [2025-03-03 13:40:59,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:40:59,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:59,591 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:59,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:59,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:59,792 INFO L396 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:59,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:59,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1777999662, now seen corresponding path program 74 times [2025-03-03 13:40:59,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:59,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124759627] [2025-03-03 13:40:59,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:59,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:59,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 13:40:59,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:40:59,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:59,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:41:00,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:00,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124759627] [2025-03-03 13:41:00,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124759627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:41:00,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053112731] [2025-03-03 13:41:00,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:41:00,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:00,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:41:00,086 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:41:00,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2025-03-03 13:41:00,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 13:41:00,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:41:00,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:41:00,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:00,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-03 13:41:00,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:41:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:41:00,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:41:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:41:00,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053112731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:41:00,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:41:00,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 46 [2025-03-03 13:41:00,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195586512] [2025-03-03 13:41:00,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:41:00,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-03 13:41:00,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:00,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-03 13:41:00,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1952, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 13:41:00,591 INFO L87 Difference]: Start difference. First operand 612 states and 681 transitions. Second operand has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:01,236 INFO L93 Difference]: Finished difference Result 628 states and 696 transitions. [2025-03-03 13:41:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 13:41:01,236 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-03 13:41:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:01,237 INFO L225 Difference]: With dead ends: 628 [2025-03-03 13:41:01,237 INFO L226 Difference]: Without dead ends: 603 [2025-03-03 13:41:01,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=3349, Unknown=0, NotChecked=0, Total=3540 [2025-03-03 13:41:01,238 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 51 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:01,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 786 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:41:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-03 13:41:01,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2025-03-03 13:41:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 602 states have (on average 1.1146179401993355) internal successors, (671), 602 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 671 transitions. [2025-03-03 13:41:01,419 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 671 transitions. Word has length 38 [2025-03-03 13:41:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:01,419 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 671 transitions. [2025-03-03 13:41:01,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 671 transitions. [2025-03-03 13:41:01,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:41:01,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:01,419 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:41:01,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2025-03-03 13:41:01,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:01,620 INFO L396 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:01,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:01,620 INFO L85 PathProgramCache]: Analyzing trace with hash 224048920, now seen corresponding path program 75 times [2025-03-03 13:41:01,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:01,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007963150] [2025-03-03 13:41:01,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:41:01,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:01,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-03 13:41:01,633 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:41:01,633 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 13:41:01,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:41:01,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:01,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007963150] [2025-03-03 13:41:01,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007963150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:41:01,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433667439] [2025-03-03 13:41:01,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:41:01,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:01,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:41:01,960 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:41:01,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2025-03-03 13:41:02,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-03 13:41:02,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:41:02,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 13:41:02,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:02,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-03 13:41:02,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:41:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:41:02,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:41:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:41:02,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433667439] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:41:02,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:41:02,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 48 [2025-03-03 13:41:02,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890639876] [2025-03-03 13:41:02,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:41:02,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-03 13:41:02,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:02,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-03 13:41:02,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=2138, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 13:41:02,475 INFO L87 Difference]: Start difference. First operand 603 states and 671 transitions. Second operand has 48 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:03,277 INFO L93 Difference]: Finished difference Result 620 states and 687 transitions. [2025-03-03 13:41:03,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 13:41:03,278 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 0 states have call successors, (0), 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 38 [2025-03-03 13:41:03,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:03,279 INFO L225 Difference]: With dead ends: 620 [2025-03-03 13:41:03,279 INFO L226 Difference]: Without dead ends: 596 [2025-03-03 13:41:03,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=3714, Unknown=0, NotChecked=0, Total=3906 [2025-03-03 13:41:03,280 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 63 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:03,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 969 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:41:03,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-03 13:41:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-03 13:41:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.1142857142857143) internal successors, (663), 595 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 663 transitions. [2025-03-03 13:41:03,460 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 663 transitions. Word has length 38 [2025-03-03 13:41:03,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:03,460 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 663 transitions. [2025-03-03 13:41:03,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:03,460 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 663 transitions. [2025-03-03 13:41:03,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:41:03,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:03,460 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:41:03,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2025-03-03 13:41:03,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:03,661 INFO L396 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:03,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:03,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1426307474, now seen corresponding path program 76 times [2025-03-03 13:41:03,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:03,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80931223] [2025-03-03 13:41:03,661 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:41:03,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:03,665 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-03 13:41:03,668 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:41:03,668 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:41:03,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:41:04,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:04,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80931223] [2025-03-03 13:41:04,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80931223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:41:04,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924032550] [2025-03-03 13:41:04,023 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:41:04,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:04,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:41:04,025 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:41:04,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2025-03-03 13:41:04,083 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-03 13:41:04,098 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:41:04,098 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:41:04,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:04,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-03 13:41:04,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:41:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:41:04,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:41:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:41:04,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924032550] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:41:04,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:41:04,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 49 [2025-03-03 13:41:04,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739880763] [2025-03-03 13:41:04,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:41:04,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-03 13:41:04,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:04,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-03 13:41:04,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=2237, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 13:41:04,516 INFO L87 Difference]: Start difference. First operand 596 states and 663 transitions. Second operand has 49 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:05,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:05,322 INFO L93 Difference]: Finished difference Result 654 states and 728 transitions. [2025-03-03 13:41:05,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 13:41:05,322 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 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 38 [2025-03-03 13:41:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:05,324 INFO L225 Difference]: With dead ends: 654 [2025-03-03 13:41:05,324 INFO L226 Difference]: Without dead ends: 647 [2025-03-03 13:41:05,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=3970, Unknown=0, NotChecked=0, Total=4160 [2025-03-03 13:41:05,324 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 81 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 1980 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:05,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1152 Invalid, 1981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1980 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:41:05,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-03-03 13:41:05,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 603. [2025-03-03 13:41:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 602 states have (on average 1.1146179401993355) internal successors, (671), 602 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 671 transitions. [2025-03-03 13:41:05,508 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 671 transitions. Word has length 38 [2025-03-03 13:41:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:05,508 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 671 transitions. [2025-03-03 13:41:05,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 671 transitions. [2025-03-03 13:41:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:41:05,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:05,509 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:41:05,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Ended with exit code 0 [2025-03-03 13:41:05,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2025-03-03 13:41:05,709 INFO L396 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:05,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:05,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1888511438, now seen corresponding path program 77 times [2025-03-03 13:41:05,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:05,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881634589] [2025-03-03 13:41:05,710 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:41:05,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:05,713 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-03-03 13:41:05,716 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:41:05,717 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 13:41:05,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 13:41:05,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:05,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881634589] [2025-03-03 13:41:05,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881634589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:41:05,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266135366] [2025-03-03 13:41:05,806 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:41:05,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:05,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:41:05,808 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:41:05,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2025-03-03 13:41:05,872 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-03-03 13:41:05,891 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:41:05,892 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 13:41:05,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:05,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 13:41:05,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:41:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 13:41:05,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:41:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 13:41:06,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266135366] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:41:06,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:41:06,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 21 [2025-03-03 13:41:06,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586503355] [2025-03-03 13:41:06,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:41:06,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 13:41:06,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:06,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 13:41:06,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=267, Unknown=0, NotChecked=0, Total=420 [2025-03-03 13:41:06,080 INFO L87 Difference]: Start difference. First operand 603 states and 671 transitions. Second operand has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:06,416 INFO L93 Difference]: Finished difference Result 707 states and 792 transitions. [2025-03-03 13:41:06,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 13:41:06,416 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-03 13:41:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:06,417 INFO L225 Difference]: With dead ends: 707 [2025-03-03 13:41:06,417 INFO L226 Difference]: Without dead ends: 591 [2025-03-03 13:41:06,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 59 SyntacticMatches, 13 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=448, Invalid=812, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 13:41:06,418 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 64 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:06,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 180 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:41:06,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-03 13:41:06,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-03-03 13:41:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 1.1101694915254237) internal successors, (655), 590 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 655 transitions. [2025-03-03 13:41:06,627 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 655 transitions. Word has length 39 [2025-03-03 13:41:06,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:06,628 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 655 transitions. [2025-03-03 13:41:06,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:06,628 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 655 transitions. [2025-03-03 13:41:06,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:41:06,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:06,628 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:41:06,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2025-03-03 13:41:06,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2025-03-03 13:41:06,829 INFO L396 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:06,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:06,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2001359792, now seen corresponding path program 78 times [2025-03-03 13:41:06,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:06,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126727145] [2025-03-03 13:41:06,829 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:41:06,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:06,833 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 4 equivalence classes. [2025-03-03 13:41:06,838 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:41:06,838 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 13:41:06,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 13:41:06,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:06,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126727145] [2025-03-03 13:41:06,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126727145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:41:06,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739500442] [2025-03-03 13:41:06,926 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:41:06,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:06,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:41:06,928 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:41:06,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2025-03-03 13:41:06,988 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 4 equivalence classes. [2025-03-03 13:41:07,004 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:41:07,004 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 13:41:07,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:07,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 13:41:07,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:41:07,068 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 13:41:07,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:41:07,127 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 13:41:07,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739500442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:41:07,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:41:07,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2025-03-03 13:41:07,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515700703] [2025-03-03 13:41:07,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:41:07,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 13:41:07,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:07,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 13:41:07,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=329, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:41:07,128 INFO L87 Difference]: Start difference. First operand 591 states and 655 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:07,446 INFO L93 Difference]: Finished difference Result 611 states and 675 transitions. [2025-03-03 13:41:07,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 13:41:07,446 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-03 13:41:07,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:07,448 INFO L225 Difference]: With dead ends: 611 [2025-03-03 13:41:07,448 INFO L226 Difference]: Without dead ends: 606 [2025-03-03 13:41:07,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=487, Invalid=919, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 13:41:07,448 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 60 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:07,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 185 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:41:07,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-03 13:41:07,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 592. [2025-03-03 13:41:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 1.1099830795262267) internal successors, (656), 591 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 656 transitions. [2025-03-03 13:41:07,669 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 656 transitions. Word has length 39 [2025-03-03 13:41:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:07,669 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 656 transitions. [2025-03-03 13:41:07,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 656 transitions. [2025-03-03 13:41:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:41:07,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:07,669 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:41:07,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2025-03-03 13:41:07,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2025-03-03 13:41:07,870 INFO L396 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:07,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:07,870 INFO L85 PathProgramCache]: Analyzing trace with hash -368286604, now seen corresponding path program 79 times [2025-03-03 13:41:07,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:07,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170249547] [2025-03-03 13:41:07,870 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:41:07,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:07,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:41:07,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:41:07,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:41:07,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:41:08,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:08,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170249547] [2025-03-03 13:41:08,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170249547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:41:08,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476729130] [2025-03-03 13:41:08,196 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:41:08,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:08,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:41:08,199 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:41:08,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2025-03-03 13:41:08,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:41:08,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:41:08,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:41:08,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:08,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 13:41:08,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:41:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:41:08,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:41:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:41:09,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476729130] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:41:09,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:41:09,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 59 [2025-03-03 13:41:09,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320934712] [2025-03-03 13:41:09,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:41:09,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-03 13:41:09,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:09,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-03 13:41:09,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=3259, Unknown=0, NotChecked=0, Total=3422 [2025-03-03 13:41:09,381 INFO L87 Difference]: Start difference. First operand 592 states and 656 transitions. Second operand has 59 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:10,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:10,585 INFO L93 Difference]: Finished difference Result 871 states and 953 transitions. [2025-03-03 13:41:10,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 13:41:10,585 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 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 39 [2025-03-03 13:41:10,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:10,588 INFO L225 Difference]: With dead ends: 871 [2025-03-03 13:41:10,588 INFO L226 Difference]: Without dead ends: 831 [2025-03-03 13:41:10,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 34 SyntacticMatches, 10 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=618, Invalid=5544, Unknown=0, NotChecked=0, Total=6162 [2025-03-03 13:41:10,588 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:10,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 456 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:41:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-03-03 13:41:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 651. [2025-03-03 13:41:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 650 states have (on average 1.1092307692307692) internal successors, (721), 650 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 721 transitions. [2025-03-03 13:41:10,799 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 721 transitions. Word has length 39 [2025-03-03 13:41:10,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:10,799 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 721 transitions. [2025-03-03 13:41:10,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:10,799 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 721 transitions. [2025-03-03 13:41:10,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:41:10,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:10,800 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:41:10,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2025-03-03 13:41:11,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2025-03-03 13:41:11,001 INFO L396 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:11,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:11,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1521762672, now seen corresponding path program 80 times [2025-03-03 13:41:11,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:11,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926608873] [2025-03-03 13:41:11,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:41:11,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:11,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-03 13:41:11,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:41:11,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:41:11,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:41:11,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:11,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926608873] [2025-03-03 13:41:11,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926608873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:41:11,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064381813] [2025-03-03 13:41:11,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:41:11,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:11,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:41:11,304 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:41:11,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2025-03-03 13:41:11,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-03 13:41:11,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:41:11,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:41:11,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:11,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 13:41:11,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:41:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:41:11,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:41:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:41:12,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064381813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:41:12,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:41:12,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 60 [2025-03-03 13:41:12,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499132032] [2025-03-03 13:41:12,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:41:12,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-03-03 13:41:12,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:12,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-03-03 13:41:12,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3363, Unknown=0, NotChecked=0, Total=3540 [2025-03-03 13:41:12,515 INFO L87 Difference]: Start difference. First operand 651 states and 721 transitions. Second operand has 60 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 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-03 13:41:13,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:13,894 INFO L93 Difference]: Finished difference Result 675 states and 751 transitions. [2025-03-03 13:41:13,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 13:41:13,894 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 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 39 [2025-03-03 13:41:13,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:13,895 INFO L225 Difference]: With dead ends: 675 [2025-03-03 13:41:13,895 INFO L226 Difference]: Without dead ends: 657 [2025-03-03 13:41:13,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 33 SyntacticMatches, 11 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=372, Invalid=5790, Unknown=0, NotChecked=0, Total=6162 [2025-03-03 13:41:13,896 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:13,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 612 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:41:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-03-03 13:41:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2025-03-03 13:41:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 1.108231707317073) internal successors, (727), 656 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:14,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 727 transitions. [2025-03-03 13:41:14,114 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 727 transitions. Word has length 39 [2025-03-03 13:41:14,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:14,114 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 727 transitions. [2025-03-03 13:41:14,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 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-03 13:41:14,114 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 727 transitions. [2025-03-03 13:41:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 13:41:14,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:14,114 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:41:14,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2025-03-03 13:41:14,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:14,315 INFO L396 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:14,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:14,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1943119350, now seen corresponding path program 81 times [2025-03-03 13:41:14,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:14,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652390518] [2025-03-03 13:41:14,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:41:14,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:14,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 4 equivalence classes. [2025-03-03 13:41:14,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 13:41:14,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:41:14,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 13:41:14,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:14,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652390518] [2025-03-03 13:41:14,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652390518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:41:14,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183871179] [2025-03-03 13:41:14,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:41:14,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:14,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:41:14,615 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:41:14,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2025-03-03 13:41:14,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 4 equivalence classes. [2025-03-03 13:41:14,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 13:41:14,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:41:14,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:14,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-03 13:41:14,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:41:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 13:41:15,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:41:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 13:41:15,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183871179] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:41:15,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:41:15,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 43 [2025-03-03 13:41:15,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661475681] [2025-03-03 13:41:15,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:41:15,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 13:41:15,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:15,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 13:41:15,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1684, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 13:41:15,111 INFO L87 Difference]: Start difference. First operand 657 states and 727 transitions. Second operand has 43 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:15,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:15,643 INFO L93 Difference]: Finished difference Result 682 states and 755 transitions. [2025-03-03 13:41:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 13:41:15,643 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-03 13:41:15,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:15,645 INFO L225 Difference]: With dead ends: 682 [2025-03-03 13:41:15,645 INFO L226 Difference]: Without dead ends: 677 [2025-03-03 13:41:15,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=2774, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 13:41:15,646 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:15,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 331 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:41:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-03-03 13:41:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 669. [2025-03-03 13:41:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 668 states have (on average 1.1092814371257484) internal successors, (741), 668 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 741 transitions. [2025-03-03 13:41:15,865 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 741 transitions. Word has length 40 [2025-03-03 13:41:15,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:15,865 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 741 transitions. [2025-03-03 13:41:15,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 741 transitions. [2025-03-03 13:41:15,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 13:41:15,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:15,865 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:41:15,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2025-03-03 13:41:16,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:16,066 INFO L396 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:16,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:16,066 INFO L85 PathProgramCache]: Analyzing trace with hash 520581206, now seen corresponding path program 82 times [2025-03-03 13:41:16,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:16,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536688535] [2025-03-03 13:41:16,066 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:41:16,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:16,069 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-03 13:41:16,073 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 13:41:16,073 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:41:16,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 13:41:16,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:16,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536688535] [2025-03-03 13:41:16,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536688535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:41:16,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503322039] [2025-03-03 13:41:16,331 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:41:16,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:16,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:41:16,333 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:41:16,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2025-03-03 13:41:16,395 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-03 13:41:16,411 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 13:41:16,411 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:41:16,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:16,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-03 13:41:16,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:41:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 13:41:16,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:41:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 13:41:16,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503322039] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:41:16,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:41:16,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 44 [2025-03-03 13:41:16,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294981273] [2025-03-03 13:41:16,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:41:16,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-03 13:41:16,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:16,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-03 13:41:16,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1774, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 13:41:16,823 INFO L87 Difference]: Start difference. First operand 669 states and 741 transitions. Second operand has 44 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:17,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:17,370 INFO L93 Difference]: Finished difference Result 684 states and 755 transitions. [2025-03-03 13:41:17,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 13:41:17,370 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-03 13:41:17,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:17,372 INFO L225 Difference]: With dead ends: 684 [2025-03-03 13:41:17,372 INFO L226 Difference]: Without dead ends: 656 [2025-03-03 13:41:17,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=2999, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 13:41:17,372 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 33 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:17,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 496 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:41:17,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-03-03 13:41:17,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2025-03-03 13:41:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 655 states have (on average 1.1099236641221375) internal successors, (727), 655 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 727 transitions. [2025-03-03 13:41:17,589 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 727 transitions. Word has length 40 [2025-03-03 13:41:17,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:17,589 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 727 transitions. [2025-03-03 13:41:17,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:17,589 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 727 transitions. [2025-03-03 13:41:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 13:41:17,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:17,589 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:41:17,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2025-03-03 13:41:17,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:17,790 INFO L396 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:17,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:17,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1839854070, now seen corresponding path program 83 times [2025-03-03 13:41:17,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:17,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990941593] [2025-03-03 13:41:17,790 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:41:17,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:17,794 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 4 equivalence classes. [2025-03-03 13:41:17,797 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 13:41:17,798 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 13:41:17,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 13:41:18,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:18,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990941593] [2025-03-03 13:41:18,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990941593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:41:18,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559311887] [2025-03-03 13:41:18,103 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:41:18,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:18,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:41:18,105 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:41:18,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2025-03-03 13:41:18,174 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 4 equivalence classes. [2025-03-03 13:41:18,194 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 13:41:18,194 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 13:41:18,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:18,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-03 13:41:18,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:41:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 13:41:18,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:41:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 13:41:18,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559311887] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:41:18,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:41:18,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 46 [2025-03-03 13:41:18,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599526755] [2025-03-03 13:41:18,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:41:18,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-03 13:41:18,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:18,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-03 13:41:18,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1951, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 13:41:18,610 INFO L87 Difference]: Start difference. First operand 656 states and 727 transitions. Second operand has 46 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:19,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:19,306 INFO L93 Difference]: Finished difference Result 672 states and 742 transitions. [2025-03-03 13:41:19,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 13:41:19,306 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-03 13:41:19,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:19,308 INFO L225 Difference]: With dead ends: 672 [2025-03-03 13:41:19,308 INFO L226 Difference]: Without dead ends: 645 [2025-03-03 13:41:19,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=3345, Unknown=0, NotChecked=0, Total=3540 [2025-03-03 13:41:19,308 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 45 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:19,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 706 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:41:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-03-03 13:41:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2025-03-03 13:41:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.110248447204969) internal successors, (715), 644 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 715 transitions. [2025-03-03 13:41:19,518 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 715 transitions. Word has length 40 [2025-03-03 13:41:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:19,518 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 715 transitions. [2025-03-03 13:41:19,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 715 transitions. [2025-03-03 13:41:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 13:41:19,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:19,518 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:41:19,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2025-03-03 13:41:19,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:19,719 INFO L396 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:19,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:19,719 INFO L85 PathProgramCache]: Analyzing trace with hash 5809238, now seen corresponding path program 84 times [2025-03-03 13:41:19,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:19,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246691446] [2025-03-03 13:41:19,719 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:41:19,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:19,723 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 5 equivalence classes. [2025-03-03 13:41:19,727 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 13:41:19,727 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 13:41:19,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:41:20,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:20,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246691446] [2025-03-03 13:41:20,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246691446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:41:20,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249557497] [2025-03-03 13:41:20,059 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:41:20,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:20,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:41:20,061 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:41:20,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2025-03-03 13:41:20,122 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 5 equivalence classes. [2025-03-03 13:41:20,139 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 13:41:20,139 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 13:41:20,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:20,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-03 13:41:20,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:41:20,474 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:41:20,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:41:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:41:20,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249557497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:41:20,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:41:20,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 49 [2025-03-03 13:41:20,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689739894] [2025-03-03 13:41:20,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:41:20,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-03 13:41:20,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:20,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-03 13:41:20,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=2227, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 13:41:20,565 INFO L87 Difference]: Start difference. First operand 645 states and 715 transitions. Second operand has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:21,267 INFO L93 Difference]: Finished difference Result 662 states and 731 transitions. [2025-03-03 13:41:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 13:41:21,267 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-03 13:41:21,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:21,269 INFO L225 Difference]: With dead ends: 662 [2025-03-03 13:41:21,269 INFO L226 Difference]: Without dead ends: 636 [2025-03-03 13:41:21,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=202, Invalid=3830, Unknown=0, NotChecked=0, Total=4032 [2025-03-03 13:41:21,269 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 57 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:21,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 834 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:41:21,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states.