./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label45.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8467039cd3b163d296fd08bc696cd2f7637ba962b4c476281adfe8f379f9ad63 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:39:25,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:39:25,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:39:25,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:39:25,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:39:25,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:39:25,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:39:25,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:39:25,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:39:25,484 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:39:25,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:39:25,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:39:25,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:39:25,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:39:25,485 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:39:25,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:39:25,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:39:25,486 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:39:25,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:39:25,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:39:25,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:39:25,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:39:25,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:39:25,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:39:25,487 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:39:25,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:39:25,487 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:39:25,488 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:39:25,488 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:39:25,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:39:25,488 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:39:25,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:39:25,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:39:25,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:39:25,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:39:25,489 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:39:25,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:39:25,489 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:39:25,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:39:25,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:39:25,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:39:25,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:39:25,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:39:25,490 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-jdk21/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 -> 8467039cd3b163d296fd08bc696cd2f7637ba962b4c476281adfe8f379f9ad63 [2025-02-05 11:39:25,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:39:25,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:39:25,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:39:25,789 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:39:25,790 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:39:25,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label45.c [2025-02-05 11:39:27,039 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3781b7e5b/932040d9bdbc47509f910b52ad1bde4e/FLAGffaadbd67 [2025-02-05 11:39:27,497 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:39:27,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label45.c [2025-02-05 11:39:27,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3781b7e5b/932040d9bdbc47509f910b52ad1bde4e/FLAGffaadbd67 [2025-02-05 11:39:27,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3781b7e5b/932040d9bdbc47509f910b52ad1bde4e [2025-02-05 11:39:27,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:39:27,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:39:27,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:39:27,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:39:27,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:39:27,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:39:27" (1/1) ... [2025-02-05 11:39:27,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6038d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:27, skipping insertion in model container [2025-02-05 11:39:27,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:39:27" (1/1) ... [2025-02-05 11:39:27,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:39:27,910 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label45.c[6354,6367] [2025-02-05 11:39:28,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:39:28,528 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:39:28,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label45.c[6354,6367] [2025-02-05 11:39:28,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:39:28,930 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:39:28,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:28 WrapperNode [2025-02-05 11:39:28,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:39:28,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:39:28,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:39:28,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:39:28,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:28" (1/1) ... [2025-02-05 11:39:29,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:28" (1/1) ... [2025-02-05 11:39:29,346 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-02-05 11:39:29,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:39:29,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:39:29,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:39:29,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:39:29,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:28" (1/1) ... [2025-02-05 11:39:29,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:28" (1/1) ... [2025-02-05 11:39:29,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:28" (1/1) ... [2025-02-05 11:39:29,549 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-02-05 11:39:29,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:28" (1/1) ... [2025-02-05 11:39:29,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:28" (1/1) ... [2025-02-05 11:39:29,695 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:28" (1/1) ... [2025-02-05 11:39:29,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:28" (1/1) ... [2025-02-05 11:39:29,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:28" (1/1) ... [2025-02-05 11:39:29,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:28" (1/1) ... [2025-02-05 11:39:29,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:39:29,812 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:39:29,812 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:39:29,812 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:39:29,814 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:28" (1/1) ... [2025-02-05 11:39:29,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:39:29,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:39:29,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:39:29,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:39:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:39:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:39:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:39:29,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:39:29,942 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:39:29,944 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:39:34,379 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:39:34,380 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-02-05 11:39:34,380 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:39:34,597 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-02-05 11:39:34,598 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:39:34,636 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:39:34,636 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:39:34,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:39:34 BoogieIcfgContainer [2025-02-05 11:39:34,639 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:39:34,642 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:39:34,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:39:34,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:39:34,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:39:27" (1/3) ... [2025-02-05 11:39:34,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5702b902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:39:34, skipping insertion in model container [2025-02-05 11:39:34,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:28" (2/3) ... [2025-02-05 11:39:34,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5702b902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:39:34, skipping insertion in model container [2025-02-05 11:39:34,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:39:34" (3/3) ... [2025-02-05 11:39:34,649 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label45.c [2025-02-05 11:39:34,665 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:39:34,667 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label45.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:39:34,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:39:34,778 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;@4be44d1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:39:34,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:39:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:34,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 11:39:34,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:34,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:39:34,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:34,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:34,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1463545197, now seen corresponding path program 1 times [2025-02-05 11:39:34,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:34,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207153343] [2025-02-05 11:39:34,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:34,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 11:39:34,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 11:39:34,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:34,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:39:35,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:35,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207153343] [2025-02-05 11:39:35,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207153343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:35,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:35,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:39:35,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734088987] [2025-02-05 11:39:35,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:35,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:35,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:35,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:35,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:35,270 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:38,703 INFO L93 Difference]: Finished difference Result 2404 states and 4642 transitions. [2025-02-05 11:39:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:38,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-02-05 11:39:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:38,728 INFO L225 Difference]: With dead ends: 2404 [2025-02-05 11:39:38,728 INFO L226 Difference]: Without dead ends: 1506 [2025-02-05 11:39:38,733 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-02-05 11:39:38,736 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 769 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:38,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 525 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:39:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-02-05 11:39:38,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-02-05 11:39:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6066445182724252) internal successors, (2418), 1505 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2418 transitions. [2025-02-05 11:39:38,864 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2418 transitions. Word has length 51 [2025-02-05 11:39:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:38,865 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2418 transitions. [2025-02-05 11:39:38,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:38,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2418 transitions. [2025-02-05 11:39:38,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 11:39:38,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:38,870 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, 2, 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] [2025-02-05 11:39:38,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:39:38,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:38,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:38,872 INFO L85 PathProgramCache]: Analyzing trace with hash -347488364, now seen corresponding path program 1 times [2025-02-05 11:39:38,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:38,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822055961] [2025-02-05 11:39:38,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:38,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:38,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 11:39:38,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 11:39:38,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:38,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:39:39,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:39,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822055961] [2025-02-05 11:39:39,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822055961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:39,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:39,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:39:39,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790915418] [2025-02-05 11:39:39,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:39,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:39,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:39,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:39,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:39,152 INFO L87 Difference]: Start difference. First operand 1506 states and 2418 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:42,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:42,184 INFO L93 Difference]: Finished difference Result 4514 states and 7250 transitions. [2025-02-05 11:39:42,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:42,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-02-05 11:39:42,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:42,197 INFO L225 Difference]: With dead ends: 4514 [2025-02-05 11:39:42,197 INFO L226 Difference]: Without dead ends: 3010 [2025-02-05 11:39:42,200 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-02-05 11:39:42,201 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 916 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:42,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 583 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:39:42,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2025-02-05 11:39:42,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3008. [2025-02-05 11:39:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.4595942800133024) internal successors, (4389), 3007 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4389 transitions. [2025-02-05 11:39:42,260 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4389 transitions. Word has length 126 [2025-02-05 11:39:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:42,261 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4389 transitions. [2025-02-05 11:39:42,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4389 transitions. [2025-02-05 11:39:42,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 11:39:42,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:42,266 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, 2, 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] [2025-02-05 11:39:42,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:39:42,267 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:42,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:42,268 INFO L85 PathProgramCache]: Analyzing trace with hash 832329200, now seen corresponding path program 1 times [2025-02-05 11:39:42,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:42,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468553423] [2025-02-05 11:39:42,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:42,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:42,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 11:39:42,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 11:39:42,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:42,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:39:42,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:42,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468553423] [2025-02-05 11:39:42,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468553423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:42,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:42,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:39:42,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010110443] [2025-02-05 11:39:42,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:42,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:42,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:42,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:42,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:42,559 INFO L87 Difference]: Start difference. First operand 3008 states and 4389 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 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-02-05 11:39:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:45,072 INFO L93 Difference]: Finished difference Result 9018 states and 13162 transitions. [2025-02-05 11:39:45,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:45,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 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 155 [2025-02-05 11:39:45,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:45,098 INFO L225 Difference]: With dead ends: 9018 [2025-02-05 11:39:45,098 INFO L226 Difference]: Without dead ends: 6012 [2025-02-05 11:39:45,103 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-02-05 11:39:45,104 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 745 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:45,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 447 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:39:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2025-02-05 11:39:45,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 6012. [2025-02-05 11:39:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 6011 states have (on average 1.2951256030610547) internal successors, (7785), 6011 states have internal predecessors, (7785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 7785 transitions. [2025-02-05 11:39:45,206 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 7785 transitions. Word has length 155 [2025-02-05 11:39:45,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:45,206 INFO L471 AbstractCegarLoop]: Abstraction has 6012 states and 7785 transitions. [2025-02-05 11:39:45,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 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-02-05 11:39:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 7785 transitions. [2025-02-05 11:39:45,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 11:39:45,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:45,210 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, 2, 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] [2025-02-05 11:39:45,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:39:45,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:45,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:45,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2104206169, now seen corresponding path program 1 times [2025-02-05 11:39:45,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:45,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331910990] [2025-02-05 11:39:45,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:45,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:45,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 11:39:45,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 11:39:45,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:45,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:39:45,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:45,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331910990] [2025-02-05 11:39:45,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331910990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:45,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:45,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:45,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997318932] [2025-02-05 11:39:45,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:45,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:45,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:45,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:45,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:45,445 INFO L87 Difference]: Start difference. First operand 6012 states and 7785 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:48,476 INFO L93 Difference]: Finished difference Result 18030 states and 23350 transitions. [2025-02-05 11:39:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:48,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 192 [2025-02-05 11:39:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:48,512 INFO L225 Difference]: With dead ends: 18030 [2025-02-05 11:39:48,512 INFO L226 Difference]: Without dead ends: 12020 [2025-02-05 11:39:48,520 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-02-05 11:39:48,523 INFO L435 NwaCegarLoop]: 1433 mSDtfsCounter, 703 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2844 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 3220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 2844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:48,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1441 Invalid, 3220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 2844 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:39:48,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12020 states. [2025-02-05 11:39:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12020 to 11269. [2025-02-05 11:39:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.2676606318778842) internal successors, (14284), 11268 states have internal predecessors, (14284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 14284 transitions. [2025-02-05 11:39:48,718 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 14284 transitions. Word has length 192 [2025-02-05 11:39:48,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:48,719 INFO L471 AbstractCegarLoop]: Abstraction has 11269 states and 14284 transitions. [2025-02-05 11:39:48,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 14284 transitions. [2025-02-05 11:39:48,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 11:39:48,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:48,721 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, 2, 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-02-05 11:39:48,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:39:48,721 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:48,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:48,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1911907500, now seen corresponding path program 1 times [2025-02-05 11:39:48,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:48,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233362560] [2025-02-05 11:39:48,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:48,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:48,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 11:39:48,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 11:39:48,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:48,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:39:49,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:49,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233362560] [2025-02-05 11:39:49,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233362560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:49,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:49,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:39:49,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39972301] [2025-02-05 11:39:49,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:49,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 11:39:49,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:49,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 11:39:49,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:39:49,361 INFO L87 Difference]: Start difference. First operand 11269 states and 14284 transitions. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:53,858 INFO L93 Difference]: Finished difference Result 29295 states and 36129 transitions. [2025-02-05 11:39:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 11:39:53,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-02-05 11:39:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:53,899 INFO L225 Difference]: With dead ends: 29295 [2025-02-05 11:39:53,899 INFO L226 Difference]: Without dead ends: 18028 [2025-02-05 11:39:53,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:39:53,913 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 3431 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5369 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3431 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 5528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 5369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:53,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3431 Valid, 720 Invalid, 5528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 5369 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-02-05 11:39:53,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18028 states. [2025-02-05 11:39:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18028 to 16526. [2025-02-05 11:39:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16526 states, 16525 states have (on average 1.2050226928895613) internal successors, (19913), 16525 states have internal predecessors, (19913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:54,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16526 states to 16526 states and 19913 transitions. [2025-02-05 11:39:54,208 INFO L78 Accepts]: Start accepts. Automaton has 16526 states and 19913 transitions. Word has length 195 [2025-02-05 11:39:54,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:54,209 INFO L471 AbstractCegarLoop]: Abstraction has 16526 states and 19913 transitions. [2025-02-05 11:39:54,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 16526 states and 19913 transitions. [2025-02-05 11:39:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 11:39:54,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:54,211 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, 2, 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] [2025-02-05 11:39:54,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:39:54,212 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:54,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:54,212 INFO L85 PathProgramCache]: Analyzing trace with hash 479907235, now seen corresponding path program 1 times [2025-02-05 11:39:54,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:54,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037423783] [2025-02-05 11:39:54,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:54,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:54,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 11:39:54,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 11:39:54,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:54,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:54,411 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:39:54,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:54,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037423783] [2025-02-05 11:39:54,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037423783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:54,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:54,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:54,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297119841] [2025-02-05 11:39:54,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:54,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:54,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:54,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:54,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:54,413 INFO L87 Difference]: Start difference. First operand 16526 states and 19913 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:57,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:57,351 INFO L93 Difference]: Finished difference Result 39058 states and 47606 transitions. [2025-02-05 11:39:57,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:57,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2025-02-05 11:39:57,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:57,406 INFO L225 Difference]: With dead ends: 39058 [2025-02-05 11:39:57,406 INFO L226 Difference]: Without dead ends: 22534 [2025-02-05 11:39:57,420 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-02-05 11:39:57,421 INFO L435 NwaCegarLoop]: 1419 mSDtfsCounter, 710 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2540 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 3086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 2540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:57,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1427 Invalid, 3086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 2540 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:39:57,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22534 states. [2025-02-05 11:39:57,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22534 to 22534. [2025-02-05 11:39:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22534 states, 22533 states have (on average 1.2062752407579993) internal successors, (27181), 22533 states have internal predecessors, (27181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22534 states to 22534 states and 27181 transitions. [2025-02-05 11:39:57,763 INFO L78 Accepts]: Start accepts. Automaton has 22534 states and 27181 transitions. Word has length 196 [2025-02-05 11:39:57,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:57,763 INFO L471 AbstractCegarLoop]: Abstraction has 22534 states and 27181 transitions. [2025-02-05 11:39:57,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 22534 states and 27181 transitions. [2025-02-05 11:39:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-02-05 11:39:57,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:57,768 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:39:57,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:39:57,768 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:57,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:57,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1230532913, now seen corresponding path program 1 times [2025-02-05 11:39:57,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:57,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861594641] [2025-02-05 11:39:57,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:57,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:57,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-05 11:39:57,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-05 11:39:57,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:57,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 11:39:58,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:58,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861594641] [2025-02-05 11:39:58,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861594641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:58,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:58,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:58,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792990249] [2025-02-05 11:39:58,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:58,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:39:58,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:58,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:39:58,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:39:58,130 INFO L87 Difference]: Start difference. First operand 22534 states and 27181 transitions. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:00,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:40:00,838 INFO L93 Difference]: Finished difference Result 50360 states and 60086 transitions. [2025-02-05 11:40:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:40:00,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 266 [2025-02-05 11:40:00,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:40:00,886 INFO L225 Difference]: With dead ends: 50360 [2025-02-05 11:40:00,886 INFO L226 Difference]: Without dead ends: 27791 [2025-02-05 11:40:00,909 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-02-05 11:40:00,910 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:40:00,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 708 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:40:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27791 states. [2025-02-05 11:40:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27791 to 27791. [2025-02-05 11:40:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27791 states, 27790 states have (on average 1.1701691255847426) internal successors, (32519), 27790 states have internal predecessors, (32519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27791 states to 27791 states and 32519 transitions. [2025-02-05 11:40:01,235 INFO L78 Accepts]: Start accepts. Automaton has 27791 states and 32519 transitions. Word has length 266 [2025-02-05 11:40:01,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:40:01,236 INFO L471 AbstractCegarLoop]: Abstraction has 27791 states and 32519 transitions. [2025-02-05 11:40:01,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:01,236 INFO L276 IsEmpty]: Start isEmpty. Operand 27791 states and 32519 transitions. [2025-02-05 11:40:01,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-02-05 11:40:01,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:40:01,241 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:40:01,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:40:01,242 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:40:01,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:40:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1027875884, now seen corresponding path program 1 times [2025-02-05 11:40:01,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:40:01,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975242926] [2025-02-05 11:40:01,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:40:01,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:40:01,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-05 11:40:01,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-05 11:40:01,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:40:01,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:40:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-02-05 11:40:01,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:40:01,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975242926] [2025-02-05 11:40:01,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975242926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:40:01,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:40:01,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:40:01,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037856754] [2025-02-05 11:40:01,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:40:01,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:40:01,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:40:01,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:40:01,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:40:01,498 INFO L87 Difference]: Start difference. First operand 27791 states and 32519 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:40:04,142 INFO L93 Difference]: Finished difference Result 69098 states and 82139 transitions. [2025-02-05 11:40:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:40:04,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 328 [2025-02-05 11:40:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:40:04,204 INFO L225 Difference]: With dead ends: 69098 [2025-02-05 11:40:04,205 INFO L226 Difference]: Without dead ends: 41309 [2025-02-05 11:40:04,230 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-02-05 11:40:04,231 INFO L435 NwaCegarLoop]: 1208 mSDtfsCounter, 724 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 2781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:40:04,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1216 Invalid, 2781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:40:04,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41309 states. [2025-02-05 11:40:04,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41309 to 41309. [2025-02-05 11:40:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41309 states, 41308 states have (on average 1.1405538878667572) internal successors, (47114), 41308 states have internal predecessors, (47114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41309 states to 41309 states and 47114 transitions. [2025-02-05 11:40:04,826 INFO L78 Accepts]: Start accepts. Automaton has 41309 states and 47114 transitions. Word has length 328 [2025-02-05 11:40:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:40:04,829 INFO L471 AbstractCegarLoop]: Abstraction has 41309 states and 47114 transitions. [2025-02-05 11:40:04,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:04,830 INFO L276 IsEmpty]: Start isEmpty. Operand 41309 states and 47114 transitions. [2025-02-05 11:40:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-02-05 11:40:04,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:40:04,835 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:40:04,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:40:04,836 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:40:04,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:40:04,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1576941888, now seen corresponding path program 1 times [2025-02-05 11:40:04,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:40:04,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982727294] [2025-02-05 11:40:04,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:40:04,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:40:04,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-02-05 11:40:04,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-02-05 11:40:04,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:40:04,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:40:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-02-05 11:40:05,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:40:05,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982727294] [2025-02-05 11:40:05,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982727294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:40:05,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:40:05,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:40:05,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123558701] [2025-02-05 11:40:05,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:40:05,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:40:05,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:40:05,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:40:05,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:40:05,087 INFO L87 Difference]: Start difference. First operand 41309 states and 47114 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:07,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:40:07,958 INFO L93 Difference]: Finished difference Result 82616 states and 94226 transitions. [2025-02-05 11:40:07,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:40:07,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 336 [2025-02-05 11:40:07,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:40:08,007 INFO L225 Difference]: With dead ends: 82616 [2025-02-05 11:40:08,007 INFO L226 Difference]: Without dead ends: 41309 [2025-02-05 11:40:08,027 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-02-05 11:40:08,028 INFO L435 NwaCegarLoop]: 1180 mSDtfsCounter, 755 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2192 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:40:08,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1188 Invalid, 2723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2192 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:40:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41309 states. [2025-02-05 11:40:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41309 to 41309. [2025-02-05 11:40:08,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41309 states, 41308 states have (on average 1.091749782124528) internal successors, (45098), 41308 states have internal predecessors, (45098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41309 states to 41309 states and 45098 transitions. [2025-02-05 11:40:08,565 INFO L78 Accepts]: Start accepts. Automaton has 41309 states and 45098 transitions. Word has length 336 [2025-02-05 11:40:08,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:40:08,566 INFO L471 AbstractCegarLoop]: Abstraction has 41309 states and 45098 transitions. [2025-02-05 11:40:08,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 41309 states and 45098 transitions. [2025-02-05 11:40:08,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-02-05 11:40:08,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:40:08,570 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, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:40:08,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:40:08,571 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:40:08,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:40:08,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1006610672, now seen corresponding path program 1 times [2025-02-05 11:40:08,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:40:08,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244305373] [2025-02-05 11:40:08,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:40:08,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:40:08,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-02-05 11:40:08,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-02-05 11:40:08,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:40:08,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:40:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:40:09,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:40:09,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244305373] [2025-02-05 11:40:09,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244305373] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:40:09,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268980055] [2025-02-05 11:40:09,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:40:09,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:40:09,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:40:09,125 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:40:09,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:40:09,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-02-05 11:40:09,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-02-05 11:40:09,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:40:09,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:40:09,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:40:09,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:40:09,684 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 11:40:09,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:40:09,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268980055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:40:09,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:40:09,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-02-05 11:40:09,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007753093] [2025-02-05 11:40:09,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:40:09,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:40:09,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:40:09,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:40:09,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:40:09,687 INFO L87 Difference]: Start difference. First operand 41309 states and 45098 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:40:12,292 INFO L93 Difference]: Finished difference Result 114909 states and 125877 transitions. [2025-02-05 11:40:12,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:40:12,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 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 356 [2025-02-05 11:40:12,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:40:12,361 INFO L225 Difference]: With dead ends: 114909 [2025-02-05 11:40:12,361 INFO L226 Difference]: Without dead ends: 73602 [2025-02-05 11:40:12,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:40:12,380 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 459 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2360 mSolverCounterSat, 562 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 562 IncrementalHoareTripleChecker+Valid, 2360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:40:12,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 605 Invalid, 2922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [562 Valid, 2360 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:40:12,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73602 states. [2025-02-05 11:40:12,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73602 to 68345. [2025-02-05 11:40:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68345 states, 68344 states have (on average 1.0748273440243474) internal successors, (73458), 68344 states have internal predecessors, (73458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68345 states to 68345 states and 73458 transitions. [2025-02-05 11:40:13,015 INFO L78 Accepts]: Start accepts. Automaton has 68345 states and 73458 transitions. Word has length 356 [2025-02-05 11:40:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:40:13,016 INFO L471 AbstractCegarLoop]: Abstraction has 68345 states and 73458 transitions. [2025-02-05 11:40:13,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 68345 states and 73458 transitions. [2025-02-05 11:40:13,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-02-05 11:40:13,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:40:13,022 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:40:13,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:40:13,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 11:40:13,222 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:40:13,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:40:13,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1189470037, now seen corresponding path program 1 times [2025-02-05 11:40:13,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:40:13,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233947714] [2025-02-05 11:40:13,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:40:13,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:40:13,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-02-05 11:40:13,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-02-05 11:40:13,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:40:13,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:40:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-02-05 11:40:13,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:40:13,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233947714] [2025-02-05 11:40:13,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233947714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:40:13,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:40:13,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:40:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312846902] [2025-02-05 11:40:13,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:40:13,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:40:13,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:40:13,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:40:13,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:40:13,769 INFO L87 Difference]: Start difference. First operand 68345 states and 73458 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:40:16,295 INFO L93 Difference]: Finished difference Result 151708 states and 163189 transitions. [2025-02-05 11:40:16,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:40:16,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 382 [2025-02-05 11:40:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:40:16,385 INFO L225 Difference]: With dead ends: 151708 [2025-02-05 11:40:16,385 INFO L226 Difference]: Without dead ends: 81863 [2025-02-05 11:40:16,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-02-05 11:40:16,424 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 820 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2137 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:40:16,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 906 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2137 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:40:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81863 states. [2025-02-05 11:40:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81863 to 77357. [2025-02-05 11:40:17,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77357 states, 77356 states have (on average 1.0724442835720565) internal successors, (82960), 77356 states have internal predecessors, (82960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77357 states to 77357 states and 82960 transitions. [2025-02-05 11:40:17,314 INFO L78 Accepts]: Start accepts. Automaton has 77357 states and 82960 transitions. Word has length 382 [2025-02-05 11:40:17,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:40:17,315 INFO L471 AbstractCegarLoop]: Abstraction has 77357 states and 82960 transitions. [2025-02-05 11:40:17,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:17,315 INFO L276 IsEmpty]: Start isEmpty. Operand 77357 states and 82960 transitions. [2025-02-05 11:40:17,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2025-02-05 11:40:17,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:40:17,336 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, 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, 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, 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] [2025-02-05 11:40:17,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:40:17,336 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:40:17,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:40:17,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1692937812, now seen corresponding path program 1 times [2025-02-05 11:40:17,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:40:17,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530983317] [2025-02-05 11:40:17,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:40:17,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:40:17,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes. [2025-02-05 11:40:17,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements. [2025-02-05 11:40:17,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:40:17,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:40:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 707 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-02-05 11:40:17,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:40:17,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530983317] [2025-02-05 11:40:17,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530983317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:40:17,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:40:17,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:40:17,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883843864] [2025-02-05 11:40:17,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:40:17,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:40:17,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:40:17,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:40:17,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:40:17,679 INFO L87 Difference]: Start difference. First operand 77357 states and 82960 transitions. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:40:20,434 INFO L93 Difference]: Finished difference Result 159218 states and 170484 transitions. [2025-02-05 11:40:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:40:20,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 551 [2025-02-05 11:40:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:40:20,521 INFO L225 Difference]: With dead ends: 159218 [2025-02-05 11:40:20,521 INFO L226 Difference]: Without dead ends: 81863 [2025-02-05 11:40:20,553 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-02-05 11:40:20,554 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 663 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 617 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 617 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:40:20,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 288 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [617 Valid, 2299 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:40:20,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81863 states. [2025-02-05 11:40:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81863 to 75104. [2025-02-05 11:40:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75104 states, 75103 states have (on average 1.0706363261121394) internal successors, (80408), 75103 states have internal predecessors, (80408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75104 states to 75104 states and 80408 transitions. [2025-02-05 11:40:21,591 INFO L78 Accepts]: Start accepts. Automaton has 75104 states and 80408 transitions. Word has length 551 [2025-02-05 11:40:21,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:40:21,591 INFO L471 AbstractCegarLoop]: Abstraction has 75104 states and 80408 transitions. [2025-02-05 11:40:21,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:21,592 INFO L276 IsEmpty]: Start isEmpty. Operand 75104 states and 80408 transitions. [2025-02-05 11:40:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2025-02-05 11:40:21,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:40:21,614 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, 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, 2, 2, 2, 2, 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] [2025-02-05 11:40:21,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:40:21,614 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:40:21,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:40:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1218921125, now seen corresponding path program 1 times [2025-02-05 11:40:21,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:40:21,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48798360] [2025-02-05 11:40:21,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:40:21,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:40:21,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 559 statements into 1 equivalence classes. [2025-02-05 11:40:21,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 559 of 559 statements. [2025-02-05 11:40:21,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:40:21,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:40:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-05 11:40:22,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:40:22,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48798360] [2025-02-05 11:40:22,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48798360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:40:22,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:40:22,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:40:22,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046900556] [2025-02-05 11:40:22,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:40:22,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:40:22,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:40:22,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:40:22,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:40:22,115 INFO L87 Difference]: Start difference. First operand 75104 states and 80408 transitions. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:40:25,062 INFO L93 Difference]: Finished difference Result 178744 states and 192842 transitions. [2025-02-05 11:40:25,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:40:25,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 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 559 [2025-02-05 11:40:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:40:25,175 INFO L225 Difference]: With dead ends: 178744 [2025-02-05 11:40:25,175 INFO L226 Difference]: Without dead ends: 103642 [2025-02-05 11:40:25,211 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-02-05 11:40:25,212 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 703 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 2925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:40:25,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 606 Invalid, 2925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:40:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103642 states. [2025-02-05 11:40:26,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103642 to 100638. [2025-02-05 11:40:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100638 states, 100637 states have (on average 1.0738297047805478) internal successors, (108067), 100637 states have internal predecessors, (108067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100638 states to 100638 states and 108067 transitions. [2025-02-05 11:40:26,552 INFO L78 Accepts]: Start accepts. Automaton has 100638 states and 108067 transitions. Word has length 559 [2025-02-05 11:40:26,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:40:26,552 INFO L471 AbstractCegarLoop]: Abstraction has 100638 states and 108067 transitions. [2025-02-05 11:40:26,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:26,552 INFO L276 IsEmpty]: Start isEmpty. Operand 100638 states and 108067 transitions. [2025-02-05 11:40:26,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-02-05 11:40:26,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:40:26,567 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, 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, 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] [2025-02-05 11:40:26,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:40:26,567 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:40:26,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:40:26,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1723487990, now seen corresponding path program 1 times [2025-02-05 11:40:26,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:40:26,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126033889] [2025-02-05 11:40:26,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:40:26,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:40:26,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-02-05 11:40:26,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-02-05 11:40:26,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:40:26,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:40:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 187 proven. 229 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 11:40:27,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:40:27,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126033889] [2025-02-05 11:40:27,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126033889] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:40:27,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771906328] [2025-02-05 11:40:27,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:40:27,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:40:27,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:40:27,145 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:40:27,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:40:27,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-02-05 11:40:27,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-02-05 11:40:27,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:40:27,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:40:27,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:40:27,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:40:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:40:27,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:40:27,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771906328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:40:27,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:40:27,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 11:40:27,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998623857] [2025-02-05 11:40:27,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:40:27,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:40:27,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:40:27,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:40:27,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:40:27,591 INFO L87 Difference]: Start difference. First operand 100638 states and 108067 transitions. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:40:30,507 INFO L93 Difference]: Finished difference Result 235820 states and 254788 transitions. [2025-02-05 11:40:30,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:40:30,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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 569 [2025-02-05 11:40:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:40:30,682 INFO L225 Difference]: With dead ends: 235820 [2025-02-05 11:40:30,683 INFO L226 Difference]: Without dead ends: 135184 [2025-02-05 11:40:30,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:40:30,754 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 526 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 3031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:40:30,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1004 Invalid, 3031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:40:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135184 states. [2025-02-05 11:40:32,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135184 to 133682. [2025-02-05 11:40:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133682 states, 133681 states have (on average 1.0798168774919397) internal successors, (144351), 133681 states have internal predecessors, (144351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133682 states to 133682 states and 144351 transitions. [2025-02-05 11:40:32,813 INFO L78 Accepts]: Start accepts. Automaton has 133682 states and 144351 transitions. Word has length 569 [2025-02-05 11:40:32,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:40:32,814 INFO L471 AbstractCegarLoop]: Abstraction has 133682 states and 144351 transitions. [2025-02-05 11:40:32,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 133682 states and 144351 transitions. [2025-02-05 11:40:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-02-05 11:40:32,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:40:32,843 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:40:32,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:40:33,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:40:33,044 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:40:33,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:40:33,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1268944039, now seen corresponding path program 1 times [2025-02-05 11:40:33,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:40:33,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525176589] [2025-02-05 11:40:33,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:40:33,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:40:33,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-02-05 11:40:33,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-02-05 11:40:33,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:40:33,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:40:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 597 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-02-05 11:40:33,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:40:33,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525176589] [2025-02-05 11:40:33,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525176589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:40:33,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:40:33,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:40:33,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246458805] [2025-02-05 11:40:33,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:40:33,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:40:33,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:40:33,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:40:33,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:40:33,490 INFO L87 Difference]: Start difference. First operand 133682 states and 144351 transitions. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:40:36,469 INFO L93 Difference]: Finished difference Result 312422 states and 338581 transitions. [2025-02-05 11:40:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:40:36,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 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 694 [2025-02-05 11:40:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:40:36,668 INFO L225 Difference]: With dead ends: 312422 [2025-02-05 11:40:36,668 INFO L226 Difference]: Without dead ends: 178742 [2025-02-05 11:40:36,738 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-02-05 11:40:36,739 INFO L435 NwaCegarLoop]: 1245 mSDtfsCounter, 748 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 706 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 706 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:40:36,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1252 Invalid, 2837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [706 Valid, 2131 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:40:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178742 states. [2025-02-05 11:40:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178742 to 162971. [2025-02-05 11:40:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162971 states, 162970 states have (on average 1.0711971528502178) internal successors, (174573), 162970 states have internal predecessors, (174573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:38,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162971 states to 162971 states and 174573 transitions. [2025-02-05 11:40:38,931 INFO L78 Accepts]: Start accepts. Automaton has 162971 states and 174573 transitions. Word has length 694 [2025-02-05 11:40:38,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:40:38,931 INFO L471 AbstractCegarLoop]: Abstraction has 162971 states and 174573 transitions. [2025-02-05 11:40:38,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:38,931 INFO L276 IsEmpty]: Start isEmpty. Operand 162971 states and 174573 transitions. [2025-02-05 11:40:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2025-02-05 11:40:38,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:40:38,955 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:40:38,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:40:38,956 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:40:38,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:40:38,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2131249333, now seen corresponding path program 1 times [2025-02-05 11:40:38,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:40:38,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493711019] [2025-02-05 11:40:38,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:40:38,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:40:39,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 721 statements into 1 equivalence classes. [2025-02-05 11:40:39,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 721 of 721 statements. [2025-02-05 11:40:39,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:40:39,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:40:39,973 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 339 proven. 372 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-05 11:40:39,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:40:39,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493711019] [2025-02-05 11:40:39,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493711019] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:40:39,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540065952] [2025-02-05 11:40:39,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:40:39,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:40:39,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:40:39,976 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:40:40,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 11:40:40,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 721 statements into 1 equivalence classes. [2025-02-05 11:40:40,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 721 of 721 statements. [2025-02-05 11:40:40,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:40:40,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:40:40,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:40:40,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:40:40,416 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-02-05 11:40:40,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:40:40,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540065952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:40:40,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:40:40,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:40:40,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11251093] [2025-02-05 11:40:40,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:40:40,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:40:40,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:40:40,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:40:40,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:40:40,419 INFO L87 Difference]: Start difference. First operand 162971 states and 174573 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:40:43,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:40:43,321 INFO L93 Difference]: Finished difference Result 349221 states and 374066 transitions. [2025-02-05 11:40:43,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:40:43,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 721 [2025-02-05 11:40:43,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted.