./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label15.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/Problem13_label15.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 9fbc20983083f465b3eede57a226cc56a0e48515578e64c31c2db7f869f449ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:51:35,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:51:35,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:51:35,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:51:35,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:51:35,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:51:35,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:51:35,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:51:35,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:51:35,598 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:51:35,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:51:35,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:51:35,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:51:35,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:51:35,599 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:51:35,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:51:35,600 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:51:35,600 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:51:35,600 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:51:35,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:51:35,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:51:35,600 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:51:35,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:51:35,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:51:35,600 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:51:35,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:51:35,600 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:51:35,601 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:51:35,601 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:51:35,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:51:35,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:51:35,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:51:35,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:51:35,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:51:35,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:51:35,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:51:35,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:51:35,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:51:35,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:51:35,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:51:35,602 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:51:35,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:51:35,603 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:51:35,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:51:35,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:51:35,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:51:35,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:51:35,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:51:35,603 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 -> 9fbc20983083f465b3eede57a226cc56a0e48515578e64c31c2db7f869f449ac [2025-01-08 23:51:35,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:51:35,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:51:35,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:51:35,845 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:51:35,845 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:51:35,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label15.c [2025-01-08 23:51:36,976 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/640c2cb53/4cfc3c12ab584d5091aa2cb8f1c287a2/FLAG89f3264dd [2025-01-08 23:51:37,397 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:51:37,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label15.c [2025-01-08 23:51:37,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/640c2cb53/4cfc3c12ab584d5091aa2cb8f1c287a2/FLAG89f3264dd [2025-01-08 23:51:37,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/640c2cb53/4cfc3c12ab584d5091aa2cb8f1c287a2 [2025-01-08 23:51:37,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:51:37,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:51:37,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:51:37,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:51:37,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:51:37,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:51:37" (1/1) ... [2025-01-08 23:51:37,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1c6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:37, skipping insertion in model container [2025-01-08 23:51:37,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:51:37" (1/1) ... [2025-01-08 23:51:37,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:51:37,836 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/Problem13_label15.c[5297,5310] [2025-01-08 23:51:38,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:51:38,309 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:51:38,326 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/Problem13_label15.c[5297,5310] [2025-01-08 23:51:38,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:51:38,632 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:51:38,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:38 WrapperNode [2025-01-08 23:51:38,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:51:38,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:51:38,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:51:38,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:51:38,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:38" (1/1) ... [2025-01-08 23:51:38,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:38" (1/1) ... [2025-01-08 23:51:39,045 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-01-08 23:51:39,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:51:39,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:51:39,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:51:39,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:51:39,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:38" (1/1) ... [2025-01-08 23:51:39,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:38" (1/1) ... [2025-01-08 23:51:39,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:38" (1/1) ... [2025-01-08 23:51:39,261 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-01-08 23:51:39,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:38" (1/1) ... [2025-01-08 23:51:39,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:38" (1/1) ... [2025-01-08 23:51:39,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:38" (1/1) ... [2025-01-08 23:51:39,403 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:38" (1/1) ... [2025-01-08 23:51:39,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:38" (1/1) ... [2025-01-08 23:51:39,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:38" (1/1) ... [2025-01-08 23:51:39,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:38" (1/1) ... [2025-01-08 23:51:39,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:51:39,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:51:39,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:51:39,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:51:39,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:38" (1/1) ... [2025-01-08 23:51:39,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:51:39,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:51:39,641 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-01-08 23:51:39,644 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-01-08 23:51:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:51:39,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:51:39,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:51:39,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:51:39,717 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:51:39,719 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:51:43,671 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-01-08 23:51:43,672 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:51:43,699 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:51:43,702 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:51:43,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:51:43 BoogieIcfgContainer [2025-01-08 23:51:43,703 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:51:43,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:51:43,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:51:43,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:51:43,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:51:37" (1/3) ... [2025-01-08 23:51:43,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731daa27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:51:43, skipping insertion in model container [2025-01-08 23:51:43,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:38" (2/3) ... [2025-01-08 23:51:43,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731daa27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:51:43, skipping insertion in model container [2025-01-08 23:51:43,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:51:43" (3/3) ... [2025-01-08 23:51:43,711 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label15.c [2025-01-08 23:51:43,723 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:51:43,728 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label15.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:51:43,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:51:43,836 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;@83f9b69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:51:43,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:51:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-08 23:51:43,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:43,851 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] [2025-01-08 23:51:43,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:43,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:43,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1973461954, now seen corresponding path program 1 times [2025-01-08 23:51:43,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:43,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036385837] [2025-01-08 23:51:43,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:43,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:43,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-08 23:51:43,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-08 23:51:43,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:43,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:44,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:44,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:44,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036385837] [2025-01-08 23:51:44,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036385837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:44,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:44,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:44,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651784433] [2025-01-08 23:51:44,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:44,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:44,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:44,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:44,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:44,239 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:48,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:48,318 INFO L93 Difference]: Finished difference Result 3160 states and 5840 transitions. [2025-01-08 23:51:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:48,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-08 23:51:48,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:48,349 INFO L225 Difference]: With dead ends: 3160 [2025-01-08 23:51:48,350 INFO L226 Difference]: Without dead ends: 1983 [2025-01-08 23:51:48,355 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-01-08 23:51:48,358 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 1067 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3030 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 4004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 3030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:48,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1067 Valid, 345 Invalid, 4004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [974 Valid, 3030 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-08 23:51:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2025-01-08 23:51:48,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1930. [2025-01-08 23:51:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 1.7973043027475375) internal successors, (3467), 1929 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 3467 transitions. [2025-01-08 23:51:48,456 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 3467 transitions. Word has length 36 [2025-01-08 23:51:48,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:48,456 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 3467 transitions. [2025-01-08 23:51:48,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:48,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3467 transitions. [2025-01-08 23:51:48,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-08 23:51:48,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:48,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:51:48,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:51:48,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:48,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:48,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1493946277, now seen corresponding path program 1 times [2025-01-08 23:51:48,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:48,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461804957] [2025-01-08 23:51:48,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:48,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:48,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-08 23:51:48,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-08 23:51:48,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:48,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:48,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:48,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461804957] [2025-01-08 23:51:48,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461804957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:48,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:48,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:48,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89030286] [2025-01-08 23:51:48,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:48,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:48,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:48,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:48,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:48,662 INFO L87 Difference]: Start difference. First operand 1930 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:51,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:51,293 INFO L93 Difference]: Finished difference Result 5456 states and 9917 transitions. [2025-01-08 23:51:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:51,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-01-08 23:51:51,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:51,304 INFO L225 Difference]: With dead ends: 5456 [2025-01-08 23:51:51,305 INFO L226 Difference]: Without dead ends: 3528 [2025-01-08 23:51:51,307 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-01-08 23:51:51,307 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 923 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:51,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1010 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:51:51,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2025-01-08 23:51:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3526. [2025-01-08 23:51:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 3525 states have (on average 1.5670921985815602) internal successors, (5524), 3525 states have internal predecessors, (5524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5524 transitions. [2025-01-08 23:51:51,367 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5524 transitions. Word has length 101 [2025-01-08 23:51:51,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:51,368 INFO L471 AbstractCegarLoop]: Abstraction has 3526 states and 5524 transitions. [2025-01-08 23:51:51,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5524 transitions. [2025-01-08 23:51:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-08 23:51:51,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:51,372 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:51:51,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:51:51,373 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:51,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:51,373 INFO L85 PathProgramCache]: Analyzing trace with hash 312763286, now seen corresponding path program 1 times [2025-01-08 23:51:51,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:51,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686467642] [2025-01-08 23:51:51,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:51,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:51,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-08 23:51:51,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-08 23:51:51,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:51,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:51,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:51,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686467642] [2025-01-08 23:51:51,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686467642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:51,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:51,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:51,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894296080] [2025-01-08 23:51:51,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:51,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:51,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:51,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:51,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:51,490 INFO L87 Difference]: Start difference. First operand 3526 states and 5524 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:54,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:54,312 INFO L93 Difference]: Finished difference Result 10232 states and 16097 transitions. [2025-01-08 23:51:54,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:54,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-01-08 23:51:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:54,333 INFO L225 Difference]: With dead ends: 10232 [2025-01-08 23:51:54,333 INFO L226 Difference]: Without dead ends: 6708 [2025-01-08 23:51:54,338 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-01-08 23:51:54,341 INFO L435 NwaCegarLoop]: 1005 mSDtfsCounter, 869 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2634 mSolverCounterSat, 724 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 3358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 724 IncrementalHoareTripleChecker+Valid, 2634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:54,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1138 Invalid, 3358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [724 Valid, 2634 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:51:54,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6708 states. [2025-01-08 23:51:54,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6708 to 6700. [2025-01-08 23:51:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6700 states, 6699 states have (on average 1.413046723391551) internal successors, (9466), 6699 states have internal predecessors, (9466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6700 states to 6700 states and 9466 transitions. [2025-01-08 23:51:54,432 INFO L78 Accepts]: Start accepts. Automaton has 6700 states and 9466 transitions. Word has length 107 [2025-01-08 23:51:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:54,432 INFO L471 AbstractCegarLoop]: Abstraction has 6700 states and 9466 transitions. [2025-01-08 23:51:54,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:54,433 INFO L276 IsEmpty]: Start isEmpty. Operand 6700 states and 9466 transitions. [2025-01-08 23:51:54,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-08 23:51:54,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:54,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:51:54,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:51:54,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:54,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:54,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2014396235, now seen corresponding path program 1 times [2025-01-08 23:51:54,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:54,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216588724] [2025-01-08 23:51:54,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:54,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:54,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-08 23:51:54,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-08 23:51:54,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:54,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:54,582 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:54,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:54,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216588724] [2025-01-08 23:51:54,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216588724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:54,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:54,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:54,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879240854] [2025-01-08 23:51:54,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:54,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:54,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:54,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:54,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:54,585 INFO L87 Difference]: Start difference. First operand 6700 states and 9466 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:57,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:57,908 INFO L93 Difference]: Finished difference Result 17443 states and 24479 transitions. [2025-01-08 23:51:57,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:57,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-01-08 23:51:57,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:57,933 INFO L225 Difference]: With dead ends: 17443 [2025-01-08 23:51:57,934 INFO L226 Difference]: Without dead ends: 10745 [2025-01-08 23:51:57,940 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-01-08 23:51:57,942 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 851 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 3121 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 3613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 3121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:57,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 686 Invalid, 3613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 3121 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-08 23:51:57,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10745 states. [2025-01-08 23:51:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10745 to 10669. [2025-01-08 23:51:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3562992125984252) internal successors, (14469), 10668 states have internal predecessors, (14469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14469 transitions. [2025-01-08 23:51:58,106 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14469 transitions. Word has length 137 [2025-01-08 23:51:58,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:58,107 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14469 transitions. [2025-01-08 23:51:58,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:58,107 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14469 transitions. [2025-01-08 23:51:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-08 23:51:58,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:58,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:51:58,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:51:58,110 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:58,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:58,111 INFO L85 PathProgramCache]: Analyzing trace with hash 941116082, now seen corresponding path program 1 times [2025-01-08 23:51:58,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:58,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318192414] [2025-01-08 23:51:58,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:58,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:58,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-08 23:51:58,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-08 23:51:58,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:58,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:58,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:58,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318192414] [2025-01-08 23:51:58,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318192414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:58,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:58,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:58,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644146088] [2025-01-08 23:51:58,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:58,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:58,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:58,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:58,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:58,421 INFO L87 Difference]: Start difference. First operand 10669 states and 14469 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:00,551 INFO L93 Difference]: Finished difference Result 20549 states and 28119 transitions. [2025-01-08 23:52:00,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:00,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2025-01-08 23:52:00,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:00,573 INFO L225 Difference]: With dead ends: 20549 [2025-01-08 23:52:00,573 INFO L226 Difference]: Without dead ends: 10669 [2025-01-08 23:52:00,581 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-01-08 23:52:00,582 INFO L435 NwaCegarLoop]: 1083 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:00,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1212 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-08 23:52:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10669 states. [2025-01-08 23:52:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10669 to 10669. [2025-01-08 23:52:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3539557555305586) internal successors, (14444), 10668 states have internal predecessors, (14444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14444 transitions. [2025-01-08 23:52:00,704 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14444 transitions. Word has length 147 [2025-01-08 23:52:00,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:00,704 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14444 transitions. [2025-01-08 23:52:00,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:00,705 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14444 transitions. [2025-01-08 23:52:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-08 23:52:00,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:00,706 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:52:00,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:52:00,707 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:00,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:00,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1256793576, now seen corresponding path program 1 times [2025-01-08 23:52:00,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:00,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751485666] [2025-01-08 23:52:00,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:00,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:00,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-08 23:52:00,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-08 23:52:00,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:00,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:52:01,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:01,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751485666] [2025-01-08 23:52:01,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751485666] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:52:01,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478212587] [2025-01-08 23:52:01,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:01,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:01,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:52:01,258 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-01-08 23:52:01,260 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-01-08 23:52:01,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-08 23:52:01,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-08 23:52:01,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:01,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:01,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:52:01,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:52:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-08 23:52:01,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:52:01,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478212587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:01,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:52:01,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-08 23:52:01,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114651446] [2025-01-08 23:52:01,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:01,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:01,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:01,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:01,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:52:01,496 INFO L87 Difference]: Start difference. First operand 10669 states and 14444 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:04,279 INFO L93 Difference]: Finished difference Result 30031 states and 41217 transitions. [2025-01-08 23:52:04,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:04,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 161 [2025-01-08 23:52:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:04,311 INFO L225 Difference]: With dead ends: 30031 [2025-01-08 23:52:04,311 INFO L226 Difference]: Without dead ends: 20151 [2025-01-08 23:52:04,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:52:04,322 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 751 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 783 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 3274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 783 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:04,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1163 Invalid, 3274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [783 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:52:04,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20151 states. [2025-01-08 23:52:04,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20151 to 19337. [2025-01-08 23:52:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19337 states, 19336 states have (on average 1.24244931733554) internal successors, (24024), 19336 states have internal predecessors, (24024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19337 states to 19337 states and 24024 transitions. [2025-01-08 23:52:04,482 INFO L78 Accepts]: Start accepts. Automaton has 19337 states and 24024 transitions. Word has length 161 [2025-01-08 23:52:04,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:04,482 INFO L471 AbstractCegarLoop]: Abstraction has 19337 states and 24024 transitions. [2025-01-08 23:52:04,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 19337 states and 24024 transitions. [2025-01-08 23:52:04,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-01-08 23:52:04,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:04,485 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:52:04,491 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-01-08 23:52:04,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:04,686 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:04,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:04,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2050715161, now seen corresponding path program 1 times [2025-01-08 23:52:04,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:04,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418934924] [2025-01-08 23:52:04,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:04,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:04,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-01-08 23:52:04,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-01-08 23:52:04,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:04,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:05,169 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 137 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:52:05,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:05,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418934924] [2025-01-08 23:52:05,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418934924] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:52:05,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50551698] [2025-01-08 23:52:05,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:05,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:05,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:52:05,172 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-01-08 23:52:05,173 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-01-08 23:52:05,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-01-08 23:52:05,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-01-08 23:52:05,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:05,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:05,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:52:05,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:52:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:52:05,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:52:05,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50551698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:05,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:52:05,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:52:05,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390403254] [2025-01-08 23:52:05,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:05,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:05,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:05,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:05,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:52:05,585 INFO L87 Difference]: Start difference. First operand 19337 states and 24024 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:08,845 INFO L93 Difference]: Finished difference Result 55202 states and 69089 transitions. [2025-01-08 23:52:08,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:08,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 248 [2025-01-08 23:52:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:08,967 INFO L225 Difference]: With dead ends: 55202 [2025-01-08 23:52:08,968 INFO L226 Difference]: Without dead ends: 36654 [2025-01-08 23:52:08,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:52:09,003 INFO L435 NwaCegarLoop]: 1012 mSDtfsCounter, 727 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 2502 mSolverCounterSat, 765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 3267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 765 IncrementalHoareTripleChecker+Valid, 2502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:09,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1185 Invalid, 3267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [765 Valid, 2502 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:52:09,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36654 states. [2025-01-08 23:52:09,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36654 to 35867. [2025-01-08 23:52:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35867 states, 35866 states have (on average 1.1654770534768304) internal successors, (41801), 35866 states have internal predecessors, (41801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35867 states to 35867 states and 41801 transitions. [2025-01-08 23:52:09,398 INFO L78 Accepts]: Start accepts. Automaton has 35867 states and 41801 transitions. Word has length 248 [2025-01-08 23:52:09,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:09,398 INFO L471 AbstractCegarLoop]: Abstraction has 35867 states and 41801 transitions. [2025-01-08 23:52:09,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:09,398 INFO L276 IsEmpty]: Start isEmpty. Operand 35867 states and 41801 transitions. [2025-01-08 23:52:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-01-08 23:52:09,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:09,401 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:52:09,407 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-01-08 23:52:09,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:09,602 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:09,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:09,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2089124530, now seen corresponding path program 1 times [2025-01-08 23:52:09,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:09,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505571567] [2025-01-08 23:52:09,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:09,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:09,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-08 23:52:09,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-08 23:52:09,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:09,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:52:09,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:09,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505571567] [2025-01-08 23:52:09,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505571567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:09,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:09,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:09,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375996118] [2025-01-08 23:52:09,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:09,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:09,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:09,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:09,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:09,804 INFO L87 Difference]: Start difference. First operand 35867 states and 41801 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:12,371 INFO L93 Difference]: Finished difference Result 89849 states and 106398 transitions. [2025-01-08 23:52:12,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:12,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 263 [2025-01-08 23:52:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:12,434 INFO L225 Difference]: With dead ends: 89849 [2025-01-08 23:52:12,434 INFO L226 Difference]: Without dead ends: 54771 [2025-01-08 23:52:12,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-01-08 23:52:12,464 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 830 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 908 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 3297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 908 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:12,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 950 Invalid, 3297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [908 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:52:12,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54771 states. [2025-01-08 23:52:12,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54771 to 53186. [2025-01-08 23:52:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53186 states, 53185 states have (on average 1.1506063739776253) internal successors, (61195), 53185 states have internal predecessors, (61195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53186 states to 53186 states and 61195 transitions. [2025-01-08 23:52:12,936 INFO L78 Accepts]: Start accepts. Automaton has 53186 states and 61195 transitions. Word has length 263 [2025-01-08 23:52:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:12,937 INFO L471 AbstractCegarLoop]: Abstraction has 53186 states and 61195 transitions. [2025-01-08 23:52:12,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 53186 states and 61195 transitions. [2025-01-08 23:52:12,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-08 23:52:12,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:12,941 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:12,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:52:12,941 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:12,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:12,942 INFO L85 PathProgramCache]: Analyzing trace with hash -660919684, now seen corresponding path program 1 times [2025-01-08 23:52:12,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:12,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074698931] [2025-01-08 23:52:12,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:12,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:12,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-08 23:52:12,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-08 23:52:12,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:12,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 23:52:13,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:13,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074698931] [2025-01-08 23:52:13,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074698931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:13,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:13,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:13,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95998074] [2025-01-08 23:52:13,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:13,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:52:13,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:13,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:52:13,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:52:13,198 INFO L87 Difference]: Start difference. First operand 53186 states and 61195 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:18,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:18,189 INFO L93 Difference]: Finished difference Result 145164 states and 168684 transitions. [2025-01-08 23:52:18,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:52:18,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 324 [2025-01-08 23:52:18,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:18,295 INFO L225 Difference]: With dead ends: 145164 [2025-01-08 23:52:18,295 INFO L226 Difference]: Without dead ends: 92767 [2025-01-08 23:52:18,336 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-01-08 23:52:18,338 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 1716 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 6349 mSolverCounterSat, 1049 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 7398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1049 IncrementalHoareTripleChecker+Valid, 6349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:18,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1716 Valid, 1027 Invalid, 7398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1049 Valid, 6349 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-01-08 23:52:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92767 states. [2025-01-08 23:52:19,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92767 to 69731. [2025-01-08 23:52:19,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69731 states, 69730 states have (on average 1.1356374587695397) internal successors, (79188), 69730 states have internal predecessors, (79188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69731 states to 69731 states and 79188 transitions. [2025-01-08 23:52:19,122 INFO L78 Accepts]: Start accepts. Automaton has 69731 states and 79188 transitions. Word has length 324 [2025-01-08 23:52:19,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:19,122 INFO L471 AbstractCegarLoop]: Abstraction has 69731 states and 79188 transitions. [2025-01-08 23:52:19,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 69731 states and 79188 transitions. [2025-01-08 23:52:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-08 23:52:19,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:19,127 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:19,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:52:19,127 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:19,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1678487461, now seen corresponding path program 1 times [2025-01-08 23:52:19,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:19,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853088807] [2025-01-08 23:52:19,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:19,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:19,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-08 23:52:19,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-08 23:52:19,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:19,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:19,921 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 196 proven. 113 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 23:52:19,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:19,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853088807] [2025-01-08 23:52:19,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853088807] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:52:19,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242350392] [2025-01-08 23:52:19,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:19,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:19,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:52:19,924 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-01-08 23:52:19,925 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-01-08 23:52:19,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-08 23:52:20,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-08 23:52:20,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:20,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:20,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:52:20,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:52:20,090 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-08 23:52:20,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:52:20,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242350392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:20,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:52:20,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-01-08 23:52:20,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768338528] [2025-01-08 23:52:20,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:20,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:20,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:20,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:20,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:52:20,092 INFO L87 Difference]: Start difference. First operand 69731 states and 79188 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:23,217 INFO L93 Difference]: Finished difference Result 191586 states and 218803 transitions. [2025-01-08 23:52:23,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:23,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 342 [2025-01-08 23:52:23,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:23,359 INFO L225 Difference]: With dead ends: 191586 [2025-01-08 23:52:23,359 INFO L226 Difference]: Without dead ends: 122644 [2025-01-08 23:52:23,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:52:23,412 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 1075 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 538 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 3173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 538 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:23,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 925 Invalid, 3173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [538 Valid, 2635 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:52:23,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122644 states. [2025-01-08 23:52:24,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122644 to 122615. [2025-01-08 23:52:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122615 states, 122614 states have (on average 1.1194724909064218) internal successors, (137263), 122614 states have internal predecessors, (137263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122615 states to 122615 states and 137263 transitions. [2025-01-08 23:52:25,120 INFO L78 Accepts]: Start accepts. Automaton has 122615 states and 137263 transitions. Word has length 342 [2025-01-08 23:52:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:25,121 INFO L471 AbstractCegarLoop]: Abstraction has 122615 states and 137263 transitions. [2025-01-08 23:52:25,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 122615 states and 137263 transitions. [2025-01-08 23:52:25,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-01-08 23:52:25,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:25,126 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:25,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 23:52:25,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:25,326 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:25,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:25,328 INFO L85 PathProgramCache]: Analyzing trace with hash -412180558, now seen corresponding path program 1 times [2025-01-08 23:52:25,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:25,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862875950] [2025-01-08 23:52:25,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:25,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:25,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-01-08 23:52:25,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-01-08 23:52:25,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:25,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 23:52:25,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:25,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862875950] [2025-01-08 23:52:25,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862875950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:25,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:25,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:25,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351904019] [2025-01-08 23:52:25,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:25,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:25,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:25,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:25,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:25,549 INFO L87 Difference]: Start difference. First operand 122615 states and 137263 transitions. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:28,871 INFO L93 Difference]: Finished difference Result 237174 states and 265863 transitions. [2025-01-08 23:52:28,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:28,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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 381 [2025-01-08 23:52:28,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:29,000 INFO L225 Difference]: With dead ends: 237174 [2025-01-08 23:52:29,000 INFO L226 Difference]: Without dead ends: 105895 [2025-01-08 23:52:29,055 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-01-08 23:52:29,057 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 1036 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:29,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1641 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:52:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105895 states. [2025-01-08 23:52:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105895 to 98802. [2025-01-08 23:52:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98802 states, 98801 states have (on average 1.0907177052863837) internal successors, (107764), 98801 states have internal predecessors, (107764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98802 states to 98802 states and 107764 transitions. [2025-01-08 23:52:30,118 INFO L78 Accepts]: Start accepts. Automaton has 98802 states and 107764 transitions. Word has length 381 [2025-01-08 23:52:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:30,118 INFO L471 AbstractCegarLoop]: Abstraction has 98802 states and 107764 transitions. [2025-01-08 23:52:30,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 98802 states and 107764 transitions. [2025-01-08 23:52:30,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-01-08 23:52:30,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:30,124 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:30,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:52:30,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:30,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:30,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1247315868, now seen corresponding path program 1 times [2025-01-08 23:52:30,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:30,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558683373] [2025-01-08 23:52:30,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:30,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:30,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-01-08 23:52:30,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-01-08 23:52:30,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:30,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 293 proven. 110 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 23:52:31,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:31,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558683373] [2025-01-08 23:52:31,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558683373] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:52:31,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048632776] [2025-01-08 23:52:31,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:31,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:31,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:52:31,020 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:52:31,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 23:52:31,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-01-08 23:52:31,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-01-08 23:52:31,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:31,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:31,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:52:31,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:52:31,250 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-08 23:52:31,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:52:31,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048632776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:31,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:52:31,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:52:31,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872907508] [2025-01-08 23:52:31,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:31,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:31,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:31,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:31,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:52:31,253 INFO L87 Difference]: Start difference. First operand 98802 states and 107764 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:33,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:33,641 INFO L93 Difference]: Finished difference Result 196813 states and 214733 transitions. [2025-01-08 23:52:33,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:33,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 391 [2025-01-08 23:52:33,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:33,764 INFO L225 Difference]: With dead ends: 196813 [2025-01-08 23:52:33,765 INFO L226 Difference]: Without dead ends: 98800 [2025-01-08 23:52:33,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:52:33,828 INFO L435 NwaCegarLoop]: 1326 mSDtfsCounter, 1081 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 2825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:33,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 1403 Invalid, 2825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-08 23:52:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98800 states. [2025-01-08 23:52:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98800 to 98012. [2025-01-08 23:52:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98012 states, 98011 states have (on average 1.071767454673455) internal successors, (105045), 98011 states have internal predecessors, (105045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98012 states to 98012 states and 105045 transitions. [2025-01-08 23:52:35,066 INFO L78 Accepts]: Start accepts. Automaton has 98012 states and 105045 transitions. Word has length 391 [2025-01-08 23:52:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:35,066 INFO L471 AbstractCegarLoop]: Abstraction has 98012 states and 105045 transitions. [2025-01-08 23:52:35,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 98012 states and 105045 transitions. [2025-01-08 23:52:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-08 23:52:35,069 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:35,070 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:35,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 23:52:35,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-08 23:52:35,270 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:35,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:35,271 INFO L85 PathProgramCache]: Analyzing trace with hash -370058585, now seen corresponding path program 1 times [2025-01-08 23:52:35,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:35,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751995724] [2025-01-08 23:52:35,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:35,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:35,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-08 23:52:35,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-08 23:52:35,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:35,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-01-08 23:52:35,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:35,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751995724] [2025-01-08 23:52:35,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751995724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:35,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:35,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:35,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043800679] [2025-01-08 23:52:35,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:35,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:35,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:35,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:35,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:35,418 INFO L87 Difference]: Start difference. First operand 98012 states and 105045 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:38,355 INFO L93 Difference]: Finished difference Result 226728 states and 244418 transitions. [2025-01-08 23:52:38,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:38,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 392 [2025-01-08 23:52:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:38,493 INFO L225 Difference]: With dead ends: 226728 [2025-01-08 23:52:38,493 INFO L226 Difference]: Without dead ends: 129505 [2025-01-08 23:52:38,528 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-01-08 23:52:38,529 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 887 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2368 mSolverCounterSat, 897 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 897 IncrementalHoareTripleChecker+Valid, 2368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:38,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 837 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [897 Valid, 2368 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:52:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129505 states. [2025-01-08 23:52:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129505 to 127915. [2025-01-08 23:52:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127915 states, 127914 states have (on average 1.0739872101568242) internal successors, (137378), 127914 states have internal predecessors, (137378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127915 states to 127915 states and 137378 transitions. [2025-01-08 23:52:39,741 INFO L78 Accepts]: Start accepts. Automaton has 127915 states and 137378 transitions. Word has length 392 [2025-01-08 23:52:39,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:39,741 INFO L471 AbstractCegarLoop]: Abstraction has 127915 states and 137378 transitions. [2025-01-08 23:52:39,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:39,741 INFO L276 IsEmpty]: Start isEmpty. Operand 127915 states and 137378 transitions. [2025-01-08 23:52:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-01-08 23:52:39,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:39,749 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:52:39,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:52:39,750 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:39,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:39,750 INFO L85 PathProgramCache]: Analyzing trace with hash -510609120, now seen corresponding path program 1 times [2025-01-08 23:52:39,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:39,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544228217] [2025-01-08 23:52:39,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:39,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:39,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-01-08 23:52:39,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-01-08 23:52:39,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:39,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:52:39,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:39,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544228217] [2025-01-08 23:52:39,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544228217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:39,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:39,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:39,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656964771] [2025-01-08 23:52:39,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:39,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:39,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:39,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:39,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:39,933 INFO L87 Difference]: Start difference. First operand 127915 states and 137378 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:43,245 INFO L93 Difference]: Finished difference Result 283388 states and 305881 transitions. [2025-01-08 23:52:43,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:43,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 484 [2025-01-08 23:52:43,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:43,421 INFO L225 Difference]: With dead ends: 283388 [2025-01-08 23:52:43,421 INFO L226 Difference]: Without dead ends: 154688 [2025-01-08 23:52:43,499 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-01-08 23:52:43,501 INFO L435 NwaCegarLoop]: 1713 mSDtfsCounter, 728 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2488 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 3161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 2488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:43,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1851 Invalid, 3161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 2488 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:52:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154688 states. [2025-01-08 23:52:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154688 to 153097. [2025-01-08 23:52:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153097 states, 153096 states have (on average 1.0642342059883994) internal successors, (162930), 153096 states have internal predecessors, (162930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153097 states to 153097 states and 162930 transitions. [2025-01-08 23:52:45,124 INFO L78 Accepts]: Start accepts. Automaton has 153097 states and 162930 transitions. Word has length 484 [2025-01-08 23:52:45,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:45,125 INFO L471 AbstractCegarLoop]: Abstraction has 153097 states and 162930 transitions. [2025-01-08 23:52:45,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 153097 states and 162930 transitions. [2025-01-08 23:52:45,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-01-08 23:52:45,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:45,142 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:52:45,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:52:45,142 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:45,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1370302410, now seen corresponding path program 1 times [2025-01-08 23:52:45,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:45,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041379283] [2025-01-08 23:52:45,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:45,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:45,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-01-08 23:52:45,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-01-08 23:52:45,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:45,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 379 proven. 110 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 23:52:46,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:46,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041379283] [2025-01-08 23:52:46,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041379283] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:52:46,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713462205] [2025-01-08 23:52:46,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:46,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:46,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:52:46,042 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:52:46,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 23:52:46,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-01-08 23:52:46,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-01-08 23:52:46,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:46,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:46,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:52:46,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:52:47,043 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-01-08 23:52:47,044 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:52:47,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713462205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:47,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:52:47,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-08 23:52:47,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497412514] [2025-01-08 23:52:47,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:47,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:47,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:47,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:47,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:52:47,046 INFO L87 Difference]: Start difference. First operand 153097 states and 162930 transitions. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 2 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:49,599 INFO L93 Difference]: Finished difference Result 310927 states and 330753 transitions. [2025-01-08 23:52:49,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:49,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 2 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 597 [2025-01-08 23:52:49,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:49,761 INFO L225 Difference]: With dead ends: 310927 [2025-01-08 23:52:49,761 INFO L226 Difference]: Without dead ends: 157042 [2025-01-08 23:52:49,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:52:49,823 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 545 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 2521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:49,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1110 Invalid, 2521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-08 23:52:49,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157042 states. [2025-01-08 23:52:51,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157042 to 155459. [2025-01-08 23:52:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155459 states, 155458 states have (on average 1.0583951935571023) internal successors, (164536), 155458 states have internal predecessors, (164536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:51,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155459 states to 155459 states and 164536 transitions. [2025-01-08 23:52:51,359 INFO L78 Accepts]: Start accepts. Automaton has 155459 states and 164536 transitions. Word has length 597 [2025-01-08 23:52:51,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:51,360 INFO L471 AbstractCegarLoop]: Abstraction has 155459 states and 164536 transitions. [2025-01-08 23:52:51,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 2 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 155459 states and 164536 transitions. [2025-01-08 23:52:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-01-08 23:52:51,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:51,382 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 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] [2025-01-08 23:52:51,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-08 23:52:51,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-08 23:52:51,583 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:51,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:51,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1221978908, now seen corresponding path program 1 times [2025-01-08 23:52:51,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:51,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594069916] [2025-01-08 23:52:51,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:51,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:51,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-01-08 23:52:51,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-01-08 23:52:51,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:51,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:51,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 840 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-01-08 23:52:51,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:51,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594069916] [2025-01-08 23:52:51,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594069916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:51,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:51,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:51,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641257746] [2025-01-08 23:52:51,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:51,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:51,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:51,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:51,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:51,997 INFO L87 Difference]: Start difference. First operand 155459 states and 164536 transitions. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:55,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:55,011 INFO L93 Difference]: Finished difference Result 311711 states and 329876 transitions. [2025-01-08 23:52:55,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:55,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 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 660 [2025-01-08 23:52:55,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:55,180 INFO L225 Difference]: With dead ends: 311711 [2025-01-08 23:52:55,180 INFO L226 Difference]: Without dead ends: 157041 [2025-01-08 23:52:55,240 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-01-08 23:52:55,241 INFO L435 NwaCegarLoop]: 1324 mSDtfsCounter, 927 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 2889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:55,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 1406 Invalid, 2889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:52:55,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157041 states. [2025-01-08 23:52:56,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157041 to 153879. [2025-01-08 23:52:56,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153879 states, 153878 states have (on average 1.045477586139669) internal successors, (160876), 153878 states have internal predecessors, (160876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153879 states to 153879 states and 160876 transitions. [2025-01-08 23:52:57,106 INFO L78 Accepts]: Start accepts. Automaton has 153879 states and 160876 transitions. Word has length 660 [2025-01-08 23:52:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:57,106 INFO L471 AbstractCegarLoop]: Abstraction has 153879 states and 160876 transitions. [2025-01-08 23:52:57,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 153879 states and 160876 transitions. [2025-01-08 23:52:57,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2025-01-08 23:52:57,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:57,125 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:52:57,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:52:57,125 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:57,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1001453206, now seen corresponding path program 1 times [2025-01-08 23:52:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:57,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693779818] [2025-01-08 23:52:57,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:57,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:57,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 701 statements into 1 equivalence classes. [2025-01-08 23:52:57,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 701 of 701 statements. [2025-01-08 23:52:57,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:57,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 586 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-01-08 23:52:57,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:57,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693779818] [2025-01-08 23:52:57,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693779818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:57,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:57,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:57,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681920091] [2025-01-08 23:52:57,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:57,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:57,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:57,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:57,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:57,976 INFO L87 Difference]: Start difference. First operand 153879 states and 160876 transitions. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:53:00,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:00,800 INFO L93 Difference]: Finished difference Result 314028 states and 328592 transitions. [2025-01-08 23:53:00,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:53:00,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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 701 [2025-01-08 23:53:00,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:00,961 INFO L225 Difference]: With dead ends: 314028 [2025-01-08 23:53:00,961 INFO L226 Difference]: Without dead ends: 160938 [2025-01-08 23:53:01,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:53:01,011 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 1047 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2183 mSolverCounterSat, 656 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 656 IncrementalHoareTripleChecker+Valid, 2183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:01,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 347 Invalid, 2839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [656 Valid, 2183 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:53:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160938 states.