./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label20.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/eca-rers2012/Problem17_label20.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 f135ddf41791de61b2d6990344a7ec64104348ebc3877909c56fd71d04c40aca --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:59:04,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:59:04,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:59:04,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:59:04,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:59:04,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:59:04,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:59:04,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:59:04,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:59:04,801 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:59:04,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:59:04,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:59:04,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:59:04,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:59:04,802 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:59:04,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:59:04,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:59:04,803 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:59:04,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:59:04,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:59:04,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:59:04,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:59:04,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:59:04,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:59:04,803 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:59:04,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:59:04,803 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:59:04,803 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:59:04,804 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:59:04,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:59:04,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:59:04,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:59:04,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:59:04,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:59:04,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:59:04,805 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:59:04,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:59:04,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:59:04,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:59:04,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:59:04,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:59:04,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:59:04,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:59:04,805 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 -> f135ddf41791de61b2d6990344a7ec64104348ebc3877909c56fd71d04c40aca [2025-03-03 10:59:05,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:59:05,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:59:05,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:59:05,065 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:59:05,065 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:59:05,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label20.c [2025-03-03 10:59:06,286 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea5b799c2/f56182d2d593425caff89277894d3e8e/FLAG0ad5a05c4 [2025-03-03 10:59:06,648 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:59:06,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label20.c [2025-03-03 10:59:06,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea5b799c2/f56182d2d593425caff89277894d3e8e/FLAG0ad5a05c4 [2025-03-03 10:59:06,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea5b799c2/f56182d2d593425caff89277894d3e8e [2025-03-03 10:59:06,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:59:06,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:59:06,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:59:06,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:59:06,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:59:06,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:59:06" (1/1) ... [2025-03-03 10:59:06,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb0578a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:06, skipping insertion in model container [2025-03-03 10:59:06,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:59:06" (1/1) ... [2025-03-03 10:59:06,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:59:06,872 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/eca-rers2012/Problem17_label20.c[4104,4117] [2025-03-03 10:59:07,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:59:07,199 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:59:07,210 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/eca-rers2012/Problem17_label20.c[4104,4117] [2025-03-03 10:59:07,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:59:07,417 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:59:07,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:07 WrapperNode [2025-03-03 10:59:07,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:59:07,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:59:07,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:59:07,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:59:07,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:07" (1/1) ... [2025-03-03 10:59:07,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 10:59:07" (1/1) ... [2025-03-03 10:59:07,653 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-03 10:59:07,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:59:07,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:59:07,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:59:07,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:59:07,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:07" (1/1) ... [2025-03-03 10:59:07,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:07" (1/1) ... [2025-03-03 10:59:07,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:07" (1/1) ... [2025-03-03 10:59:07,885 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 10:59:07,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:07" (1/1) ... [2025-03-03 10:59:07,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:07" (1/1) ... [2025-03-03 10:59:08,006 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:07" (1/1) ... [2025-03-03 10:59:08,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:07" (1/1) ... [2025-03-03 10:59:08,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:07" (1/1) ... [2025-03-03 10:59:08,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:07" (1/1) ... [2025-03-03 10:59:08,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:59:08,091 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:59:08,091 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:59:08,091 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:59:08,092 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:07" (1/1) ... [2025-03-03 10:59:08,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:59:08,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:59:08,117 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 10:59:08,122 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 10:59:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:59:08,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:59:08,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:59:08,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:59:08,181 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:59:08,183 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:59:10,728 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-03 10:59:10,818 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-03 10:59:10,818 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:59:10,842 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:59:10,843 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:59:10,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:59:10 BoogieIcfgContainer [2025-03-03 10:59:10,843 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:59:10,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:59:10,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:59:10,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:59:10,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:59:06" (1/3) ... [2025-03-03 10:59:10,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e483116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:59:10, skipping insertion in model container [2025-03-03 10:59:10,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:07" (2/3) ... [2025-03-03 10:59:10,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e483116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:59:10, skipping insertion in model container [2025-03-03 10:59:10,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:59:10" (3/3) ... [2025-03-03 10:59:10,852 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label20.c [2025-03-03 10:59:10,863 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:59:10,864 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label20.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:59:10,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:59:10,938 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;@4692f087, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:59:10,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:59:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:10,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 10:59:10,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:10,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:10,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:10,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:10,956 INFO L85 PathProgramCache]: Analyzing trace with hash 94170016, now seen corresponding path program 1 times [2025-03-03 10:59:10,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:10,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277615335] [2025-03-03 10:59:10,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:10,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:11,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 10:59:11,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 10:59:11,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:11,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:11,188 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 10:59:11,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:11,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277615335] [2025-03-03 10:59:11,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277615335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:11,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:11,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:59:11,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430555027] [2025-03-03 10:59:11,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:11,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:11,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:11,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:11,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:11,216 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 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 10:59:13,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:13,186 INFO L93 Difference]: Finished difference Result 1642 states and 3021 transitions. [2025-03-03 10:59:13,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:13,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-03 10:59:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:13,198 INFO L225 Difference]: With dead ends: 1642 [2025-03-03 10:59:13,199 INFO L226 Difference]: Without dead ends: 975 [2025-03-03 10:59:13,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:59:13,204 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 464 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:13,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 551 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:59:13,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-03 10:59:13,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2025-03-03 10:59:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2025-03-03 10:59:13,266 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 26 [2025-03-03 10:59:13,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:13,266 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2025-03-03 10:59:13,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 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 10:59:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2025-03-03 10:59:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 10:59:13,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:13,269 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:13,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:59:13,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:13,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:13,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1571578840, now seen corresponding path program 1 times [2025-03-03 10:59:13,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:13,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693907020] [2025-03-03 10:59:13,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:13,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:13,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 10:59:13,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 10:59:13,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:13,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:59:13,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:13,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693907020] [2025-03-03 10:59:13,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693907020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:13,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:13,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:13,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658370689] [2025-03-03 10:59:13,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:13,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:13,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:13,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:13,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:13,539 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:15,228 INFO L93 Difference]: Finished difference Result 2814 states and 4242 transitions. [2025-03-03 10:59:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:15,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 10:59:15,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:15,235 INFO L225 Difference]: With dead ends: 2814 [2025-03-03 10:59:15,235 INFO L226 Difference]: Without dead ends: 1844 [2025-03-03 10:59:15,237 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 10:59:15,237 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 465 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:15,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 921 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:59:15,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-03 10:59:15,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842. [2025-03-03 10:59:15,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:15,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions. [2025-03-03 10:59:15,270 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 96 [2025-03-03 10:59:15,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:15,270 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions. [2025-03-03 10:59:15,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions. [2025-03-03 10:59:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 10:59:15,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:15,272 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:15,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:59:15,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:15,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:15,273 INFO L85 PathProgramCache]: Analyzing trace with hash -684167843, now seen corresponding path program 1 times [2025-03-03 10:59:15,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:15,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82207893] [2025-03-03 10:59:15,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:15,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:15,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 10:59:15,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 10:59:15,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:15,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:59:15,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:15,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82207893] [2025-03-03 10:59:15,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82207893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:15,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:15,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:59:15,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248719216] [2025-03-03 10:59:15,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:15,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:15,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:15,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:15,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:15,462 INFO L87 Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:17,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:17,023 INFO L93 Difference]: Finished difference Result 5395 states and 7326 transitions. [2025-03-03 10:59:17,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:17,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-03 10:59:17,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:17,033 INFO L225 Difference]: With dead ends: 5395 [2025-03-03 10:59:17,034 INFO L226 Difference]: Without dead ends: 2701 [2025-03-03 10:59:17,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:59:17,040 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:17,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 10:59:17,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2025-03-03 10:59:17,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2701. [2025-03-03 10:59:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2700 states have (on average 1.191851851851852) internal successors, (3218), 2700 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3218 transitions. [2025-03-03 10:59:17,083 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3218 transitions. Word has length 118 [2025-03-03 10:59:17,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:17,084 INFO L471 AbstractCegarLoop]: Abstraction has 2701 states and 3218 transitions. [2025-03-03 10:59:17,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:17,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3218 transitions. [2025-03-03 10:59:17,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 10:59:17,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:17,085 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:17,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:59:17,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:17,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:17,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1868889275, now seen corresponding path program 1 times [2025-03-03 10:59:17,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:17,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401007096] [2025-03-03 10:59:17,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:17,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:17,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 10:59:17,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 10:59:17,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:17,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:59:17,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:17,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401007096] [2025-03-03 10:59:17,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401007096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:17,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:17,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:17,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948976538] [2025-03-03 10:59:17,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:17,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:17,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:17,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:17,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:17,325 INFO L87 Difference]: Start difference. First operand 2701 states and 3218 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:18,628 INFO L93 Difference]: Finished difference Result 7108 states and 8598 transitions. [2025-03-03 10:59:18,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:18,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-03 10:59:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:18,641 INFO L225 Difference]: With dead ends: 7108 [2025-03-03 10:59:18,642 INFO L226 Difference]: Without dead ends: 4409 [2025-03-03 10:59:18,645 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 10:59:18,646 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:18,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:59:18,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2025-03-03 10:59:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4409. [2025-03-03 10:59:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4409 states, 4408 states have (on average 1.1705989110707804) internal successors, (5160), 4408 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:18,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 5160 transitions. [2025-03-03 10:59:18,707 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 5160 transitions. Word has length 178 [2025-03-03 10:59:18,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:18,708 INFO L471 AbstractCegarLoop]: Abstraction has 4409 states and 5160 transitions. [2025-03-03 10:59:18,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 5160 transitions. [2025-03-03 10:59:18,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 10:59:18,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:18,709 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:18,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:59:18,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:18,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:18,710 INFO L85 PathProgramCache]: Analyzing trace with hash 151604896, now seen corresponding path program 1 times [2025-03-03 10:59:18,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:18,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164620504] [2025-03-03 10:59:18,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:18,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:18,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 10:59:18,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 10:59:18,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:18,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:18,988 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 10:59:18,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:18,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164620504] [2025-03-03 10:59:18,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164620504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:18,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:18,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:18,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888252615] [2025-03-03 10:59:18,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:18,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:18,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:18,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:18,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:18,990 INFO L87 Difference]: Start difference. First operand 4409 states and 5160 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:20,297 INFO L93 Difference]: Finished difference Result 10936 states and 12970 transitions. [2025-03-03 10:59:20,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:20,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 180 [2025-03-03 10:59:20,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:20,312 INFO L225 Difference]: With dead ends: 10936 [2025-03-03 10:59:20,312 INFO L226 Difference]: Without dead ends: 6528 [2025-03-03 10:59:20,316 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 10:59:20,316 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 425 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:20,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 445 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:59:20,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6528 states. [2025-03-03 10:59:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6528 to 4382. [2025-03-03 10:59:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4381 states have (on average 1.1684546907098836) internal successors, (5119), 4381 states have internal predecessors, (5119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5119 transitions. [2025-03-03 10:59:20,375 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 5119 transitions. Word has length 180 [2025-03-03 10:59:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:20,375 INFO L471 AbstractCegarLoop]: Abstraction has 4382 states and 5119 transitions. [2025-03-03 10:59:20,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:20,375 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 5119 transitions. [2025-03-03 10:59:20,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-03 10:59:20,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:20,377 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:20,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:59:20,378 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:20,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:20,378 INFO L85 PathProgramCache]: Analyzing trace with hash -190411096, now seen corresponding path program 1 times [2025-03-03 10:59:20,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:20,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017073689] [2025-03-03 10:59:20,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:20,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:20,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-03 10:59:20,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-03 10:59:20,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:20,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 10:59:20,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:20,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017073689] [2025-03-03 10:59:20,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017073689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:20,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:20,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:20,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51289744] [2025-03-03 10:59:20,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:20,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:20,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:20,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:20,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:20,552 INFO L87 Difference]: Start difference. First operand 4382 states and 5119 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:21,895 INFO L93 Difference]: Finished difference Result 10045 states and 11706 transitions. [2025-03-03 10:59:21,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:21,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 246 [2025-03-03 10:59:21,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:21,906 INFO L225 Difference]: With dead ends: 10045 [2025-03-03 10:59:21,906 INFO L226 Difference]: Without dead ends: 5665 [2025-03-03 10:59:21,910 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 10:59:21,912 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 410 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:21,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 894 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:59:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5665 states. [2025-03-03 10:59:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5665 to 5234. [2025-03-03 10:59:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5234 states, 5233 states have (on average 1.1587999235620103) internal successors, (6064), 5233 states have internal predecessors, (6064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 6064 transitions. [2025-03-03 10:59:21,974 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 6064 transitions. Word has length 246 [2025-03-03 10:59:21,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:21,975 INFO L471 AbstractCegarLoop]: Abstraction has 5234 states and 6064 transitions. [2025-03-03 10:59:21,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:21,975 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 6064 transitions. [2025-03-03 10:59:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-03 10:59:21,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:21,981 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:21,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:59:21,981 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:21,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:21,982 INFO L85 PathProgramCache]: Analyzing trace with hash -499657117, now seen corresponding path program 1 times [2025-03-03 10:59:21,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:21,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740755126] [2025-03-03 10:59:21,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:21,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:22,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-03 10:59:22,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-03 10:59:22,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:22,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-03 10:59:22,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:22,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740755126] [2025-03-03 10:59:22,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740755126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:22,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:22,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:22,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828190833] [2025-03-03 10:59:22,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:22,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:22,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:22,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:22,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:22,257 INFO L87 Difference]: Start difference. First operand 5234 states and 6064 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:23,565 INFO L93 Difference]: Finished difference Result 12593 states and 14783 transitions. [2025-03-03 10:59:23,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:23,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 258 [2025-03-03 10:59:23,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:23,583 INFO L225 Difference]: With dead ends: 12593 [2025-03-03 10:59:23,584 INFO L226 Difference]: Without dead ends: 6936 [2025-03-03 10:59:23,587 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 10:59:23,587 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 383 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:23,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 847 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:59:23,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6936 states. [2025-03-03 10:59:23,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6936 to 6936. [2025-03-03 10:59:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6936 states, 6935 states have (on average 1.1322278298485942) internal successors, (7852), 6935 states have internal predecessors, (7852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6936 states to 6936 states and 7852 transitions. [2025-03-03 10:59:23,673 INFO L78 Accepts]: Start accepts. Automaton has 6936 states and 7852 transitions. Word has length 258 [2025-03-03 10:59:23,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:23,673 INFO L471 AbstractCegarLoop]: Abstraction has 6936 states and 7852 transitions. [2025-03-03 10:59:23,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:23,674 INFO L276 IsEmpty]: Start isEmpty. Operand 6936 states and 7852 transitions. [2025-03-03 10:59:23,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-03 10:59:23,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:23,677 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:23,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:59:23,678 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:23,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash 489875910, now seen corresponding path program 1 times [2025-03-03 10:59:23,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:23,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081371547] [2025-03-03 10:59:23,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:23,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:23,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-03 10:59:23,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-03 10:59:23,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:23,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:23,813 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-03 10:59:23,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:23,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081371547] [2025-03-03 10:59:23,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081371547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:23,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:23,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:23,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297059838] [2025-03-03 10:59:23,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:23,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:23,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:23,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:23,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:23,815 INFO L87 Difference]: Start difference. First operand 6936 states and 7852 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:25,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:25,122 INFO L93 Difference]: Finished difference Result 16424 states and 18762 transitions. [2025-03-03 10:59:25,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:25,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 298 [2025-03-03 10:59:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:25,136 INFO L225 Difference]: With dead ends: 16424 [2025-03-03 10:59:25,136 INFO L226 Difference]: Without dead ends: 9490 [2025-03-03 10:59:25,141 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 10:59:25,141 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 479 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:25,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 331 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:59:25,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9490 states. [2025-03-03 10:59:25,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9490 to 8636. [2025-03-03 10:59:25,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8636 states, 8635 states have (on average 1.1345686160972785) internal successors, (9797), 8635 states have internal predecessors, (9797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8636 states to 8636 states and 9797 transitions. [2025-03-03 10:59:25,227 INFO L78 Accepts]: Start accepts. Automaton has 8636 states and 9797 transitions. Word has length 298 [2025-03-03 10:59:25,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:25,227 INFO L471 AbstractCegarLoop]: Abstraction has 8636 states and 9797 transitions. [2025-03-03 10:59:25,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 8636 states and 9797 transitions. [2025-03-03 10:59:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-03 10:59:25,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:25,233 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:25,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:59:25,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:25,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:25,234 INFO L85 PathProgramCache]: Analyzing trace with hash -161403937, now seen corresponding path program 1 times [2025-03-03 10:59:25,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:25,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683593077] [2025-03-03 10:59:25,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:25,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:25,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-03 10:59:25,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-03 10:59:25,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:25,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 10:59:25,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:25,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683593077] [2025-03-03 10:59:25,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683593077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:25,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:25,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:25,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014288786] [2025-03-03 10:59:25,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:25,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:25,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:25,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:25,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:25,617 INFO L87 Difference]: Start difference. First operand 8636 states and 9797 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:26,977 INFO L93 Difference]: Finished difference Result 20690 states and 23700 transitions. [2025-03-03 10:59:26,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:26,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 315 [2025-03-03 10:59:26,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:26,994 INFO L225 Difference]: With dead ends: 20690 [2025-03-03 10:59:26,994 INFO L226 Difference]: Without dead ends: 12056 [2025-03-03 10:59:27,000 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 10:59:27,002 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 456 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:27,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 442 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:59:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12056 states. [2025-03-03 10:59:27,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12056 to 11193. [2025-03-03 10:59:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11193 states, 11192 states have (on average 1.1317905646890636) internal successors, (12667), 11192 states have internal predecessors, (12667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11193 states to 11193 states and 12667 transitions. [2025-03-03 10:59:27,098 INFO L78 Accepts]: Start accepts. Automaton has 11193 states and 12667 transitions. Word has length 315 [2025-03-03 10:59:27,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:27,099 INFO L471 AbstractCegarLoop]: Abstraction has 11193 states and 12667 transitions. [2025-03-03 10:59:27,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 11193 states and 12667 transitions. [2025-03-03 10:59:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-03 10:59:27,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:27,104 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:27,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:59:27,105 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:27,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:27,106 INFO L85 PathProgramCache]: Analyzing trace with hash -677133883, now seen corresponding path program 1 times [2025-03-03 10:59:27,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:27,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134164406] [2025-03-03 10:59:27,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:27,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:27,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-03 10:59:27,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-03 10:59:27,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:27,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:27,361 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:59:27,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:27,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134164406] [2025-03-03 10:59:27,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134164406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:27,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:27,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:27,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049920934] [2025-03-03 10:59:27,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:27,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:59:27,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:27,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:59:27,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:59:27,366 INFO L87 Difference]: Start difference. First operand 11193 states and 12667 transitions. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:29,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:29,489 INFO L93 Difference]: Finished difference Result 32631 states and 36750 transitions. [2025-03-03 10:59:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:59:29,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 365 [2025-03-03 10:59:29,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:29,521 INFO L225 Difference]: With dead ends: 32631 [2025-03-03 10:59:29,521 INFO L226 Difference]: Without dead ends: 20590 [2025-03-03 10:59:29,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 10:59:29,533 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 553 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2519 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 2519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:29,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 385 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 2519 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:59:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20590 states. [2025-03-03 10:59:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20590 to 20142. [2025-03-03 10:59:29,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20142 states, 20141 states have (on average 1.1162305744501266) internal successors, (22482), 20141 states have internal predecessors, (22482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20142 states to 20142 states and 22482 transitions. [2025-03-03 10:59:29,740 INFO L78 Accepts]: Start accepts. Automaton has 20142 states and 22482 transitions. Word has length 365 [2025-03-03 10:59:29,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:29,741 INFO L471 AbstractCegarLoop]: Abstraction has 20142 states and 22482 transitions. [2025-03-03 10:59:29,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:29,741 INFO L276 IsEmpty]: Start isEmpty. Operand 20142 states and 22482 transitions. [2025-03-03 10:59:29,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-03 10:59:29,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:29,751 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:29,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:59:29,751 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:29,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:29,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1403260169, now seen corresponding path program 1 times [2025-03-03 10:59:29,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:29,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847857974] [2025-03-03 10:59:29,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:29,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:29,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-03 10:59:29,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-03 10:59:29,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:29,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 10:59:29,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:29,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847857974] [2025-03-03 10:59:29,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847857974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:29,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:29,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:29,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686901550] [2025-03-03 10:59:29,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:29,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:29,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:29,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:29,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:29,974 INFO L87 Difference]: Start difference. First operand 20142 states and 22482 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:31,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:31,425 INFO L93 Difference]: Finished difference Result 47087 states and 52787 transitions. [2025-03-03 10:59:31,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:31,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 408 [2025-03-03 10:59:31,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:31,489 INFO L225 Difference]: With dead ends: 47087 [2025-03-03 10:59:31,489 INFO L226 Difference]: Without dead ends: 26947 [2025-03-03 10:59:31,500 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 10:59:31,501 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 449 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:31,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 379 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:59:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26947 states. [2025-03-03 10:59:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26947 to 20560. [2025-03-03 10:59:31,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20560 states, 20559 states have (on average 1.118293691327399) internal successors, (22991), 20559 states have internal predecessors, (22991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:31,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20560 states to 20560 states and 22991 transitions. [2025-03-03 10:59:31,768 INFO L78 Accepts]: Start accepts. Automaton has 20560 states and 22991 transitions. Word has length 408 [2025-03-03 10:59:31,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:31,769 INFO L471 AbstractCegarLoop]: Abstraction has 20560 states and 22991 transitions. [2025-03-03 10:59:31,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 20560 states and 22991 transitions. [2025-03-03 10:59:31,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-03-03 10:59:31,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:31,777 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:31,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:59:31,778 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:31,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:31,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1689524516, now seen corresponding path program 1 times [2025-03-03 10:59:31,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:31,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314767020] [2025-03-03 10:59:31,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:31,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:31,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-03 10:59:31,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-03 10:59:31,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:31,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 47 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:59:33,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314767020] [2025-03-03 10:59:33,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314767020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:59:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755349241] [2025-03-03 10:59:33,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:33,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:59:33,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:59:33,245 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 10:59:33,247 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 10:59:33,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-03 10:59:33,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-03 10:59:33,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:33,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:33,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:59:33,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:59:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 47 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:59:33,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:59:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:59:34,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755349241] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:59:34,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:59:34,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 3] total 10 [2025-03-03 10:59:34,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709547012] [2025-03-03 10:59:34,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:34,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:59:34,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:34,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:59:34,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-03 10:59:34,317 INFO L87 Difference]: Start difference. First operand 20560 states and 22991 transitions. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:36,575 INFO L93 Difference]: Finished difference Result 54341 states and 61283 transitions. [2025-03-03 10:59:36,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:59:36,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 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 412 [2025-03-03 10:59:36,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:36,617 INFO L225 Difference]: With dead ends: 54341 [2025-03-03 10:59:36,617 INFO L226 Difference]: Without dead ends: 32930 [2025-03-03 10:59:36,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 819 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-03 10:59:36,633 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 641 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 583 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 583 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:36,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 185 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [583 Valid, 2332 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:59:36,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32930 states. [2025-03-03 10:59:36,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32930 to 32500. [2025-03-03 10:59:36,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32500 states, 32499 states have (on average 1.118095941413582) internal successors, (36337), 32499 states have internal predecessors, (36337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32500 states to 32500 states and 36337 transitions. [2025-03-03 10:59:36,941 INFO L78 Accepts]: Start accepts. Automaton has 32500 states and 36337 transitions. Word has length 412 [2025-03-03 10:59:36,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:36,941 INFO L471 AbstractCegarLoop]: Abstraction has 32500 states and 36337 transitions. [2025-03-03 10:59:36,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 32500 states and 36337 transitions. [2025-03-03 10:59:36,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-03 10:59:36,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:36,950 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:36,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 10:59:37,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 10:59:37,154 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:37,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:37,155 INFO L85 PathProgramCache]: Analyzing trace with hash 375706948, now seen corresponding path program 1 times [2025-03-03 10:59:37,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:37,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305363521] [2025-03-03 10:59:37,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:37,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:37,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-03 10:59:37,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-03 10:59:37,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:37,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-03 10:59:37,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:37,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305363521] [2025-03-03 10:59:37,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305363521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:37,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:37,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:37,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828262576] [2025-03-03 10:59:37,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:37,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:37,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:37,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:37,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:37,361 INFO L87 Difference]: Start difference. First operand 32500 states and 36337 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:39,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:39,004 INFO L93 Difference]: Finished difference Result 76925 states and 86051 transitions. [2025-03-03 10:59:39,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:39,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 473 [2025-03-03 10:59:39,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:39,049 INFO L225 Difference]: With dead ends: 76925 [2025-03-03 10:59:39,049 INFO L226 Difference]: Without dead ends: 44427 [2025-03-03 10:59:39,068 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 10:59:39,068 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 500 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:39,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 234 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 10:59:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44427 states. [2025-03-03 10:59:39,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44427 to 41423. [2025-03-03 10:59:39,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41423 states, 41422 states have (on average 1.1164839940128435) internal successors, (46247), 41422 states have internal predecessors, (46247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:39,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41423 states to 41423 states and 46247 transitions. [2025-03-03 10:59:39,417 INFO L78 Accepts]: Start accepts. Automaton has 41423 states and 46247 transitions. Word has length 473 [2025-03-03 10:59:39,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:39,417 INFO L471 AbstractCegarLoop]: Abstraction has 41423 states and 46247 transitions. [2025-03-03 10:59:39,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 41423 states and 46247 transitions. [2025-03-03 10:59:39,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-03-03 10:59:39,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:39,426 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:39,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:59:39,426 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:39,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:39,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1071080730, now seen corresponding path program 1 times [2025-03-03 10:59:39,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:39,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711362159] [2025-03-03 10:59:39,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:39,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:39,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-03-03 10:59:39,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-03-03 10:59:39,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:39,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-03 10:59:39,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:39,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711362159] [2025-03-03 10:59:39,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711362159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:39,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:39,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:39,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974649052] [2025-03-03 10:59:39,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:39,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:39,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:39,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:39,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:39,861 INFO L87 Difference]: Start difference. First operand 41423 states and 46247 transitions. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:41,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:41,135 INFO L93 Difference]: Finished difference Result 84121 states and 93827 transitions. [2025-03-03 10:59:41,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:41,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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 486 [2025-03-03 10:59:41,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:41,178 INFO L225 Difference]: With dead ends: 84121 [2025-03-03 10:59:41,178 INFO L226 Difference]: Without dead ends: 42700 [2025-03-03 10:59:41,199 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 10:59:41,199 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 127 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:41,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 839 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:59:41,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42700 states. [2025-03-03 10:59:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42700 to 42699. [2025-03-03 10:59:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42699 states, 42698 states have (on average 1.1129326900557404) internal successors, (47520), 42698 states have internal predecessors, (47520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:41,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42699 states to 42699 states and 47520 transitions. [2025-03-03 10:59:41,645 INFO L78 Accepts]: Start accepts. Automaton has 42699 states and 47520 transitions. Word has length 486 [2025-03-03 10:59:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:41,645 INFO L471 AbstractCegarLoop]: Abstraction has 42699 states and 47520 transitions. [2025-03-03 10:59:41,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:41,645 INFO L276 IsEmpty]: Start isEmpty. Operand 42699 states and 47520 transitions. [2025-03-03 10:59:41,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-03 10:59:41,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:41,653 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:41,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:59:41,653 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:41,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:41,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1610670030, now seen corresponding path program 1 times [2025-03-03 10:59:41,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:41,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749789471] [2025-03-03 10:59:41,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:41,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:41,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-03 10:59:41,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-03 10:59:41,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:41,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 208 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 10:59:42,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:42,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749789471] [2025-03-03 10:59:42,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749789471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:59:42,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371396835] [2025-03-03 10:59:42,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:42,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:59:42,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:59:42,016 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 10:59:42,017 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 10:59:42,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-03 10:59:42,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-03 10:59:42,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:42,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:42,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:59:42,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:59:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 208 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 10:59:42,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:59:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 10:59:42,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371396835] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:59:42,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:59:42,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-03 10:59:42,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569646112] [2025-03-03 10:59:42,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:42,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:59:42,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:42,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:59:42,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:59:42,494 INFO L87 Difference]: Start difference. First operand 42699 states and 47520 transitions. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:44,749 INFO L93 Difference]: Finished difference Result 102434 states and 113779 transitions. [2025-03-03 10:59:44,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:59:44,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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 491 [2025-03-03 10:59:44,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:44,815 INFO L225 Difference]: With dead ends: 102434 [2025-03-03 10:59:44,815 INFO L226 Difference]: Without dead ends: 59309 [2025-03-03 10:59:44,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 983 GetRequests, 979 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:59:44,849 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 878 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 2804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:44,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 187 Invalid, 2804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:59:44,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59309 states. [2025-03-03 10:59:45,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59309 to 52082. [2025-03-03 10:59:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52082 states, 52081 states have (on average 1.1137842975365297) internal successors, (58007), 52081 states have internal predecessors, (58007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52082 states to 52082 states and 58007 transitions. [2025-03-03 10:59:45,409 INFO L78 Accepts]: Start accepts. Automaton has 52082 states and 58007 transitions. Word has length 491 [2025-03-03 10:59:45,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:45,409 INFO L471 AbstractCegarLoop]: Abstraction has 52082 states and 58007 transitions. [2025-03-03 10:59:45,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:45,409 INFO L276 IsEmpty]: Start isEmpty. Operand 52082 states and 58007 transitions. [2025-03-03 10:59:45,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-03 10:59:45,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:45,418 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:45,424 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 10:59:45,619 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,SelfDestructingSolverStorable14 [2025-03-03 10:59:45,619 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:45,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:45,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1035841432, now seen corresponding path program 1 times [2025-03-03 10:59:45,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:45,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011634993] [2025-03-03 10:59:45,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:45,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:45,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-03 10:59:45,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-03 10:59:45,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:45,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 234 proven. 82 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 10:59:46,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:46,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011634993] [2025-03-03 10:59:46,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011634993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:59:46,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651454921] [2025-03-03 10:59:46,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:46,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:59:46,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:59:46,424 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 10:59:46,426 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 10:59:46,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-03 10:59:46,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-03 10:59:46,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:46,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:46,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:59:46,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:59:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 234 proven. 82 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 10:59:46,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:59:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 234 proven. 82 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 10:59:47,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651454921] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:59:47,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:59:47,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-03 10:59:47,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937984303] [2025-03-03 10:59:47,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:59:47,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 10:59:47,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:47,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 10:59:47,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:59:47,705 INFO L87 Difference]: Start difference. First operand 52082 states and 58007 transitions. Second operand has 10 states, 10 states have (on average 87.2) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:54,261 INFO L93 Difference]: Finished difference Result 126322 states and 140152 transitions. [2025-03-03 10:59:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 10:59:54,262 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 87.2) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 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 517 [2025-03-03 10:59:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:54,321 INFO L225 Difference]: With dead ends: 126322 [2025-03-03 10:59:54,321 INFO L226 Difference]: Without dead ends: 72967 [2025-03-03 10:59:54,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1042 GetRequests, 1029 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-03 10:59:54,334 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 5821 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 9495 mSolverCounterSat, 1144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5821 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 10639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1144 IncrementalHoareTripleChecker+Valid, 9495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:54,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5821 Valid, 500 Invalid, 10639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1144 Valid, 9495 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-03-03 10:59:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72967 states. [2025-03-03 10:59:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72967 to 65686. [2025-03-03 10:59:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65686 states, 65685 states have (on average 1.1053208495090203) internal successors, (72603), 65685 states have internal predecessors, (72603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65686 states to 65686 states and 72603 transitions. [2025-03-03 10:59:54,851 INFO L78 Accepts]: Start accepts. Automaton has 65686 states and 72603 transitions. Word has length 517 [2025-03-03 10:59:54,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:54,851 INFO L471 AbstractCegarLoop]: Abstraction has 65686 states and 72603 transitions. [2025-03-03 10:59:54,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.2) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:54,852 INFO L276 IsEmpty]: Start isEmpty. Operand 65686 states and 72603 transitions. [2025-03-03 10:59:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-03-03 10:59:54,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:54,862 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:54,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:59:55,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:59:55,062 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:55,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:55,063 INFO L85 PathProgramCache]: Analyzing trace with hash 343082915, now seen corresponding path program 1 times [2025-03-03 10:59:55,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:55,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823105745] [2025-03-03 10:59:55,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:55,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:55,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-03 10:59:55,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-03 10:59:55,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:55,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-03 10:59:55,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:55,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823105745] [2025-03-03 10:59:55,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823105745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:55,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:55,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:55,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571575779] [2025-03-03 10:59:55,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:55,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:55,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:55,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:55,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:55,312 INFO L87 Difference]: Start difference. First operand 65686 states and 72603 transitions. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:56,772 INFO L93 Difference]: Finished difference Result 141981 states and 156303 transitions. [2025-03-03 10:59:56,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:56,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 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 592 [2025-03-03 10:59:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:56,843 INFO L225 Difference]: With dead ends: 141981 [2025-03-03 10:59:56,843 INFO L226 Difference]: Without dead ends: 72887 [2025-03-03 10:59:56,872 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 10:59:56,873 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 447 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:56,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 562 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:59:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72887 states. [2025-03-03 10:59:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72887 to 68200. [2025-03-03 10:59:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68200 states, 68199 states have (on average 1.0857783838472705) internal successors, (74049), 68199 states have internal predecessors, (74049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68200 states to 68200 states and 74049 transitions. [2025-03-03 10:59:57,446 INFO L78 Accepts]: Start accepts. Automaton has 68200 states and 74049 transitions. Word has length 592 [2025-03-03 10:59:57,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:57,446 INFO L471 AbstractCegarLoop]: Abstraction has 68200 states and 74049 transitions. [2025-03-03 10:59:57,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:57,446 INFO L276 IsEmpty]: Start isEmpty. Operand 68200 states and 74049 transitions. [2025-03-03 10:59:57,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-03 10:59:57,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:57,454 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:57,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:59:57,454 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:57,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:57,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1555029710, now seen corresponding path program 1 times [2025-03-03 10:59:57,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:57,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637427913] [2025-03-03 10:59:57,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:57,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:57,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-03 10:59:57,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-03 10:59:57,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:57,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 10:59:58,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:58,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637427913] [2025-03-03 10:59:58,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637427913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:58,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:58,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:58,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637105939] [2025-03-03 10:59:58,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:58,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:58,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:58,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:58,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:58,024 INFO L87 Difference]: Start difference. First operand 68200 states and 74049 transitions. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:59,150 INFO L93 Difference]: Finished difference Result 135971 states and 147667 transitions. [2025-03-03 10:59:59,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:59,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 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 593 [2025-03-03 10:59:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:59,213 INFO L225 Difference]: With dead ends: 135971 [2025-03-03 10:59:59,213 INFO L226 Difference]: Without dead ends: 68198 [2025-03-03 10:59:59,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 10:59:59,252 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 583 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:59,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 538 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:59:59,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68198 states. [2025-03-03 10:59:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68198 to 68197. [2025-03-03 10:59:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68197 states, 68196 states have (on average 1.0856208575283008) internal successors, (74035), 68196 states have internal predecessors, (74035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:59,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68197 states to 68197 states and 74035 transitions. [2025-03-03 10:59:59,972 INFO L78 Accepts]: Start accepts. Automaton has 68197 states and 74035 transitions. Word has length 593 [2025-03-03 10:59:59,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:59,972 INFO L471 AbstractCegarLoop]: Abstraction has 68197 states and 74035 transitions. [2025-03-03 10:59:59,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:59,972 INFO L276 IsEmpty]: Start isEmpty. Operand 68197 states and 74035 transitions. [2025-03-03 10:59:59,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-03-03 10:59:59,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:59,980 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:59,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:59:59,980 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:59,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:59,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2021578010, now seen corresponding path program 1 times [2025-03-03 10:59:59,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:59,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195527808] [2025-03-03 10:59:59,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:59,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:00,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-03-03 11:00:00,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-03-03 11:00:00,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:00,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 177 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:00:01,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:01,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195527808] [2025-03-03 11:00:01,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195527808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:00:01,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211523655] [2025-03-03 11:00:01,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:01,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:00:01,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:00:01,321 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 11:00:01,322 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 11:00:01,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-03-03 11:00:01,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-03-03 11:00:01,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:01,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:01,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 11:00:01,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:00:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 423 proven. 103 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 11:00:02,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:00:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 423 proven. 103 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 11:00:04,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211523655] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 11:00:04,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 11:00:04,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2025-03-03 11:00:04,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532818484] [2025-03-03 11:00:04,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 11:00:04,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 11:00:04,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:04,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 11:00:04,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 11:00:04,417 INFO L87 Difference]: Start difference. First operand 68197 states and 74035 transitions. Second operand has 10 states, 10 states have (on average 149.4) internal successors, (1494), 10 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:12,377 INFO L93 Difference]: Finished difference Result 171330 states and 184863 transitions. [2025-03-03 11:00:12,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 11:00:12,378 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 149.4) internal successors, (1494), 10 states have internal predecessors, (1494), 0 states have call successors, (0), 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 597 [2025-03-03 11:00:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:12,490 INFO L225 Difference]: With dead ends: 171330 [2025-03-03 11:00:12,490 INFO L226 Difference]: Without dead ends: 103560 [2025-03-03 11:00:12,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1211 GetRequests, 1196 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-03 11:00:12,537 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 3128 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 13871 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3128 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 14667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 13871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:12,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3128 Valid, 456 Invalid, 14667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 13871 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-03-03 11:00:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103560 states. [2025-03-03 11:00:13,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103560 to 74131. [2025-03-03 11:00:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74131 states, 74130 states have (on average 1.074693106704438) internal successors, (79667), 74130 states have internal predecessors, (79667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74131 states to 74131 states and 79667 transitions. [2025-03-03 11:00:13,705 INFO L78 Accepts]: Start accepts. Automaton has 74131 states and 79667 transitions. Word has length 597 [2025-03-03 11:00:13,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:13,706 INFO L471 AbstractCegarLoop]: Abstraction has 74131 states and 79667 transitions. [2025-03-03 11:00:13,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 149.4) internal successors, (1494), 10 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 74131 states and 79667 transitions. [2025-03-03 11:00:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2025-03-03 11:00:13,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:13,715 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:13,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 11:00:13,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:00:13,915 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:13,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:13,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1732264206, now seen corresponding path program 1 times [2025-03-03 11:00:13,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:13,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947330456] [2025-03-03 11:00:13,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:13,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:13,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 612 statements into 1 equivalence classes. [2025-03-03 11:00:13,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 612 of 612 statements. [2025-03-03 11:00:13,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:13,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-03 11:00:14,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:14,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947330456] [2025-03-03 11:00:14,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947330456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:14,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:14,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:14,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431218830] [2025-03-03 11:00:14,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:14,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:14,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:14,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:14,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:14,088 INFO L87 Difference]: Start difference. First operand 74131 states and 79667 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:15,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:15,280 INFO L93 Difference]: Finished difference Result 147415 states and 158567 transitions. [2025-03-03 11:00:15,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:15,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 612 [2025-03-03 11:00:15,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:15,353 INFO L225 Difference]: With dead ends: 147415 [2025-03-03 11:00:15,353 INFO L226 Difference]: Without dead ends: 75838 [2025-03-03 11:00:15,394 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 11:00:15,394 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 500 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:15,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 626 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 11:00:15,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75838 states. [2025-03-03 11:00:16,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75838 to 75407. [2025-03-03 11:00:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75407 states, 75406 states have (on average 1.068190860143755) internal successors, (80548), 75406 states have internal predecessors, (80548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75407 states to 75407 states and 80548 transitions. [2025-03-03 11:00:16,438 INFO L78 Accepts]: Start accepts. Automaton has 75407 states and 80548 transitions. Word has length 612 [2025-03-03 11:00:16,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:16,438 INFO L471 AbstractCegarLoop]: Abstraction has 75407 states and 80548 transitions. [2025-03-03 11:00:16,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 75407 states and 80548 transitions. [2025-03-03 11:00:16,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-03-03 11:00:16,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:16,447 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:16,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 11:00:16,447 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:16,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:16,448 INFO L85 PathProgramCache]: Analyzing trace with hash -169601656, now seen corresponding path program 1 times [2025-03-03 11:00:16,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:16,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412878316] [2025-03-03 11:00:16,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:16,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:16,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-03 11:00:16,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-03 11:00:16,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:16,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 514 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 11:00:17,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:17,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412878316] [2025-03-03 11:00:17,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412878316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:17,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:17,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:17,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726904874] [2025-03-03 11:00:17,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:17,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:17,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:17,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:17,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:17,027 INFO L87 Difference]: Start difference. First operand 75407 states and 80548 transitions. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:18,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:18,530 INFO L93 Difference]: Finished difference Result 147857 states and 157931 transitions. [2025-03-03 11:00:18,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:18,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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 616 [2025-03-03 11:00:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:18,610 INFO L225 Difference]: With dead ends: 147857 [2025-03-03 11:00:18,610 INFO L226 Difference]: Without dead ends: 75855 [2025-03-03 11:00:18,635 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 11:00:18,635 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 370 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:18,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 742 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:00:18,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75855 states. [2025-03-03 11:00:19,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75855 to 70725. [2025-03-03 11:00:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70725 states, 70724 states have (on average 1.0690289010802556) internal successors, (75606), 70724 states have internal predecessors, (75606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70725 states to 70725 states and 75606 transitions. [2025-03-03 11:00:19,479 INFO L78 Accepts]: Start accepts. Automaton has 70725 states and 75606 transitions. Word has length 616 [2025-03-03 11:00:19,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:19,479 INFO L471 AbstractCegarLoop]: Abstraction has 70725 states and 75606 transitions. [2025-03-03 11:00:19,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 70725 states and 75606 transitions. [2025-03-03 11:00:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2025-03-03 11:00:19,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:19,491 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:19,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 11:00:19,491 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:19,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash 618080758, now seen corresponding path program 1 times [2025-03-03 11:00:19,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:19,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500884438] [2025-03-03 11:00:19,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:19,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:19,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-03-03 11:00:19,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-03-03 11:00:19,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:19,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 537 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 11:00:19,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:19,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500884438] [2025-03-03 11:00:19,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500884438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:19,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:19,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:19,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112398165] [2025-03-03 11:00:19,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:19,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:19,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:19,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:19,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:19,880 INFO L87 Difference]: Start difference. First operand 70725 states and 75606 transitions. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:21,312 INFO L93 Difference]: Finished difference Result 147426 states and 157667 transitions. [2025-03-03 11:00:21,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:21,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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 639 [2025-03-03 11:00:21,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:21,401 INFO L225 Difference]: With dead ends: 147426 [2025-03-03 11:00:21,402 INFO L226 Difference]: Without dead ends: 77128 [2025-03-03 11:00:21,452 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 11:00:21,454 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 421 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:21,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 213 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:00:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77128 states. [2025-03-03 11:00:22,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77128 to 72850. [2025-03-03 11:00:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72850 states, 72849 states have (on average 1.0670565141594257) internal successors, (77734), 72849 states have internal predecessors, (77734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72850 states to 72850 states and 77734 transitions. [2025-03-03 11:00:22,412 INFO L78 Accepts]: Start accepts. Automaton has 72850 states and 77734 transitions. Word has length 639 [2025-03-03 11:00:22,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:22,412 INFO L471 AbstractCegarLoop]: Abstraction has 72850 states and 77734 transitions. [2025-03-03 11:00:22,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:22,412 INFO L276 IsEmpty]: Start isEmpty. Operand 72850 states and 77734 transitions. [2025-03-03 11:00:22,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2025-03-03 11:00:22,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:22,436 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:22,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 11:00:22,437 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:22,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:22,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1226602067, now seen corresponding path program 1 times [2025-03-03 11:00:22,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:22,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487857512] [2025-03-03 11:00:22,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:22,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:22,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 771 statements into 1 equivalence classes. [2025-03-03 11:00:22,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 771 of 771 statements. [2025-03-03 11:00:22,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:22,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 558 proven. 0 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-03-03 11:00:23,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:23,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487857512] [2025-03-03 11:00:23,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487857512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:23,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:23,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:23,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061111707] [2025-03-03 11:00:23,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:23,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:23,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:23,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:23,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:23,151 INFO L87 Difference]: Start difference. First operand 72850 states and 77734 transitions. Second operand has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 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 11:00:24,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:24,465 INFO L93 Difference]: Finished difference Result 145272 states and 155030 transitions. [2025-03-03 11:00:24,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:24,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 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) Word has length 771 [2025-03-03 11:00:24,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:24,544 INFO L225 Difference]: With dead ends: 145272 [2025-03-03 11:00:24,544 INFO L226 Difference]: Without dead ends: 75403 [2025-03-03 11:00:24,577 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 11:00:24,577 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 150 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:24,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 719 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:00:24,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75403 states. [2025-03-03 11:00:25,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75403 to 70718. [2025-03-03 11:00:25,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70718 states, 70717 states have (on average 1.0662217005811898) internal successors, (75400), 70717 states have internal predecessors, (75400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70718 states to 70718 states and 75400 transitions. [2025-03-03 11:00:25,547 INFO L78 Accepts]: Start accepts. Automaton has 70718 states and 75400 transitions. Word has length 771 [2025-03-03 11:00:25,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:25,547 INFO L471 AbstractCegarLoop]: Abstraction has 70718 states and 75400 transitions. [2025-03-03 11:00:25,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 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 11:00:25,547 INFO L276 IsEmpty]: Start isEmpty. Operand 70718 states and 75400 transitions. [2025-03-03 11:00:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 783 [2025-03-03 11:00:25,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:25,563 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:00:25,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 11:00:25,564 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:25,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:25,564 INFO L85 PathProgramCache]: Analyzing trace with hash -4737066, now seen corresponding path program 1 times [2025-03-03 11:00:25,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:25,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618021458] [2025-03-03 11:00:25,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:25,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:25,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 782 statements into 1 equivalence classes. [2025-03-03 11:00:25,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 782 of 782 statements. [2025-03-03 11:00:25,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:25,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 233 proven. 215 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 11:00:26,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:26,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618021458] [2025-03-03 11:00:26,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618021458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:00:26,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065119874] [2025-03-03 11:00:26,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:26,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:00:26,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:00:26,600 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 11:00:26,601 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 11:00:26,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 782 statements into 1 equivalence classes. [2025-03-03 11:00:26,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 782 of 782 statements. [2025-03-03 11:00:26,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:26,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:26,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 11:00:26,814 INFO L279 TraceCheckSpWp]: Computing forward predicates...