./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label16.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/Problem15_label16.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 f36a525a226086cc938e65ee46daa868faf1a89b705080609babafb304ea1cb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:01:25,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:01:25,067 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:01:25,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:01:25,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:01:25,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:01:25,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:01:25,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:01:25,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:01:25,099 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:01:25,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:01:25,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:01:25,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:01:25,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:01:25,100 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:01:25,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:01:25,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:01:25,101 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:01:25,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:01:25,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:01:25,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:01:25,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:01:25,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:01:25,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:01:25,101 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:01:25,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:01:25,101 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:01:25,102 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:01:25,102 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:01:25,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:01:25,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:01:25,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:01:25,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:01:25,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:01:25,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:01:25,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:01:25,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:01:25,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:01:25,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:01:25,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:01:25,103 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:01:25,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:01:25,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:01:25,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:01:25,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:01:25,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:01:25,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:01:25,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:01:25,104 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 -> f36a525a226086cc938e65ee46daa868faf1a89b705080609babafb304ea1cb5 [2025-01-09 00:01:25,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:01:25,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:01:25,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:01:25,397 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:01:25,397 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:01:25,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label16.c [2025-01-09 00:01:26,675 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00966b09b/1dca66cc23c7400eae8acdd80a138424/FLAG15ea19e85 [2025-01-09 00:01:27,075 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:01:27,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label16.c [2025-01-09 00:01:27,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00966b09b/1dca66cc23c7400eae8acdd80a138424/FLAG15ea19e85 [2025-01-09 00:01:27,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00966b09b/1dca66cc23c7400eae8acdd80a138424 [2025-01-09 00:01:27,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:01:27,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:01:27,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:01:27,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:01:27,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:01:27,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:01:27" (1/1) ... [2025-01-09 00:01:27,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347a9827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:27, skipping insertion in model container [2025-01-09 00:01:27,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:01:27" (1/1) ... [2025-01-09 00:01:27,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:01:27,364 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/Problem15_label16.c[7550,7563] [2025-01-09 00:01:27,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:01:27,801 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:01:27,833 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/Problem15_label16.c[7550,7563] [2025-01-09 00:01:27,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:01:28,006 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:01:28,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:28 WrapperNode [2025-01-09 00:01:28,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:01:28,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:01:28,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:01:28,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:01:28,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:28" (1/1) ... [2025-01-09 00:01:28,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:28" (1/1) ... [2025-01-09 00:01:28,214 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-01-09 00:01:28,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:01:28,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:01:28,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:01:28,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:01:28,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:28" (1/1) ... [2025-01-09 00:01:28,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:28" (1/1) ... [2025-01-09 00:01:28,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:28" (1/1) ... [2025-01-09 00:01:28,303 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-09 00:01:28,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:28" (1/1) ... [2025-01-09 00:01:28,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:28" (1/1) ... [2025-01-09 00:01:28,368 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:28" (1/1) ... [2025-01-09 00:01:28,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:28" (1/1) ... [2025-01-09 00:01:28,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:28" (1/1) ... [2025-01-09 00:01:28,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:28" (1/1) ... [2025-01-09 00:01:28,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:28" (1/1) ... [2025-01-09 00:01:28,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:01:28,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:01:28,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:01:28,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:01:28,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:28" (1/1) ... [2025-01-09 00:01:28,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:01:28,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:28,518 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-09 00:01:28,530 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-09 00:01:28,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:01:28,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:01:28,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:01:28,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:01:28,598 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:01:28,599 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:01:30,732 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-01-09 00:01:30,732 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:01:30,755 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:01:30,755 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:01:30,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:01:30 BoogieIcfgContainer [2025-01-09 00:01:30,756 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:01:30,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:01:30,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:01:30,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:01:30,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:01:27" (1/3) ... [2025-01-09 00:01:30,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5912fa5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:01:30, skipping insertion in model container [2025-01-09 00:01:30,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:28" (2/3) ... [2025-01-09 00:01:30,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5912fa5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:01:30, skipping insertion in model container [2025-01-09 00:01:30,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:01:30" (3/3) ... [2025-01-09 00:01:30,764 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label16.c [2025-01-09 00:01:30,776 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:01:30,778 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label16.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:01:30,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:01:30,848 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;@712515ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:01:30,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:01:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 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-09 00:01:30,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 00:01:30,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:30,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:30,862 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:30,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:30,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2137131158, now seen corresponding path program 1 times [2025-01-09 00:01:30,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:30,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839939776] [2025-01-09 00:01:30,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:30,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:30,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 00:01:30,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 00:01:30,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:30,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:31,154 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-09 00:01:31,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:31,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839939776] [2025-01-09 00:01:31,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839939776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:31,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:31,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:01:31,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316892360] [2025-01-09 00:01:31,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:31,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:31,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:31,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:31,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:31,181 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 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 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:32,692 INFO L93 Difference]: Finished difference Result 1155 states and 2103 transitions. [2025-01-09 00:01:32,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:32,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-01-09 00:01:32,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:32,702 INFO L225 Difference]: With dead ends: 1155 [2025-01-09 00:01:32,702 INFO L226 Difference]: Without dead ends: 667 [2025-01-09 00:01:32,705 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-09 00:01:32,707 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 282 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:32,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 371 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:01:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-01-09 00:01:32,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2025-01-09 00:01:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.4789156626506024) internal successors, (982), 664 states have internal predecessors, (982), 0 states have call successors, (0), 0 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-09 00:01:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2025-01-09 00:01:32,752 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 62 [2025-01-09 00:01:32,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:32,752 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2025-01-09 00:01:32,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2025-01-09 00:01:32,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 00:01:32,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:32,755 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:01:32,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:01:32,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:32,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:32,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1674045120, now seen corresponding path program 1 times [2025-01-09 00:01:32,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:32,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385501407] [2025-01-09 00:01:32,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:32,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:32,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 00:01:32,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 00:01:32,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:32,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:32,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:32,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385501407] [2025-01-09 00:01:32,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385501407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:32,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:32,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:01:32,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484523104] [2025-01-09 00:01:32,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:32,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:32,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:32,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:32,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:32,992 INFO L87 Difference]: Start difference. First operand 665 states and 982 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-09 00:01:34,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:34,773 INFO L93 Difference]: Finished difference Result 1931 states and 2857 transitions. [2025-01-09 00:01:34,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:34,774 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-09 00:01:34,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:34,778 INFO L225 Difference]: With dead ends: 1931 [2025-01-09 00:01:34,778 INFO L226 Difference]: Without dead ends: 1268 [2025-01-09 00:01:34,780 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-09 00:01:34,780 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 240 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:34,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 366 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:01:34,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2025-01-09 00:01:34,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1266. [2025-01-09 00:01:34,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3043478260869565) internal successors, (1650), 1265 states have internal predecessors, (1650), 0 states have call successors, (0), 0 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-09 00:01:34,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1650 transitions. [2025-01-09 00:01:34,806 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1650 transitions. Word has length 137 [2025-01-09 00:01:34,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:34,806 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1650 transitions. [2025-01-09 00:01:34,806 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-09 00:01:34,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1650 transitions. [2025-01-09 00:01:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-09 00:01:34,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:34,811 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:34,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:01:34,812 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:34,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash -745641863, now seen corresponding path program 1 times [2025-01-09 00:01:34,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:34,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302764422] [2025-01-09 00:01:34,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:34,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:34,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 00:01:34,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 00:01:34,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:34,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:35,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:35,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302764422] [2025-01-09 00:01:35,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302764422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:35,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:35,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:35,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613367617] [2025-01-09 00:01:35,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:35,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:01:35,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:35,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:01:35,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:01:35,135 INFO L87 Difference]: Start difference. First operand 1266 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 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-09 00:01:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:37,933 INFO L93 Difference]: Finished difference Result 4670 states and 6170 transitions. [2025-01-09 00:01:37,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:01:37,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-01-09 00:01:37,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:37,959 INFO L225 Difference]: With dead ends: 4670 [2025-01-09 00:01:37,959 INFO L226 Difference]: Without dead ends: 3406 [2025-01-09 00:01:37,961 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-09 00:01:37,961 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 486 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:37,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 375 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 00:01:37,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2025-01-09 00:01:38,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3381. [2025-01-09 00:01:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2366863905325445) internal successors, (4180), 3380 states have internal predecessors, (4180), 0 states have call successors, (0), 0 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-09 00:01:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4180 transitions. [2025-01-09 00:01:38,055 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4180 transitions. Word has length 228 [2025-01-09 00:01:38,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:38,055 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4180 transitions. [2025-01-09 00:01:38,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 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-09 00:01:38,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4180 transitions. [2025-01-09 00:01:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-09 00:01:38,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:38,058 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:38,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:01:38,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:38,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1933729135, now seen corresponding path program 1 times [2025-01-09 00:01:38,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:38,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356223822] [2025-01-09 00:01:38,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:38,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:38,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 00:01:38,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 00:01:38,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:38,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-09 00:01:38,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:38,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356223822] [2025-01-09 00:01:38,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356223822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:38,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:38,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:01:38,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319469978] [2025-01-09 00:01:38,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:38,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:38,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:38,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:38,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:38,320 INFO L87 Difference]: Start difference. First operand 3381 states and 4180 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:40,277 INFO L93 Difference]: Finished difference Result 8563 states and 10754 transitions. [2025-01-09 00:01:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:40,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2025-01-09 00:01:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:40,291 INFO L225 Difference]: With dead ends: 8563 [2025-01-09 00:01:40,291 INFO L226 Difference]: Without dead ends: 5483 [2025-01-09 00:01:40,294 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-09 00:01:40,295 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:40,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:01:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2025-01-09 00:01:40,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2025-01-09 00:01:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.16870549570933) internal successors, (6401), 5477 states have internal predecessors, (6401), 0 states have call successors, (0), 0 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-09 00:01:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6401 transitions. [2025-01-09 00:01:40,364 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6401 transitions. Word has length 232 [2025-01-09 00:01:40,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:40,364 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6401 transitions. [2025-01-09 00:01:40,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6401 transitions. [2025-01-09 00:01:40,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-01-09 00:01:40,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:40,368 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:01:40,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:01:40,369 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:40,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:40,369 INFO L85 PathProgramCache]: Analyzing trace with hash -177498155, now seen corresponding path program 1 times [2025-01-09 00:01:40,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:40,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142711576] [2025-01-09 00:01:40,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:40,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:40,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-01-09 00:01:40,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-01-09 00:01:40,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:40,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:41,441 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 00:01:41,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:41,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142711576] [2025-01-09 00:01:41,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142711576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:41,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:41,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:01:41,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253082669] [2025-01-09 00:01:41,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:41,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:41,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:41,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:41,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:41,443 INFO L87 Difference]: Start difference. First operand 5478 states and 6401 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 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-09 00:01:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:42,988 INFO L93 Difference]: Finished difference Result 10655 states and 12489 transitions. [2025-01-09 00:01:42,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:42,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 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 334 [2025-01-09 00:01:42,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:43,021 INFO L225 Difference]: With dead ends: 10655 [2025-01-09 00:01:43,024 INFO L226 Difference]: Without dead ends: 5478 [2025-01-09 00:01:43,034 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-09 00:01:43,040 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:43,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:01:43,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2025-01-09 00:01:43,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2025-01-09 00:01:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1676100054774512) internal successors, (6395), 5477 states have internal predecessors, (6395), 0 states have call successors, (0), 0 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-09 00:01:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6395 transitions. [2025-01-09 00:01:43,287 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6395 transitions. Word has length 334 [2025-01-09 00:01:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:43,287 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6395 transitions. [2025-01-09 00:01:43,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 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-09 00:01:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6395 transitions. [2025-01-09 00:01:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-01-09 00:01:43,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:43,295 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:43,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:01:43,296 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:43,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:43,297 INFO L85 PathProgramCache]: Analyzing trace with hash 690804609, now seen corresponding path program 1 times [2025-01-09 00:01:43,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:43,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800640046] [2025-01-09 00:01:43,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:43,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:43,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-01-09 00:01:43,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-01-09 00:01:43,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:43,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 00:01:43,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:43,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800640046] [2025-01-09 00:01:43,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800640046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:43,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:43,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:43,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989908747] [2025-01-09 00:01:43,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:43,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:43,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:43,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:43,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:43,877 INFO L87 Difference]: Start difference. First operand 5478 states and 6395 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 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-09 00:01:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:46,329 INFO L93 Difference]: Finished difference Result 12758 states and 15195 transitions. [2025-01-09 00:01:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:46,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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 349 [2025-01-09 00:01:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:46,355 INFO L225 Difference]: With dead ends: 12758 [2025-01-09 00:01:46,355 INFO L226 Difference]: Without dead ends: 7581 [2025-01-09 00:01:46,365 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-09 00:01:46,370 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 254 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:46,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 670 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 00:01:46,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2025-01-09 00:01:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 7579. [2025-01-09 00:01:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7579 states, 7578 states have (on average 1.1421219319081553) internal successors, (8655), 7578 states have internal predecessors, (8655), 0 states have call successors, (0), 0 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-09 00:01:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7579 states to 7579 states and 8655 transitions. [2025-01-09 00:01:46,588 INFO L78 Accepts]: Start accepts. Automaton has 7579 states and 8655 transitions. Word has length 349 [2025-01-09 00:01:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:46,588 INFO L471 AbstractCegarLoop]: Abstraction has 7579 states and 8655 transitions. [2025-01-09 00:01:46,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 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-09 00:01:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 7579 states and 8655 transitions. [2025-01-09 00:01:46,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-01-09 00:01:46,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:46,600 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:01:46,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:01:46,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:46,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:46,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1782316679, now seen corresponding path program 1 times [2025-01-09 00:01:46,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:46,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891180425] [2025-01-09 00:01:46,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:46,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:46,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-01-09 00:01:46,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-01-09 00:01:46,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:46,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-09 00:01:47,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:47,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891180425] [2025-01-09 00:01:47,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891180425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:47,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:47,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:47,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198716622] [2025-01-09 00:01:47,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:47,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:47,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:47,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:47,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:47,203 INFO L87 Difference]: Start difference. First operand 7579 states and 8655 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 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-09 00:01:49,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:49,096 INFO L93 Difference]: Finished difference Result 16956 states and 19718 transitions. [2025-01-09 00:01:49,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:49,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 408 [2025-01-09 00:01:49,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:49,132 INFO L225 Difference]: With dead ends: 16956 [2025-01-09 00:01:49,136 INFO L226 Difference]: Without dead ends: 9678 [2025-01-09 00:01:49,145 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-09 00:01:49,146 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:49,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 633 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:01:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9678 states. [2025-01-09 00:01:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9678 to 8781. [2025-01-09 00:01:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8781 states, 8780 states have (on average 1.1329157175398634) internal successors, (9947), 8780 states have internal predecessors, (9947), 0 states have call successors, (0), 0 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-09 00:01:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8781 states to 8781 states and 9947 transitions. [2025-01-09 00:01:49,385 INFO L78 Accepts]: Start accepts. Automaton has 8781 states and 9947 transitions. Word has length 408 [2025-01-09 00:01:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:49,389 INFO L471 AbstractCegarLoop]: Abstraction has 8781 states and 9947 transitions. [2025-01-09 00:01:49,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 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-09 00:01:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 8781 states and 9947 transitions. [2025-01-09 00:01:49,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-01-09 00:01:49,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:49,400 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:49,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:01:49,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:49,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:49,401 INFO L85 PathProgramCache]: Analyzing trace with hash -70437331, now seen corresponding path program 1 times [2025-01-09 00:01:49,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:49,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172056064] [2025-01-09 00:01:49,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:49,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:49,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-01-09 00:01:49,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-01-09 00:01:49,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:49,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:49,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:49,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172056064] [2025-01-09 00:01:49,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172056064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:49,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:49,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:49,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532979217] [2025-01-09 00:01:49,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:49,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:49,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:49,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:49,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:49,892 INFO L87 Difference]: Start difference. First operand 8781 states and 9947 transitions. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:51,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:51,067 INFO L93 Difference]: Finished difference Result 19063 states and 21976 transitions. [2025-01-09 00:01:51,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:51,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 425 [2025-01-09 00:01:51,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:51,085 INFO L225 Difference]: With dead ends: 19063 [2025-01-09 00:01:51,085 INFO L226 Difference]: Without dead ends: 10583 [2025-01-09 00:01:51,094 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-09 00:01:51,094 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 246 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:51,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 623 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:01:51,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10583 states. [2025-01-09 00:01:51,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10583 to 10277. [2025-01-09 00:01:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10277 states, 10276 states have (on average 1.1220319190346437) internal successors, (11530), 10276 states have internal predecessors, (11530), 0 states have call successors, (0), 0 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-09 00:01:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10277 states to 10277 states and 11530 transitions. [2025-01-09 00:01:51,197 INFO L78 Accepts]: Start accepts. Automaton has 10277 states and 11530 transitions. Word has length 425 [2025-01-09 00:01:51,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:51,199 INFO L471 AbstractCegarLoop]: Abstraction has 10277 states and 11530 transitions. [2025-01-09 00:01:51,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 10277 states and 11530 transitions. [2025-01-09 00:01:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2025-01-09 00:01:51,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:51,208 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-09 00:01:51,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:01:51,208 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:51,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:51,208 INFO L85 PathProgramCache]: Analyzing trace with hash -812610168, now seen corresponding path program 1 times [2025-01-09 00:01:51,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:51,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017239952] [2025-01-09 00:01:51,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:51,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:51,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-01-09 00:01:51,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-01-09 00:01:51,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:51,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:51,707 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 424 proven. 39 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 00:01:51,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:51,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017239952] [2025-01-09 00:01:51,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017239952] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:51,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119810668] [2025-01-09 00:01:51,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:51,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:51,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:51,712 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-09 00:01:51,713 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-09 00:01:51,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-01-09 00:01:51,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-01-09 00:01:51,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:51,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:51,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:01:51,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-01-09 00:01:52,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:01:52,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119810668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:52,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:01:52,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:01:52,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732227167] [2025-01-09 00:01:52,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:52,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:52,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:52,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:52,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:01:52,303 INFO L87 Difference]: Start difference. First operand 10277 states and 11530 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:53,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:53,507 INFO L93 Difference]: Finished difference Result 23542 states and 26614 transitions. [2025-01-09 00:01:53,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:53,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 513 [2025-01-09 00:01:53,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:53,528 INFO L225 Difference]: With dead ends: 23542 [2025-01-09 00:01:53,528 INFO L226 Difference]: Without dead ends: 13566 [2025-01-09 00:01:53,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:01:53,537 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:53,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 315 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:01:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13566 states. [2025-01-09 00:01:53,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13566 to 9075. [2025-01-09 00:01:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9075 states, 9074 states have (on average 1.1320255675556534) internal successors, (10272), 9074 states have internal predecessors, (10272), 0 states have call successors, (0), 0 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-09 00:01:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9075 states to 9075 states and 10272 transitions. [2025-01-09 00:01:53,619 INFO L78 Accepts]: Start accepts. Automaton has 9075 states and 10272 transitions. Word has length 513 [2025-01-09 00:01:53,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:53,619 INFO L471 AbstractCegarLoop]: Abstraction has 9075 states and 10272 transitions. [2025-01-09 00:01:53,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:53,620 INFO L276 IsEmpty]: Start isEmpty. Operand 9075 states and 10272 transitions. [2025-01-09 00:01:53,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-01-09 00:01:53,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:53,624 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:53,631 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-09 00:01:53,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:53,829 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:53,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:53,830 INFO L85 PathProgramCache]: Analyzing trace with hash -837276109, now seen corresponding path program 1 times [2025-01-09 00:01:53,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:53,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484609529] [2025-01-09 00:01:53,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:53,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:53,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-01-09 00:01:53,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-01-09 00:01:53,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:53,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 529 proven. 39 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2025-01-09 00:01:54,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:54,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484609529] [2025-01-09 00:01:54,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484609529] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:54,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099233155] [2025-01-09 00:01:54,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:54,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:54,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:54,230 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-09 00:01:54,231 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-09 00:01:54,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-01-09 00:01:54,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-01-09 00:01:54,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:54,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:54,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:01:54,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-01-09 00:01:54,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:01:54,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099233155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:54,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:01:54,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:01:54,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428655023] [2025-01-09 00:01:54,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:54,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:54,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:54,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:54,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:01:54,435 INFO L87 Difference]: Start difference. First operand 9075 states and 10272 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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-09 00:01:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:55,463 INFO L93 Difference]: Finished difference Result 20240 states and 23193 transitions. [2025-01-09 00:01:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:55,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 546 [2025-01-09 00:01:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:55,476 INFO L225 Difference]: With dead ends: 20240 [2025-01-09 00:01:55,476 INFO L226 Difference]: Without dead ends: 11466 [2025-01-09 00:01:55,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:01:55,483 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 355 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:55,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 448 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:01:55,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11466 states. [2025-01-09 00:01:55,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11466 to 11466. [2025-01-09 00:01:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11466 states, 11465 states have (on average 1.136676842564326) internal successors, (13032), 11465 states have internal predecessors, (13032), 0 states have call successors, (0), 0 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-09 00:01:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11466 states to 11466 states and 13032 transitions. [2025-01-09 00:01:55,624 INFO L78 Accepts]: Start accepts. Automaton has 11466 states and 13032 transitions. Word has length 546 [2025-01-09 00:01:55,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:55,625 INFO L471 AbstractCegarLoop]: Abstraction has 11466 states and 13032 transitions. [2025-01-09 00:01:55,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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-09 00:01:55,625 INFO L276 IsEmpty]: Start isEmpty. Operand 11466 states and 13032 transitions. [2025-01-09 00:01:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2025-01-09 00:01:55,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:55,631 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:55,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 00:01:55,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:55,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:55,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:55,833 INFO L85 PathProgramCache]: Analyzing trace with hash -476137943, now seen corresponding path program 1 times [2025-01-09 00:01:55,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:55,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445301996] [2025-01-09 00:01:55,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:55,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:55,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-01-09 00:01:55,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-01-09 00:01:55,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:55,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:56,120 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-01-09 00:01:56,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:56,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445301996] [2025-01-09 00:01:56,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445301996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:56,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:56,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:56,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124339947] [2025-01-09 00:01:56,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:56,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:56,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:56,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:56,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:56,122 INFO L87 Difference]: Start difference. First operand 11466 states and 13032 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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-09 00:01:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:57,466 INFO L93 Difference]: Finished difference Result 27130 states and 31140 transitions. [2025-01-09 00:01:57,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:57,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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 550 [2025-01-09 00:01:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:57,483 INFO L225 Difference]: With dead ends: 27130 [2025-01-09 00:01:57,484 INFO L226 Difference]: Without dead ends: 15965 [2025-01-09 00:01:57,495 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-09 00:01:57,496 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:57,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 621 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:01:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15965 states. [2025-01-09 00:01:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15965 to 15356. [2025-01-09 00:01:57,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15356 states, 15355 states have (on average 1.1286225985021165) internal successors, (17330), 15355 states have internal predecessors, (17330), 0 states have call successors, (0), 0 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-09 00:01:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15356 states to 15356 states and 17330 transitions. [2025-01-09 00:01:57,629 INFO L78 Accepts]: Start accepts. Automaton has 15356 states and 17330 transitions. Word has length 550 [2025-01-09 00:01:57,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:57,630 INFO L471 AbstractCegarLoop]: Abstraction has 15356 states and 17330 transitions. [2025-01-09 00:01:57,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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-09 00:01:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 15356 states and 17330 transitions. [2025-01-09 00:01:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2025-01-09 00:01:57,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:57,639 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, 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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:01:57,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:01:57,639 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:57,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:57,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1834182221, now seen corresponding path program 1 times [2025-01-09 00:01:57,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:57,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818082130] [2025-01-09 00:01:57,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:57,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:57,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 625 statements into 1 equivalence classes. [2025-01-09 00:01:57,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 625 of 625 statements. [2025-01-09 00:01:57,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:57,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 686 proven. 39 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2025-01-09 00:01:58,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:58,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818082130] [2025-01-09 00:01:58,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818082130] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:58,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363968916] [2025-01-09 00:01:58,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:58,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:58,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:58,096 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-09 00:01:58,096 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-09 00:01:58,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 625 statements into 1 equivalence classes. [2025-01-09 00:01:58,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 625 of 625 statements. [2025-01-09 00:01:58,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:58,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:58,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:01:58,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 610 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-01-09 00:01:58,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:01:58,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363968916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:58,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:01:58,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:01:58,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347802089] [2025-01-09 00:01:58,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:58,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:58,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:58,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:58,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:01:58,351 INFO L87 Difference]: Start difference. First operand 15356 states and 17330 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 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-09 00:01:59,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:59,513 INFO L93 Difference]: Finished difference Result 30108 states and 34018 transitions. [2025-01-09 00:01:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:59,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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 625 [2025-01-09 00:01:59,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:59,527 INFO L225 Difference]: With dead ends: 30108 [2025-01-09 00:01:59,527 INFO L226 Difference]: Without dead ends: 15053 [2025-01-09 00:01:59,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:01:59,536 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 252 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:59,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 605 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:01:59,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15053 states. [2025-01-09 00:01:59,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15053 to 15052. [2025-01-09 00:01:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15052 states, 15051 states have (on average 1.0795295993621685) internal successors, (16248), 15051 states have internal predecessors, (16248), 0 states have call successors, (0), 0 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-09 00:01:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15052 states to 15052 states and 16248 transitions. [2025-01-09 00:01:59,646 INFO L78 Accepts]: Start accepts. Automaton has 15052 states and 16248 transitions. Word has length 625 [2025-01-09 00:01:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:59,646 INFO L471 AbstractCegarLoop]: Abstraction has 15052 states and 16248 transitions. [2025-01-09 00:01:59,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 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-09 00:01:59,647 INFO L276 IsEmpty]: Start isEmpty. Operand 15052 states and 16248 transitions. [2025-01-09 00:01:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-01-09 00:01:59,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:59,653 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:59,659 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-09 00:01:59,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:59,854 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:59,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:59,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1577075412, now seen corresponding path program 1 times [2025-01-09 00:01:59,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:59,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153911047] [2025-01-09 00:01:59,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:59,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:59,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-01-09 00:01:59,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-01-09 00:01:59,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:59,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 613 proven. 39 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2025-01-09 00:02:00,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:00,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153911047] [2025-01-09 00:02:00,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153911047] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:02:00,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135494828] [2025-01-09 00:02:00,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:00,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:02:00,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:02:00,270 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-09 00:02:00,271 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-09 00:02:00,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-01-09 00:02:00,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-01-09 00:02:00,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:00,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:00,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 00:02:00,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:02:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 613 proven. 39 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2025-01-09 00:02:00,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:02:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 613 proven. 39 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2025-01-09 00:02:01,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135494828] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:02:01,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:02:01,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-09 00:02:01,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521654176] [2025-01-09 00:02:01,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:02:01,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:02:01,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:01,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:02:01,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:02:01,806 INFO L87 Difference]: Start difference. First operand 15052 states and 16248 transitions. Second operand has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 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-09 00:02:06,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:06,840 INFO L93 Difference]: Finished difference Result 38434 states and 41454 transitions. [2025-01-09 00:02:06,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 00:02:06,841 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 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 626 [2025-01-09 00:02:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:06,864 INFO L225 Difference]: With dead ends: 38434 [2025-01-09 00:02:06,867 INFO L226 Difference]: Without dead ends: 16546 [2025-01-09 00:02:06,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1261 GetRequests, 1247 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-01-09 00:02:06,884 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 2889 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 6108 mSolverCounterSat, 635 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2889 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 6743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 635 IncrementalHoareTripleChecker+Valid, 6108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:06,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2889 Valid, 273 Invalid, 6743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [635 Valid, 6108 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-01-09 00:02:06,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16546 states. [2025-01-09 00:02:07,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16546 to 12357. [2025-01-09 00:02:07,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12357 states, 12356 states have (on average 1.0386047264486888) internal successors, (12833), 12356 states have internal predecessors, (12833), 0 states have call successors, (0), 0 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-09 00:02:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12357 states to 12357 states and 12833 transitions. [2025-01-09 00:02:07,121 INFO L78 Accepts]: Start accepts. Automaton has 12357 states and 12833 transitions. Word has length 626 [2025-01-09 00:02:07,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:07,125 INFO L471 AbstractCegarLoop]: Abstraction has 12357 states and 12833 transitions. [2025-01-09 00:02:07,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 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-09 00:02:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 12357 states and 12833 transitions. [2025-01-09 00:02:07,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 00:02:07,134 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:07,135 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:02:07,149 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-09 00:02:07,335 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,SelfDestructingSolverStorable12 [2025-01-09 00:02:07,336 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:07,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:07,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1577464605, now seen corresponding path program 1 times [2025-01-09 00:02:07,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:07,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977792331] [2025-01-09 00:02:07,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:07,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:07,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 00:02:07,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 00:02:07,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:07,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 263 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:02:08,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:08,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977792331] [2025-01-09 00:02:08,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977792331] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:02:08,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412122111] [2025-01-09 00:02:08,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:08,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:02:08,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:02:08,263 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-09 00:02:08,266 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-09 00:02:08,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 00:02:08,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 00:02:08,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:08,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:08,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:02:08,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:02:08,874 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 448 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:02:08,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:02:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 448 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:02:10,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412122111] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:02:10,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:02:10,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-09 00:02:10,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652655876] [2025-01-09 00:02:10,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:02:10,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 00:02:10,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:10,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 00:02:10,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 00:02:10,251 INFO L87 Difference]: Start difference. First operand 12357 states and 12833 transitions. Second operand has 12 states, 12 states have (on average 143.08333333333334) internal successors, (1717), 12 states have internal predecessors, (1717), 0 states have call successors, (0), 0 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-09 00:02:19,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:19,806 INFO L93 Difference]: Finished difference Result 39828 states and 41410 transitions. [2025-01-09 00:02:19,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-01-09 00:02:19,806 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 143.08333333333334) internal successors, (1717), 12 states have internal predecessors, (1717), 0 states have call successors, (0), 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 663 [2025-01-09 00:02:19,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:19,829 INFO L225 Difference]: With dead ends: 39828 [2025-01-09 00:02:19,829 INFO L226 Difference]: Without dead ends: 26872 [2025-01-09 00:02:19,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1395 GetRequests, 1341 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=591, Invalid=2489, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 00:02:19,836 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 5537 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 14635 mSolverCounterSat, 1318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5537 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 15953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1318 IncrementalHoareTripleChecker+Valid, 14635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:19,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5537 Valid, 477 Invalid, 15953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1318 Valid, 14635 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2025-01-09 00:02:19,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26872 states. [2025-01-09 00:02:20,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26872 to 19845. [2025-01-09 00:02:20,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19845 states, 19844 states have (on average 1.0376940133037693) internal successors, (20592), 19844 states have internal predecessors, (20592), 0 states have call successors, (0), 0 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-09 00:02:20,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19845 states to 19845 states and 20592 transitions. [2025-01-09 00:02:20,219 INFO L78 Accepts]: Start accepts. Automaton has 19845 states and 20592 transitions. Word has length 663 [2025-01-09 00:02:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:20,219 INFO L471 AbstractCegarLoop]: Abstraction has 19845 states and 20592 transitions. [2025-01-09 00:02:20,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 143.08333333333334) internal successors, (1717), 12 states have internal predecessors, (1717), 0 states have call successors, (0), 0 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-09 00:02:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 19845 states and 20592 transitions. [2025-01-09 00:02:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2025-01-09 00:02:20,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:20,240 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, 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, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:02:20,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 00:02:20,440 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,SelfDestructingSolverStorable13 [2025-01-09 00:02:20,441 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:20,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:20,442 INFO L85 PathProgramCache]: Analyzing trace with hash 505207340, now seen corresponding path program 1 times [2025-01-09 00:02:20,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:20,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864641174] [2025-01-09 00:02:20,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:20,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:20,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 767 statements into 1 equivalence classes. [2025-01-09 00:02:20,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 767 of 767 statements. [2025-01-09 00:02:20,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:20,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1286 backedges. 626 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-01-09 00:02:20,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:20,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864641174] [2025-01-09 00:02:20,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864641174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:20,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:20,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:20,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521284347] [2025-01-09 00:02:20,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:20,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:20,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:20,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:20,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:20,747 INFO L87 Difference]: Start difference. First operand 19845 states and 20592 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 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-09 00:02:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:21,682 INFO L93 Difference]: Finished difference Result 46563 states and 48376 transitions. [2025-01-09 00:02:21,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:21,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 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 767 [2025-01-09 00:02:21,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:21,709 INFO L225 Difference]: With dead ends: 46563 [2025-01-09 00:02:21,709 INFO L226 Difference]: Without dead ends: 27019 [2025-01-09 00:02:21,728 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-09 00:02:21,733 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 265 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:21,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 159 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:02:21,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27019 states. [2025-01-09 00:02:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27019 to 25524. [2025-01-09 00:02:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25524 states, 25523 states have (on average 1.0351839517298123) internal successors, (26421), 25523 states have internal predecessors, (26421), 0 states have call successors, (0), 0 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-09 00:02:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25524 states to 25524 states and 26421 transitions. [2025-01-09 00:02:22,051 INFO L78 Accepts]: Start accepts. Automaton has 25524 states and 26421 transitions. Word has length 767 [2025-01-09 00:02:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:22,052 INFO L471 AbstractCegarLoop]: Abstraction has 25524 states and 26421 transitions. [2025-01-09 00:02:22,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 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-09 00:02:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 25524 states and 26421 transitions. [2025-01-09 00:02:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2025-01-09 00:02:22,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:22,064 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:02:22,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:02:22,065 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:22,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash -732751732, now seen corresponding path program 1 times [2025-01-09 00:02:22,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:22,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483745355] [2025-01-09 00:02:22,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:22,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:22,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 808 statements into 1 equivalence classes. [2025-01-09 00:02:22,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 808 of 808 statements. [2025-01-09 00:02:22,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:22,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2025-01-09 00:02:23,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:23,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483745355] [2025-01-09 00:02:23,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483745355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:23,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:23,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:23,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038193558] [2025-01-09 00:02:23,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:23,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:23,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:23,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:23,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:23,149 INFO L87 Difference]: Start difference. First operand 25524 states and 26421 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 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-09 00:02:23,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:23,972 INFO L93 Difference]: Finished difference Result 51949 states and 53759 transitions. [2025-01-09 00:02:23,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:23,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 808 [2025-01-09 00:02:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:23,995 INFO L225 Difference]: With dead ends: 51949 [2025-01-09 00:02:23,995 INFO L226 Difference]: Without dead ends: 26726 [2025-01-09 00:02:24,008 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-09 00:02:24,008 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 252 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:24,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 532 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:02:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26726 states. [2025-01-09 00:02:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26726 to 26122. [2025-01-09 00:02:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26122 states, 26121 states have (on average 1.0345698862983805) internal successors, (27024), 26121 states have internal predecessors, (27024), 0 states have call successors, (0), 0 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-09 00:02:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26122 states to 26122 states and 27024 transitions. [2025-01-09 00:02:24,219 INFO L78 Accepts]: Start accepts. Automaton has 26122 states and 27024 transitions. Word has length 808 [2025-01-09 00:02:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:24,219 INFO L471 AbstractCegarLoop]: Abstraction has 26122 states and 27024 transitions. [2025-01-09 00:02:24,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 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-09 00:02:24,219 INFO L276 IsEmpty]: Start isEmpty. Operand 26122 states and 27024 transitions. [2025-01-09 00:02:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2025-01-09 00:02:24,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:24,235 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:02:24,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:02:24,235 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:24,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:24,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1843056294, now seen corresponding path program 1 times [2025-01-09 00:02:24,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:24,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637437478] [2025-01-09 00:02:24,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:24,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:24,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 874 statements into 1 equivalence classes. [2025-01-09 00:02:24,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 874 of 874 statements. [2025-01-09 00:02:24,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:24,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1834 backedges. 1059 proven. 0 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2025-01-09 00:02:24,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:24,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637437478] [2025-01-09 00:02:24,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637437478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:24,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:24,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:24,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433297136] [2025-01-09 00:02:24,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:24,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:24,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:24,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:24,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:24,814 INFO L87 Difference]: Start difference. First operand 26122 states and 27024 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 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-09 00:02:25,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:25,542 INFO L93 Difference]: Finished difference Result 51941 states and 53755 transitions. [2025-01-09 00:02:25,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:25,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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 874 [2025-01-09 00:02:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:25,564 INFO L225 Difference]: With dead ends: 51941 [2025-01-09 00:02:25,564 INFO L226 Difference]: Without dead ends: 26419 [2025-01-09 00:02:25,576 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-09 00:02:25,576 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 435 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:25,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 67 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:02:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26419 states. [2025-01-09 00:02:25,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26419 to 26120. [2025-01-09 00:02:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26120 states, 26119 states have (on average 1.0344959607948236) internal successors, (27020), 26119 states have internal predecessors, (27020), 0 states have call successors, (0), 0 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-09 00:02:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26120 states to 26120 states and 27020 transitions. [2025-01-09 00:02:25,777 INFO L78 Accepts]: Start accepts. Automaton has 26120 states and 27020 transitions. Word has length 874 [2025-01-09 00:02:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:25,777 INFO L471 AbstractCegarLoop]: Abstraction has 26120 states and 27020 transitions. [2025-01-09 00:02:25,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 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-09 00:02:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 26120 states and 27020 transitions. [2025-01-09 00:02:25,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 887 [2025-01-09 00:02:25,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:25,790 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, 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, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:02:25,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:02:25,790 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:25,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:25,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1887797638, now seen corresponding path program 1 times [2025-01-09 00:02:25,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:25,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306214270] [2025-01-09 00:02:25,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:25,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:25,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 886 statements into 1 equivalence classes. [2025-01-09 00:02:25,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 886 of 886 statements. [2025-01-09 00:02:25,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:25,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 1012 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2025-01-09 00:02:26,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:26,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306214270] [2025-01-09 00:02:26,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306214270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:26,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:26,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:02:26,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093294441] [2025-01-09 00:02:26,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:26,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:02:26,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:26,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:02:26,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:02:26,213 INFO L87 Difference]: Start difference. First operand 26120 states and 27020 transitions. Second operand has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 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-09 00:02:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:27,460 INFO L93 Difference]: Finished difference Result 52226 states and 54004 transitions. [2025-01-09 00:02:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:02:27,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 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 886 [2025-01-09 00:02:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:27,485 INFO L225 Difference]: With dead ends: 52226 [2025-01-09 00:02:27,485 INFO L226 Difference]: Without dead ends: 26706 [2025-01-09 00:02:27,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-09 00:02:27,500 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 513 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:27,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 418 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:02:27,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26706 states. [2025-01-09 00:02:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26706 to 24010. [2025-01-09 00:02:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24010 states, 24009 states have (on average 1.0254071389895456) internal successors, (24619), 24009 states have internal predecessors, (24619), 0 states have call successors, (0), 0 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-09 00:02:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24010 states to 24010 states and 24619 transitions. [2025-01-09 00:02:27,767 INFO L78 Accepts]: Start accepts. Automaton has 24010 states and 24619 transitions. Word has length 886 [2025-01-09 00:02:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:27,768 INFO L471 AbstractCegarLoop]: Abstraction has 24010 states and 24619 transitions. [2025-01-09 00:02:27,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 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-09 00:02:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 24010 states and 24619 transitions. [2025-01-09 00:02:27,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1118 [2025-01-09 00:02:27,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:27,806 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:02:27,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:02:27,807 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:27,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:27,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2046688111, now seen corresponding path program 1 times [2025-01-09 00:02:27,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:27,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771332971] [2025-01-09 00:02:27,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:27,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:27,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1117 statements into 1 equivalence classes. [2025-01-09 00:02:27,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1117 of 1117 statements. [2025-01-09 00:02:27,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:27,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:28,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1928 backedges. 1215 proven. 0 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2025-01-09 00:02:28,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:28,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771332971] [2025-01-09 00:02:28,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771332971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:28,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:28,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:28,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565244316] [2025-01-09 00:02:28,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:28,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:28,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:28,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:28,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:28,492 INFO L87 Difference]: Start difference. First operand 24010 states and 24619 transitions. Second operand has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 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-09 00:02:29,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:29,300 INFO L93 Difference]: Finished difference Result 50724 states and 52027 transitions. [2025-01-09 00:02:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:29,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 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 1117 [2025-01-09 00:02:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:29,325 INFO L225 Difference]: With dead ends: 50724 [2025-01-09 00:02:29,325 INFO L226 Difference]: Without dead ends: 27314 [2025-01-09 00:02:29,339 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-09 00:02:29,340 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 348 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:29,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 116 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:02:29,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27314 states. [2025-01-09 00:02:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27314 to 24008. [2025-01-09 00:02:29,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24008 states, 24007 states have (on average 1.0243262381805307) internal successors, (24591), 24007 states have internal predecessors, (24591), 0 states have call successors, (0), 0 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-09 00:02:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24008 states to 24008 states and 24591 transitions. [2025-01-09 00:02:29,602 INFO L78 Accepts]: Start accepts. Automaton has 24008 states and 24591 transitions. Word has length 1117 [2025-01-09 00:02:29,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:29,602 INFO L471 AbstractCegarLoop]: Abstraction has 24008 states and 24591 transitions. [2025-01-09 00:02:29,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 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-09 00:02:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 24008 states and 24591 transitions. [2025-01-09 00:02:29,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1123 [2025-01-09 00:02:29,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:29,630 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:02:29,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:02:29,630 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:29,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:29,631 INFO L85 PathProgramCache]: Analyzing trace with hash -67189409, now seen corresponding path program 1 times [2025-01-09 00:02:29,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:29,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355688606] [2025-01-09 00:02:29,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:29,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:29,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1122 statements into 1 equivalence classes. [2025-01-09 00:02:29,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1122 of 1122 statements. [2025-01-09 00:02:29,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:29,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 1903 trivial. 0 not checked. [2025-01-09 00:02:30,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:30,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355688606] [2025-01-09 00:02:30,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355688606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:30,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:30,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:02:30,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234025244] [2025-01-09 00:02:30,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:30,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:02:30,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:30,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:02:30,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:02:30,522 INFO L87 Difference]: Start difference. First operand 24008 states and 24591 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 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-09 00:02:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:31,610 INFO L93 Difference]: Finished difference Result 51905 states and 53176 transitions. [2025-01-09 00:02:31,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:02:31,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 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 1122 [2025-01-09 00:02:31,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:31,656 INFO L225 Difference]: With dead ends: 51905 [2025-01-09 00:02:31,656 INFO L226 Difference]: Without dead ends: 28497 [2025-01-09 00:02:31,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-09 00:02:31,671 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 871 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:31,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 148 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:02:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28497 states. [2025-01-09 00:02:31,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28497 to 24904. [2025-01-09 00:02:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24904 states, 24903 states have (on average 1.0224872505320644) internal successors, (25463), 24903 states have internal predecessors, (25463), 0 states have call successors, (0), 0 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-09 00:02:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24904 states to 24904 states and 25463 transitions. [2025-01-09 00:02:31,868 INFO L78 Accepts]: Start accepts. Automaton has 24904 states and 25463 transitions. Word has length 1122 [2025-01-09 00:02:31,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:31,869 INFO L471 AbstractCegarLoop]: Abstraction has 24904 states and 25463 transitions. [2025-01-09 00:02:31,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 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-09 00:02:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 24904 states and 25463 transitions. [2025-01-09 00:02:31,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1365 [2025-01-09 00:02:31,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:31,965 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:02:31,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:02:31,965 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:31,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:31,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1880216681, now seen corresponding path program 1 times [2025-01-09 00:02:31,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:31,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541960999] [2025-01-09 00:02:31,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:31,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:32,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1364 statements into 1 equivalence classes. [2025-01-09 00:02:32,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1364 of 1364 statements. [2025-01-09 00:02:32,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:32,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:33,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 2091 proven. 0 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2025-01-09 00:02:33,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:33,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541960999] [2025-01-09 00:02:33,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541960999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:33,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:33,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:33,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118395266] [2025-01-09 00:02:33,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:33,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:33,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:33,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:33,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:33,096 INFO L87 Difference]: Start difference. First operand 24904 states and 25463 transitions. Second operand has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 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-09 00:02:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:33,909 INFO L93 Difference]: Finished difference Result 53109 states and 54328 transitions. [2025-01-09 00:02:33,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:33,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 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 1364 [2025-01-09 00:02:33,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:33,936 INFO L225 Difference]: With dead ends: 53109 [2025-01-09 00:02:33,937 INFO L226 Difference]: Without dead ends: 28805 [2025-01-09 00:02:33,952 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-09 00:02:33,953 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 36 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:33,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 522 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:02:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28805 states. [2025-01-09 00:02:34,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28805 to 25809. [2025-01-09 00:02:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25809 states, 25808 states have (on average 1.0204587724736516) internal successors, (26336), 25808 states have internal predecessors, (26336), 0 states have call successors, (0), 0 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-09 00:02:34,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25809 states to 25809 states and 26336 transitions. [2025-01-09 00:02:34,150 INFO L78 Accepts]: Start accepts. Automaton has 25809 states and 26336 transitions. Word has length 1364 [2025-01-09 00:02:34,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:34,151 INFO L471 AbstractCegarLoop]: Abstraction has 25809 states and 26336 transitions. [2025-01-09 00:02:34,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 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-09 00:02:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 25809 states and 26336 transitions. [2025-01-09 00:02:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1378 [2025-01-09 00:02:34,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:34,175 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:02:34,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:02:34,175 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:34,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:34,176 INFO L85 PathProgramCache]: Analyzing trace with hash -93416991, now seen corresponding path program 1 times [2025-01-09 00:02:34,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:34,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018256087] [2025-01-09 00:02:34,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:34,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1377 statements into 1 equivalence classes. [2025-01-09 00:02:34,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1377 of 1377 statements. [2025-01-09 00:02:34,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:34,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3657 backedges. 2509 proven. 0 refuted. 0 times theorem prover too weak. 1148 trivial. 0 not checked. [2025-01-09 00:02:34,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:34,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018256087] [2025-01-09 00:02:34,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018256087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:34,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:34,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:34,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661069340] [2025-01-09 00:02:34,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:34,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:34,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:34,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:34,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:34,840 INFO L87 Difference]: Start difference. First operand 25809 states and 26336 transitions. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 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-09 00:02:35,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:35,481 INFO L93 Difference]: Finished difference Result 40205 states and 41003 transitions. [2025-01-09 00:02:35,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:35,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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 1377 [2025-01-09 00:02:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:35,482 INFO L225 Difference]: With dead ends: 40205 [2025-01-09 00:02:35,482 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:02:35,494 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-09 00:02:35,497 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 228 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:35,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 356 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:02:35,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:02:35,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:02:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 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-09 00:02:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:02:35,498 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1377 [2025-01-09 00:02:35,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:35,498 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:02:35,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 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-09 00:02:35,499 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:02:35,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:02:35,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:02:35,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 00:02:35,511 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:02:35,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:02:38,518 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:02:38,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:02:38 BoogieIcfgContainer [2025-01-09 00:02:38,577 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:02:38,577 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:02:38,577 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:02:38,577 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:02:38,578 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:01:30" (3/4) ... [2025-01-09 00:02:38,584 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:02:38,627 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 00:02:38,628 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:02:38,630 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:02:38,631 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:02:38,849 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:02:38,850 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:02:38,850 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:02:38,850 INFO L158 Benchmark]: Toolchain (without parser) took 71738.31ms. Allocated memory was 201.3MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 150.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 332.3MB. Max. memory is 16.1GB. [2025-01-09 00:02:38,852 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 209.7MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:02:38,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 894.15ms. Allocated memory is still 201.3MB. Free memory was 150.1MB in the beginning and 76.3MB in the end (delta: 73.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-01-09 00:02:38,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 204.53ms. Allocated memory is still 201.3MB. Free memory was 76.3MB in the beginning and 125.1MB in the end (delta: -48.8MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2025-01-09 00:02:38,852 INFO L158 Benchmark]: Boogie Preprocessor took 263.83ms. Allocated memory is still 201.3MB. Free memory was 125.1MB in the beginning and 68.0MB in the end (delta: 57.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 00:02:38,853 INFO L158 Benchmark]: RCFGBuilder took 2275.70ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 68.0MB in the beginning and 169.6MB in the end (delta: -101.6MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2025-01-09 00:02:38,853 INFO L158 Benchmark]: TraceAbstraction took 67819.49ms. Allocated memory was 293.6MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 169.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 916.2MB. Max. memory is 16.1GB. [2025-01-09 00:02:38,853 INFO L158 Benchmark]: Witness Printer took 272.46ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 00:02:38,854 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 209.7MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 894.15ms. Allocated memory is still 201.3MB. Free memory was 150.1MB in the beginning and 76.3MB in the end (delta: 73.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 204.53ms. Allocated memory is still 201.3MB. Free memory was 76.3MB in the beginning and 125.1MB in the end (delta: -48.8MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 263.83ms. Allocated memory is still 201.3MB. Free memory was 125.1MB in the beginning and 68.0MB in the end (delta: 57.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2275.70ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 68.0MB in the beginning and 169.6MB in the end (delta: -101.6MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. * TraceAbstraction took 67819.49ms. Allocated memory was 293.6MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 169.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 916.2MB. Max. memory is 16.1GB. * Witness Printer took 272.46ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 203]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.7s, OverallIterations: 22, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 42.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14510 SdHoareTripleChecker+Valid, 38.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14510 mSDsluCounter, 8793 SdHoareTripleChecker+Invalid, 32.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1305 mSDsCounter, 5228 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40116 IncrementalHoareTripleChecker+Invalid, 45344 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5228 mSolverCounterUnsat, 7488 mSDtfsCounter, 40116 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4398 GetRequests, 4298 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26122occurred in iteration=16, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 32545 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 16986 NumberOfCodeBlocks, 16986 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 18246 ConstructedInterpolants, 0 QuantifiedInterpolants, 51015 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3627 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 27053/27973 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((2 == a2) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0)) || ((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 4))) || (((0 <= ((long long) a29 + 15)) && (((long long) 89 + a4) <= 0)) && (3 == a2))) || (((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (5 <= a2)) && (0 <= ((long long) 141 + a0))) && (0 <= ((long long) a29 + 192415)))) || ((((((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (a2 == 1)) && (a29 <= 43)) && (((long long) a0 + 61) <= 0)) && (0 <= ((long long) a29 + 192415)))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || ((((((long long) 89 + a4) <= 0) && (5 <= a2)) && (((long long) a29 + 173705) <= 0)) && (((long long) a0 + 61) <= 0))) || (((((long long) 104 + a0) <= 0) && (2 == a2)) && (44 <= a29))) || (((((((long long) 148 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (3 == a2))) || (((0 <= ((long long) a29 + 15)) && (((long long) 89 + a4) <= 0)) && (5 <= a2))) || (((((((long long) 148 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= (168807 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (a2 == 1)) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168807 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))))) || ((((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= (168807 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (0 <= ((long long) 146 + a0))) && (a2 == 1)) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168807 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))))) || ((((2 == a2) && (((long long) 89 + a4) <= 0)) && (0 <= (168807 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168807 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))))) || ((((((long long) 89 + a4) <= 0) && (a2 == 4)) && (a29 <= 43)) && (0 <= ((long long) a29 + 192415)))) || (((((((long long) 148 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 192415)))) || ((((((long long) 148 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (a2 == 4)) && (0 <= ((long long) a29 + 192415)))) || (((((((long long) 89 + a4) <= 0) && (0 <= (168807 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168807 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)))))) && (3 == a2)) && (((long long) a29 + 127) <= 0))) || ((((((((long long) 42 + a4) <= 0) && (0 <= (168807 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (((long long) 98 + a0) <= 0)) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168807 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)))))) && (3 == a2)) && (a29 <= 43))) || ((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (44 <= a29)) && (5 <= a2))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) 98 + a0) <= 0))) || (((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && ((((0 <= ((long long) a4 + 85)) && (0 <= ((long long) a29 + 15))) && (5 <= a2)) || ((195722 <= a29) && (5 <= a2))))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (44 <= a29)) && (((long long) 98 + a0) <= 0))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (((long long) a0 + 61) <= 0))) || ((((((((long long) 42 + a4) <= 0) && (0 <= (168807 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 141 + a0))) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168807 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)))))) && (3 == a2))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || ((((134656 <= a29) && (((long long) 148 + a0) <= 0)) && (((long long) 42 + a4) <= 0)) && (3 == a2))) || (((((((long long) 89 + a4) <= 0) && (0 <= (168807 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (a2 == 4)) && (((long long) a29 + 173705) <= 0)) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168807 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))))) || ((((((a2 == 1) && (((long long) a0 + 61) <= 0)) || ((0 <= ((long long) a4 + 85)) && (a2 == 1))) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a29 + 15))) && (a29 <= 43))) || ((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (5 <= a2))) || ((((((((long long) 148 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (0 <= (168807 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (a2 == 4)) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168807 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))))) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (0 <= ((long long) 44 + a0))) && (((long long) a29 + 127) == 0))) || (((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (a2 == 1)) && (0 <= ((long long) 141 + a0))) && (0 <= ((long long) a29 + 192415)))) || (((((long long) 89 + a4) <= 0) && (3 == a2)) && (((long long) a0 + 61) <= 0))) || ((((((long long) 89 + a4) <= 0) && (0 <= ((long long) 146 + a0))) && (5 <= a2)) && (((long long) a0 + 61) <= 0))) || ((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a29 + 15))) && (a2 == 4))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:02:38,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE