./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label26.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_label26.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 3e2e47b78067195f514cd980cc36561e3679a03106d39ad74c0665f1ff81079a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:37:18,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:37:18,266 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:37:18,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:37:18,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:37:18,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:37:18,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:37:18,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:37:18,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:37:18,290 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:37:18,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:37:18,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:37:18,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:37:18,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:37:18,291 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:37:18,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:37:18,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:37:18,291 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:37:18,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:37:18,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:37:18,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:37:18,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:37:18,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:37:18,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:37:18,292 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:37:18,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:37:18,292 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:37:18,292 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:37:18,292 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:37:18,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:37:18,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:37:18,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:37:18,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:37:18,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:37:18,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:37:18,293 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:37:18,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:37:18,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:37:18,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:37:18,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:37:18,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:37:18,293 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:37:18,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:37:18,293 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 -> 3e2e47b78067195f514cd980cc36561e3679a03106d39ad74c0665f1ff81079a [2025-02-05 11:37:18,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:37:18,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:37:18,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:37:18,543 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:37:18,543 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:37:18,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label26.c [2025-02-05 11:37:19,842 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/60b7c6f48/df48abf1dd664877b098eeafa035ff3a/FLAG7cdb583cf [2025-02-05 11:37:20,293 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:37:20,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label26.c [2025-02-05 11:37:20,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/60b7c6f48/df48abf1dd664877b098eeafa035ff3a/FLAG7cdb583cf [2025-02-05 11:37:20,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/60b7c6f48/df48abf1dd664877b098eeafa035ff3a [2025-02-05 11:37:20,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:37:20,355 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:37:20,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:37:20,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:37:20,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:37:20,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:37:20" (1/1) ... [2025-02-05 11:37:20,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a019a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:20, skipping insertion in model container [2025-02-05 11:37:20,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:37:20" (1/1) ... [2025-02-05 11:37:20,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:37:20,675 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_label26.c[5703,5716] [2025-02-05 11:37:21,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:37:21,252 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:37:21,273 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_label26.c[5703,5716] [2025-02-05 11:37:21,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:37:21,606 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:37:21,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:21 WrapperNode [2025-02-05 11:37:21,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:37:21,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:37:21,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:37:21,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:37:21,614 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:37:21" (1/1) ... [2025-02-05 11:37:21,668 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:37:21" (1/1) ... [2025-02-05 11:37:21,997 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-02-05 11:37:21,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:37:21,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:37:21,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:37:21,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:37:22,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:21" (1/1) ... [2025-02-05 11:37:22,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:21" (1/1) ... [2025-02-05 11:37:22,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:21" (1/1) ... [2025-02-05 11:37:22,221 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:37:22,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:21" (1/1) ... [2025-02-05 11:37:22,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:21" (1/1) ... [2025-02-05 11:37:22,389 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:21" (1/1) ... [2025-02-05 11:37:22,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:21" (1/1) ... [2025-02-05 11:37:22,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:21" (1/1) ... [2025-02-05 11:37:22,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:21" (1/1) ... [2025-02-05 11:37:22,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:37:22,565 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:37:22,565 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:37:22,566 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:37:22,568 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:21" (1/1) ... [2025-02-05 11:37:22,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:37:22,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:37:22,597 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:37:22,603 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:37:22,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:37:22,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:37:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:37:22,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:37:22,689 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:37:22,691 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:37:27,263 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:37:27,264 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-02-05 11:37:27,264 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:37:27,465 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-02-05 11:37:27,466 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:37:27,507 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:37:27,508 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:37:27,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:37:27 BoogieIcfgContainer [2025-02-05 11:37:27,509 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:37:27,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:37:27,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:37:27,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:37:27,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:37:20" (1/3) ... [2025-02-05 11:37:27,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a65aa17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:37:27, skipping insertion in model container [2025-02-05 11:37:27,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:37:21" (2/3) ... [2025-02-05 11:37:27,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a65aa17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:37:27, skipping insertion in model container [2025-02-05 11:37:27,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:37:27" (3/3) ... [2025-02-05 11:37:27,518 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label26.c [2025-02-05 11:37:27,535 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:37:27,537 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label26.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:37:27,633 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:37:27,643 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;@2df910cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:37:27,643 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:37:27,653 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:37:27,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 11:37:27,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:37:27,661 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] [2025-02-05 11:37:27,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:37:27,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:37:27,668 INFO L85 PathProgramCache]: Analyzing trace with hash -159125258, now seen corresponding path program 1 times [2025-02-05 11:37:27,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:37:27,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482226349] [2025-02-05 11:37:27,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:37:27,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:37:27,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 11:37:27,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 11:37:27,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:37:27,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:37:28,211 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:37:28,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:37:28,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482226349] [2025-02-05 11:37:28,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482226349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:37:28,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:37:28,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:37:28,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351956730] [2025-02-05 11:37:28,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:37:28,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:37:28,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:37:28,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:37:28,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:37:28,245 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 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:37:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:37:34,368 INFO L93 Difference]: Finished difference Result 3142 states and 6126 transitions. [2025-02-05 11:37:34,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:37:34,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-02-05 11:37:34,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:37:34,391 INFO L225 Difference]: With dead ends: 3142 [2025-02-05 11:37:34,392 INFO L226 Difference]: Without dead ends: 2257 [2025-02-05 11:37:34,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:37:34,399 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 2219 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5678 mSolverCounterSat, 1220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2219 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 6898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1220 IncrementalHoareTripleChecker+Valid, 5678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:37:34,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2219 Valid, 783 Invalid, 6898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1220 Valid, 5678 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-02-05 11:37:34,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-02-05 11:37:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2025-02-05 11:37:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.5802304964539007) internal successors, (3565), 2256 states have internal predecessors, (3565), 0 states have call successors, (0), 0 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:37:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3565 transitions. [2025-02-05 11:37:34,532 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3565 transitions. Word has length 45 [2025-02-05 11:37:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:37:34,533 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3565 transitions. [2025-02-05 11:37:34,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:37:34,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3565 transitions. [2025-02-05 11:37:34,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 11:37:34,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:37:34,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:34,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:37:34,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:37:34,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:37:34,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1924041267, now seen corresponding path program 1 times [2025-02-05 11:37:34,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:37:34,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210598580] [2025-02-05 11:37:34,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:37:34,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:37:34,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 11:37:34,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 11:37:34,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:37:34,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:37:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:37:35,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:37:35,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210598580] [2025-02-05 11:37:35,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210598580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:37:35,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:37:35,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:37:35,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393750859] [2025-02-05 11:37:35,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:37:35,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:37:35,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:37:35,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:37:35,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:37:35,048 INFO L87 Difference]: Start difference. First operand 2257 states and 3565 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:37:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:37:38,705 INFO L93 Difference]: Finished difference Result 5300 states and 9213 transitions. [2025-02-05 11:37:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:37:38,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-02-05 11:37:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:37:38,720 INFO L225 Difference]: With dead ends: 5300 [2025-02-05 11:37:38,720 INFO L226 Difference]: Without dead ends: 3759 [2025-02-05 11:37:38,723 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:37:38,724 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 688 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 4468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:37:38,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 712 Invalid, 4468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-02-05 11:37:38,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2025-02-05 11:37:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3759. [2025-02-05 11:37:38,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.3685470995210218) internal successors, (5143), 3758 states have internal predecessors, (5143), 0 states have call successors, (0), 0 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:37:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5143 transitions. [2025-02-05 11:37:38,797 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5143 transitions. Word has length 116 [2025-02-05 11:37:38,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:37:38,799 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5143 transitions. [2025-02-05 11:37:38,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:37:38,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5143 transitions. [2025-02-05 11:37:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 11:37:38,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:37:38,809 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:38,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:37:38,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:37:38,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:37:38,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1352718668, now seen corresponding path program 1 times [2025-02-05 11:37:38,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:37:38,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117481301] [2025-02-05 11:37:38,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:37:38,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:37:38,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 11:37:38,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 11:37:38,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:37:38,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:37:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:37:39,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:37:39,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117481301] [2025-02-05 11:37:39,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117481301] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:37:39,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957912601] [2025-02-05 11:37:39,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:37:39,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:37:39,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:37:39,313 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:37:39,315 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:37:39,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 11:37:39,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 11:37:39,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:37:39,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:37:39,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:37:39,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:37:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 11:37:39,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:37:39,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957912601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:37:39,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:37:39,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-02-05 11:37:39,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142676081] [2025-02-05 11:37:39,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:37:39,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:37:39,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:37:39,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:37:39,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:37:39,734 INFO L87 Difference]: Start difference. First operand 3759 states and 5143 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:37:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:37:42,018 INFO L93 Difference]: Finished difference Result 9018 states and 13078 transitions. [2025-02-05 11:37:42,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:37:42,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 190 [2025-02-05 11:37:42,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:37:42,041 INFO L225 Difference]: With dead ends: 9018 [2025-02-05 11:37:42,042 INFO L226 Difference]: Without dead ends: 6012 [2025-02-05 11:37:42,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 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:37:42,048 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 720 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 702 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 702 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:37:42,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 104 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [702 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:37:42,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2025-02-05 11:37:42,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 5261. [2025-02-05 11:37:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5261 states, 5260 states have (on average 1.4636882129277566) internal successors, (7699), 5260 states have internal predecessors, (7699), 0 states have call successors, (0), 0 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:37:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 7699 transitions. [2025-02-05 11:37:42,149 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 7699 transitions. Word has length 190 [2025-02-05 11:37:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:37:42,150 INFO L471 AbstractCegarLoop]: Abstraction has 5261 states and 7699 transitions. [2025-02-05 11:37:42,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:37:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 7699 transitions. [2025-02-05 11:37:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-05 11:37:42,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:37:42,155 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, 2, 2, 2, 2, 2, 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] [2025-02-05 11:37:42,164 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:37:42,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:37:42,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:37:42,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:37:42,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2059196889, now seen corresponding path program 1 times [2025-02-05 11:37:42,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:37:42,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765422243] [2025-02-05 11:37:42,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:37:42,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:37:42,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-05 11:37:42,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-05 11:37:42,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:37:42,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:37:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 11:37:42,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:37:42,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765422243] [2025-02-05 11:37:42,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765422243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:37:42,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:37:42,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:37:42,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676286566] [2025-02-05 11:37:42,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:37:42,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:37:42,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:37:42,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:37:42,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:37:42,938 INFO L87 Difference]: Start difference. First operand 5261 states and 7699 transitions. Second operand has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 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:37:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:37:46,065 INFO L93 Difference]: Finished difference Result 12812 states and 19959 transitions. [2025-02-05 11:37:46,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:37:46,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 257 [2025-02-05 11:37:46,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:37:46,089 INFO L225 Difference]: With dead ends: 12812 [2025-02-05 11:37:46,089 INFO L226 Difference]: Without dead ends: 8267 [2025-02-05 11:37:46,097 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:37:46,097 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 775 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3717 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 4259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 3717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:37:46,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 324 Invalid, 4259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [542 Valid, 3717 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 11:37:46,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8267 states. [2025-02-05 11:37:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8267 to 7514. [2025-02-05 11:37:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7514 states, 7513 states have (on average 1.4243311593238386) internal successors, (10701), 7513 states have internal predecessors, (10701), 0 states have call successors, (0), 0 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:37:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7514 states to 7514 states and 10701 transitions. [2025-02-05 11:37:46,238 INFO L78 Accepts]: Start accepts. Automaton has 7514 states and 10701 transitions. Word has length 257 [2025-02-05 11:37:46,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:37:46,239 INFO L471 AbstractCegarLoop]: Abstraction has 7514 states and 10701 transitions. [2025-02-05 11:37:46,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 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:37:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 7514 states and 10701 transitions. [2025-02-05 11:37:46,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-02-05 11:37:46,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:37:46,243 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:37:46,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:37:46,243 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:37:46,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:37:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1636603646, now seen corresponding path program 1 times [2025-02-05 11:37:46,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:37:46,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124669544] [2025-02-05 11:37:46,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:37:46,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:37:46,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-02-05 11:37:46,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-02-05 11:37:46,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:37:46,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:37:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-05 11:37:46,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:37:46,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124669544] [2025-02-05 11:37:46,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124669544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:37:46,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:37:46,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:37:46,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424219003] [2025-02-05 11:37:46,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:37:46,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:37:46,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:37:46,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:37:46,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:37:46,500 INFO L87 Difference]: Start difference. First operand 7514 states and 10701 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 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:37:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:37:48,921 INFO L93 Difference]: Finished difference Result 18030 states and 26024 transitions. [2025-02-05 11:37:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:37:48,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 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 279 [2025-02-05 11:37:48,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:37:48,948 INFO L225 Difference]: With dead ends: 18030 [2025-02-05 11:37:48,948 INFO L226 Difference]: Without dead ends: 11269 [2025-02-05 11:37:48,955 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:37:48,956 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 694 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 782 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 2749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 782 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:37:48,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 422 Invalid, 2749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [782 Valid, 1967 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:37:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11269 states. [2025-02-05 11:37:49,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11269 to 11269. [2025-02-05 11:37:49,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.2212460063897763) internal successors, (13761), 11268 states have internal predecessors, (13761), 0 states have call successors, (0), 0 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:37:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 13761 transitions. [2025-02-05 11:37:49,121 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 13761 transitions. Word has length 279 [2025-02-05 11:37:49,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:37:49,121 INFO L471 AbstractCegarLoop]: Abstraction has 11269 states and 13761 transitions. [2025-02-05 11:37:49,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 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:37:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 13761 transitions. [2025-02-05 11:37:49,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-02-05 11:37:49,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:37:49,130 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:49,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:37:49,130 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:37:49,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:37:49,131 INFO L85 PathProgramCache]: Analyzing trace with hash -440348827, now seen corresponding path program 1 times [2025-02-05 11:37:49,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:37:49,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25024777] [2025-02-05 11:37:49,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:37:49,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:37:49,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-02-05 11:37:49,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-02-05 11:37:49,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:37:49,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:37:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-05 11:37:49,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:37:49,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25024777] [2025-02-05 11:37:49,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25024777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:37:49,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:37:49,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:37:49,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181179331] [2025-02-05 11:37:49,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:37:49,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:37:49,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:37:49,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:37:49,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:37:49,665 INFO L87 Difference]: Start difference. First operand 11269 states and 13761 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 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:37:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:37:52,221 INFO L93 Difference]: Finished difference Result 26291 states and 32977 transitions. [2025-02-05 11:37:52,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:37:52,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 358 [2025-02-05 11:37:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:37:52,259 INFO L225 Difference]: With dead ends: 26291 [2025-02-05 11:37:52,259 INFO L226 Difference]: Without dead ends: 15775 [2025-02-05 11:37:52,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:37:52,270 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 780 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2166 mSolverCounterSat, 840 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 840 IncrementalHoareTripleChecker+Valid, 2166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:37:52,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 105 Invalid, 3006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [840 Valid, 2166 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:37:52,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15775 states. [2025-02-05 11:37:52,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15775 to 15775. [2025-02-05 11:37:52,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.2434385697984025) internal successors, (19614), 15774 states have internal predecessors, (19614), 0 states have call successors, (0), 0 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:37:52,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 19614 transitions. [2025-02-05 11:37:52,664 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 19614 transitions. Word has length 358 [2025-02-05 11:37:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:37:52,665 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 19614 transitions. [2025-02-05 11:37:52,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 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:37:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 19614 transitions. [2025-02-05 11:37:52,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-02-05 11:37:52,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:37:52,672 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:52,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:37:52,672 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:37:52,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:37:52,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1280293969, now seen corresponding path program 1 times [2025-02-05 11:37:52,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:37:52,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439496815] [2025-02-05 11:37:52,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:37:52,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:37:52,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-02-05 11:37:52,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-02-05 11:37:52,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:37:52,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:37:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-05 11:37:52,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:37:52,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439496815] [2025-02-05 11:37:52,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439496815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:37:52,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:37:52,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:37:52,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278413011] [2025-02-05 11:37:52,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:37:52,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:37:52,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:37:52,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:37:52,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:37:52,939 INFO L87 Difference]: Start difference. First operand 15775 states and 19614 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 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:37:55,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:37:55,400 INFO L93 Difference]: Finished difference Result 34552 states and 43511 transitions. [2025-02-05 11:37:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:37:55,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 362 [2025-02-05 11:37:55,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:37:55,503 INFO L225 Difference]: With dead ends: 34552 [2025-02-05 11:37:55,503 INFO L226 Difference]: Without dead ends: 19530 [2025-02-05 11:37:55,517 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:37:55,518 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 761 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 2795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 728 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:37:55,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 235 Invalid, 2795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [728 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:37:55,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2025-02-05 11:37:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 19530. [2025-02-05 11:37:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19530 states, 19529 states have (on average 1.2406165190229914) internal successors, (24228), 19529 states have internal predecessors, (24228), 0 states have call successors, (0), 0 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:37:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19530 states to 19530 states and 24228 transitions. [2025-02-05 11:37:55,729 INFO L78 Accepts]: Start accepts. Automaton has 19530 states and 24228 transitions. Word has length 362 [2025-02-05 11:37:55,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:37:55,729 INFO L471 AbstractCegarLoop]: Abstraction has 19530 states and 24228 transitions. [2025-02-05 11:37:55,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 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:37:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 19530 states and 24228 transitions. [2025-02-05 11:37:55,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-02-05 11:37:55,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:37:55,737 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:55,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:37:55,737 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:37:55,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:37:55,738 INFO L85 PathProgramCache]: Analyzing trace with hash -360268440, now seen corresponding path program 1 times [2025-02-05 11:37:55,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:37:55,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733745726] [2025-02-05 11:37:55,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:37:55,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:37:55,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-02-05 11:37:55,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-02-05 11:37:55,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:37:55,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:37:56,033 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-05 11:37:56,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:37:56,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733745726] [2025-02-05 11:37:56,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733745726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:37:56,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:37:56,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:37:56,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273084217] [2025-02-05 11:37:56,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:37:56,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:37:56,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:37:56,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:37:56,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:37:56,040 INFO L87 Difference]: Start difference. First operand 19530 states and 24228 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 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:37:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:37:58,840 INFO L93 Difference]: Finished difference Result 54829 states and 68728 transitions. [2025-02-05 11:37:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:37:58,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 373 [2025-02-05 11:37:58,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:37:58,881 INFO L225 Difference]: With dead ends: 54829 [2025-02-05 11:37:58,881 INFO L226 Difference]: Without dead ends: 36052 [2025-02-05 11:37:58,901 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:37:58,902 INFO L435 NwaCegarLoop]: 1352 mSDtfsCounter, 726 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 683 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:37:58,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1360 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [683 Valid, 2181 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:37:58,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36052 states. [2025-02-05 11:37:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36052 to 34550. [2025-02-05 11:37:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34550 states, 34549 states have (on average 1.1807288199369013) internal successors, (40793), 34549 states have internal predecessors, (40793), 0 states have call successors, (0), 0 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:37:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34550 states to 34550 states and 40793 transitions. [2025-02-05 11:37:59,423 INFO L78 Accepts]: Start accepts. Automaton has 34550 states and 40793 transitions. Word has length 373 [2025-02-05 11:37:59,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:37:59,424 INFO L471 AbstractCegarLoop]: Abstraction has 34550 states and 40793 transitions. [2025-02-05 11:37:59,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 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:37:59,424 INFO L276 IsEmpty]: Start isEmpty. Operand 34550 states and 40793 transitions. [2025-02-05 11:37:59,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-02-05 11:37:59,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:37:59,450 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, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:59,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:37:59,450 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:37:59,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:37:59,451 INFO L85 PathProgramCache]: Analyzing trace with hash 904242442, now seen corresponding path program 1 times [2025-02-05 11:37:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:37:59,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635636161] [2025-02-05 11:37:59,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:37:59,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:37:59,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-02-05 11:37:59,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-02-05 11:37:59,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:37:59,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-02-05 11:38:00,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:00,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635636161] [2025-02-05 11:38:00,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635636161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:00,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:00,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:00,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387873135] [2025-02-05 11:38:00,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:00,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:00,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:00,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:00,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:00,146 INFO L87 Difference]: Start difference. First operand 34550 states and 40793 transitions. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 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:38:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:03,017 INFO L93 Difference]: Finished difference Result 84869 states and 100273 transitions. [2025-02-05 11:38:03,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:03,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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 462 [2025-02-05 11:38:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:03,081 INFO L225 Difference]: With dead ends: 84869 [2025-02-05 11:38:03,081 INFO L226 Difference]: Without dead ends: 51072 [2025-02-05 11:38:03,107 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:38:03,108 INFO L435 NwaCegarLoop]: 1352 mSDtfsCounter, 635 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2699 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 2699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:03,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1360 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 2699 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:38:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51072 states. [2025-02-05 11:38:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51072 to 49570. [2025-02-05 11:38:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49570 states, 49569 states have (on average 1.170993968004196) internal successors, (58045), 49569 states have internal predecessors, (58045), 0 states have call successors, (0), 0 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:38:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49570 states to 49570 states and 58045 transitions. [2025-02-05 11:38:03,737 INFO L78 Accepts]: Start accepts. Automaton has 49570 states and 58045 transitions. Word has length 462 [2025-02-05 11:38:03,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:03,737 INFO L471 AbstractCegarLoop]: Abstraction has 49570 states and 58045 transitions. [2025-02-05 11:38:03,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 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:38:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 49570 states and 58045 transitions. [2025-02-05 11:38:03,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-02-05 11:38:03,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:03,748 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, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:03,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:38:03,748 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:03,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:03,749 INFO L85 PathProgramCache]: Analyzing trace with hash -989465132, now seen corresponding path program 1 times [2025-02-05 11:38:03,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:03,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131979956] [2025-02-05 11:38:03,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:03,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:03,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-02-05 11:38:03,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-02-05 11:38:03,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:03,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 419 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-02-05 11:38:04,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:04,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131979956] [2025-02-05 11:38:04,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131979956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:04,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:04,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:04,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422849680] [2025-02-05 11:38:04,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:04,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:04,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:04,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:04,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:04,255 INFO L87 Difference]: Start difference. First operand 49570 states and 58045 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:07,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:07,093 INFO L93 Difference]: Finished difference Result 122419 states and 145479 transitions. [2025-02-05 11:38:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:07,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 466 [2025-02-05 11:38:07,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:07,168 INFO L225 Difference]: With dead ends: 122419 [2025-02-05 11:38:07,168 INFO L226 Difference]: Without dead ends: 69847 [2025-02-05 11:38:07,203 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:38:07,204 INFO L435 NwaCegarLoop]: 1258 mSDtfsCounter, 711 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 2806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:07,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1266 Invalid, 2806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:38:07,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69847 states. [2025-02-05 11:38:07,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69847 to 62337. [2025-02-05 11:38:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62337 states, 62336 states have (on average 1.1526244866529773) internal successors, (71850), 62336 states have internal predecessors, (71850), 0 states have call successors, (0), 0 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:38:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62337 states to 62337 states and 71850 transitions. [2025-02-05 11:38:08,117 INFO L78 Accepts]: Start accepts. Automaton has 62337 states and 71850 transitions. Word has length 466 [2025-02-05 11:38:08,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:08,119 INFO L471 AbstractCegarLoop]: Abstraction has 62337 states and 71850 transitions. [2025-02-05 11:38:08,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:08,119 INFO L276 IsEmpty]: Start isEmpty. Operand 62337 states and 71850 transitions. [2025-02-05 11:38:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-02-05 11:38:08,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:08,161 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:38:08,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:38:08,162 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:08,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:08,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1173232233, now seen corresponding path program 1 times [2025-02-05 11:38:08,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:08,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083966903] [2025-02-05 11:38:08,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:08,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:08,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-02-05 11:38:08,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-02-05 11:38:08,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:08,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 626 proven. 14 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 11:38:09,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:09,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083966903] [2025-02-05 11:38:09,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083966903] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:38:09,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341987237] [2025-02-05 11:38:09,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:09,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:38:09,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:38:09,544 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:38:09,547 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:38:09,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-02-05 11:38:09,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-02-05 11:38:09,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:09,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:09,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:38:09,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:38:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 457 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-02-05 11:38:09,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:38:09,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341987237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:09,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:38:09,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:38:09,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287608521] [2025-02-05 11:38:09,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:09,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:09,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:09,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:09,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:38:09,898 INFO L87 Difference]: Start difference. First operand 62337 states and 71850 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 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:38:12,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:12,296 INFO L93 Difference]: Finished difference Result 123921 states and 142942 transitions. [2025-02-05 11:38:12,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:12,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 532 [2025-02-05 11:38:12,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:12,357 INFO L225 Difference]: With dead ends: 123921 [2025-02-05 11:38:12,357 INFO L226 Difference]: Without dead ends: 62337 [2025-02-05 11:38:12,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:38:12,567 INFO L435 NwaCegarLoop]: 1294 mSDtfsCounter, 685 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:12,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1302 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:38:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62337 states. [2025-02-05 11:38:12,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62337 to 60084. [2025-02-05 11:38:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60084 states, 60083 states have (on average 1.1125110264134614) internal successors, (66843), 60083 states have internal predecessors, (66843), 0 states have call successors, (0), 0 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:38:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60084 states to 60084 states and 66843 transitions. [2025-02-05 11:38:13,042 INFO L78 Accepts]: Start accepts. Automaton has 60084 states and 66843 transitions. Word has length 532 [2025-02-05 11:38:13,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:13,043 INFO L471 AbstractCegarLoop]: Abstraction has 60084 states and 66843 transitions. [2025-02-05 11:38:13,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 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:38:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 60084 states and 66843 transitions. [2025-02-05 11:38:13,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-02-05 11:38:13,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:13,054 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:38:13,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 11:38:13,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:38:13,255 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:13,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:13,255 INFO L85 PathProgramCache]: Analyzing trace with hash -59049733, now seen corresponding path program 1 times [2025-02-05 11:38:13,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:13,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780495915] [2025-02-05 11:38:13,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:13,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:13,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-02-05 11:38:13,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-02-05 11:38:13,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:13,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 128 proven. 14 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2025-02-05 11:38:13,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:13,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780495915] [2025-02-05 11:38:13,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780495915] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:38:13,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567118504] [2025-02-05 11:38:13,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:13,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:38:13,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:38:13,859 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:38:13,862 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:38:13,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-02-05 11:38:14,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-02-05 11:38:14,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:14,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:14,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:38:14,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:38:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-02-05 11:38:14,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:38:14,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567118504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:14,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:38:14,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-02-05 11:38:14,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179083486] [2025-02-05 11:38:14,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:14,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:14,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:14,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:14,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:38:14,502 INFO L87 Difference]: Start difference. First operand 60084 states and 66843 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 2 states have internal predecessors, (329), 0 states have call successors, (0), 0 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:38:17,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:17,038 INFO L93 Difference]: Finished difference Result 119415 states and 132928 transitions. [2025-02-05 11:38:17,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:17,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 2 states have internal predecessors, (329), 0 states have call successors, (0), 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 546 [2025-02-05 11:38:17,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:17,108 INFO L225 Difference]: With dead ends: 119415 [2025-02-05 11:38:17,108 INFO L226 Difference]: Without dead ends: 60084 [2025-02-05 11:38:17,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 545 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:38:17,144 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 534 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2202 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 2688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 2202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:17,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 403 Invalid, 2688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 2202 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:38:17,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60084 states. [2025-02-05 11:38:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60084 to 58582. [2025-02-05 11:38:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58582 states, 58581 states have (on average 1.0728393165019374) internal successors, (62848), 58581 states have internal predecessors, (62848), 0 states have call successors, (0), 0 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:38:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58582 states to 58582 states and 62848 transitions. [2025-02-05 11:38:17,718 INFO L78 Accepts]: Start accepts. Automaton has 58582 states and 62848 transitions. Word has length 546 [2025-02-05 11:38:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:17,719 INFO L471 AbstractCegarLoop]: Abstraction has 58582 states and 62848 transitions. [2025-02-05 11:38:17,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 2 states have internal predecessors, (329), 0 states have call successors, (0), 0 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:38:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 58582 states and 62848 transitions. [2025-02-05 11:38:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2025-02-05 11:38:17,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:17,736 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:17,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 11:38:17,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:38:17,936 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:17,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:17,937 INFO L85 PathProgramCache]: Analyzing trace with hash 823964188, now seen corresponding path program 1 times [2025-02-05 11:38:17,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:17,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640877826] [2025-02-05 11:38:17,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:17,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:17,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes. [2025-02-05 11:38:18,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements. [2025-02-05 11:38:18,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:18,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:18,694 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2025-02-05 11:38:18,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:18,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640877826] [2025-02-05 11:38:18,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640877826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:18,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:18,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:18,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075498540] [2025-02-05 11:38:18,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:18,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:38:18,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:18,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:38:18,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:38:18,698 INFO L87 Difference]: Start difference. First operand 58582 states and 62848 transitions. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 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:38:23,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:23,078 INFO L93 Difference]: Finished difference Result 176491 states and 190477 transitions. [2025-02-05 11:38:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:38:23,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 613 [2025-02-05 11:38:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:23,228 INFO L225 Difference]: With dead ends: 176491 [2025-02-05 11:38:23,228 INFO L226 Difference]: Without dead ends: 118662 [2025-02-05 11:38:23,278 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:38:23,278 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 1611 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4981 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 5503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 4981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:23,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1611 Valid, 57 Invalid, 5503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 4981 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-05 11:38:23,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118662 states. [2025-02-05 11:38:24,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118662 to 117911. [2025-02-05 11:38:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117911 states, 117910 states have (on average 1.076142820795522) internal successors, (126888), 117910 states have internal predecessors, (126888), 0 states have call successors, (0), 0 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:38:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117911 states to 117911 states and 126888 transitions. [2025-02-05 11:38:24,605 INFO L78 Accepts]: Start accepts. Automaton has 117911 states and 126888 transitions. Word has length 613 [2025-02-05 11:38:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:24,606 INFO L471 AbstractCegarLoop]: Abstraction has 117911 states and 126888 transitions. [2025-02-05 11:38:24,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 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:38:24,606 INFO L276 IsEmpty]: Start isEmpty. Operand 117911 states and 126888 transitions. [2025-02-05 11:38:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2025-02-05 11:38:24,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:24,626 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:38:24,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:38:24,626 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:24,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash 178462051, now seen corresponding path program 1 times [2025-02-05 11:38:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:24,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853394110] [2025-02-05 11:38:24,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:24,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:24,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 620 statements into 1 equivalence classes. [2025-02-05 11:38:24,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 620 of 620 statements. [2025-02-05 11:38:24,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:24,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 568 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-02-05 11:38:24,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:24,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853394110] [2025-02-05 11:38:24,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853394110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:24,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:24,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:24,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183969589] [2025-02-05 11:38:24,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:24,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:24,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:24,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:24,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:24,863 INFO L87 Difference]: Start difference. First operand 117911 states and 126888 transitions. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 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:38:28,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:28,278 INFO L93 Difference]: Finished difference Result 241077 states and 259192 transitions. [2025-02-05 11:38:28,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:28,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 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 620 [2025-02-05 11:38:28,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:28,420 INFO L225 Difference]: With dead ends: 241077 [2025-02-05 11:38:28,420 INFO L226 Difference]: Without dead ends: 123919 [2025-02-05 11:38:28,463 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:38:28,463 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 735 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 665 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 665 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:28,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 186 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [665 Valid, 2251 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:38:28,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123919 states. [2025-02-05 11:38:29,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123919 to 117911. [2025-02-05 11:38:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117911 states, 117910 states have (on average 1.071232295818845) internal successors, (126309), 117910 states have internal predecessors, (126309), 0 states have call successors, (0), 0 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:38:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117911 states to 117911 states and 126309 transitions. [2025-02-05 11:38:29,671 INFO L78 Accepts]: Start accepts. Automaton has 117911 states and 126309 transitions. Word has length 620 [2025-02-05 11:38:29,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:29,672 INFO L471 AbstractCegarLoop]: Abstraction has 117911 states and 126309 transitions. [2025-02-05 11:38:29,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 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:38:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 117911 states and 126309 transitions. [2025-02-05 11:38:29,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-02-05 11:38:29,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:29,690 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, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-05 11:38:29,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:38:29,690 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:29,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:29,691 INFO L85 PathProgramCache]: Analyzing trace with hash -365608488, now seen corresponding path program 1 times [2025-02-05 11:38:29,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:29,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131933115] [2025-02-05 11:38:29,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:29,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:29,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-02-05 11:38:29,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-02-05 11:38:29,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:29,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-02-05 11:38:30,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:30,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131933115] [2025-02-05 11:38:30,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131933115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:30,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:30,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:30,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696989530] [2025-02-05 11:38:30,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:30,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:30,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:30,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:30,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:30,097 INFO L87 Difference]: Start difference. First operand 117911 states and 126309 transitions. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:33,301 INFO L93 Difference]: Finished difference Result 312422 states and 334578 transitions. [2025-02-05 11:38:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:33,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 658 [2025-02-05 11:38:33,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:33,733 INFO L225 Difference]: With dead ends: 312422 [2025-02-05 11:38:33,733 INFO L226 Difference]: Without dead ends: 195264 [2025-02-05 11:38:33,785 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:38:33,786 INFO L435 NwaCegarLoop]: 1275 mSDtfsCounter, 483 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2316 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 2316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:33,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1283 Invalid, 2803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 2316 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:38:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195264 states.