./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label48.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/Problem17_label48.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 0d929df4a838f03b0a70e3f4a24ac63ec6782a4f298757e5a2174a7cc8e9071c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:14:42,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:14:42,620 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:14:42,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:14:42,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:14:42,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:14:42,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:14:42,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:14:42,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:14:42,654 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:14:42,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:14:42,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:14:42,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:14:42,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:14:42,655 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:14:42,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:14:42,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:14:42,655 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:14:42,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:14:42,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:14:42,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:14:42,656 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:14:42,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:14:42,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:14:42,656 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:14:42,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:14:42,656 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:14:42,656 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:14:42,657 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:14:42,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:14:42,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:14:42,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:14:42,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:14:42,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:14:42,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:14:42,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:14:42,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:14:42,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:14:42,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:14:42,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:14:42,658 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:14:42,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:14:42,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:14:42,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:14:42,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:14:42,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:14:42,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:14:42,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:14:42,658 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 -> 0d929df4a838f03b0a70e3f4a24ac63ec6782a4f298757e5a2174a7cc8e9071c [2025-01-09 00:14:42,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:14:42,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:14:42,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:14:42,999 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:14:43,000 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:14:43,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label48.c [2025-01-09 00:14:44,145 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b109efcf4/60130097711e49008f61bd9aef968628/FLAG649873c74 [2025-01-09 00:14:44,462 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:14:44,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label48.c [2025-01-09 00:14:44,488 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b109efcf4/60130097711e49008f61bd9aef968628/FLAG649873c74 [2025-01-09 00:14:44,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b109efcf4/60130097711e49008f61bd9aef968628 [2025-01-09 00:14:44,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:14:44,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:14:44,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:14:44,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:14:44,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:14:44,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:14:44" (1/1) ... [2025-01-09 00:14:44,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3466a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:44, skipping insertion in model container [2025-01-09 00:14:44,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:14:44" (1/1) ... [2025-01-09 00:14:44,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:14:44,721 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/Problem17_label48.c[6493,6506] [2025-01-09 00:14:45,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:14:45,030 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:14:45,042 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/Problem17_label48.c[6493,6506] [2025-01-09 00:14:45,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:14:45,292 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:14:45,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:45 WrapperNode [2025-01-09 00:14:45,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:14:45,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:14:45,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:14:45,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:14:45,303 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:14:45" (1/1) ... [2025-01-09 00:14:45,336 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:14:45" (1/1) ... [2025-01-09 00:14:45,609 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:14:45,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:14:45,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:14:45,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:14:45,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:14:45,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:45" (1/1) ... [2025-01-09 00:14:45,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:45" (1/1) ... [2025-01-09 00:14:45,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:45" (1/1) ... [2025-01-09 00:14:45,833 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:14:45,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:45" (1/1) ... [2025-01-09 00:14:45,838 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:45" (1/1) ... [2025-01-09 00:14:45,983 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:45" (1/1) ... [2025-01-09 00:14:46,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:45" (1/1) ... [2025-01-09 00:14:46,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:45" (1/1) ... [2025-01-09 00:14:46,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:45" (1/1) ... [2025-01-09 00:14:46,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:45" (1/1) ... [2025-01-09 00:14:46,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:14:46,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:14:46,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:14:46,099 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:14:46,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:45" (1/1) ... [2025-01-09 00:14:46,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:14:46,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:14:46,123 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:14:46,125 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:14:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:14:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:14:46,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:14:46,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:14:46,182 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:14:46,184 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:14:48,649 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:14:48,649 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:14:48,676 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:14:48,677 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:14:48,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:14:48 BoogieIcfgContainer [2025-01-09 00:14:48,680 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:14:48,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:14:48,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:14:48,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:14:48,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:14:44" (1/3) ... [2025-01-09 00:14:48,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8bfa5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:14:48, skipping insertion in model container [2025-01-09 00:14:48,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:45" (2/3) ... [2025-01-09 00:14:48,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8bfa5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:14:48, skipping insertion in model container [2025-01-09 00:14:48,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:14:48" (3/3) ... [2025-01-09 00:14:48,688 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label48.c [2025-01-09 00:14:48,699 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:14:48,701 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label48.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:14:48,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:14:48,782 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;@6597ba73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:14:48,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:14:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 00:14:48,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:48,795 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] [2025-01-09 00:14:48,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:48,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:48,803 INFO L85 PathProgramCache]: Analyzing trace with hash -23576676, now seen corresponding path program 1 times [2025-01-09 00:14:48,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:48,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083874872] [2025-01-09 00:14:48,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:48,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:48,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 00:14:48,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 00:14:48,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:48,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:49,026 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:14:49,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:49,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083874872] [2025-01-09 00:14:49,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083874872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:49,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:49,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:49,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383392828] [2025-01-09 00:14:49,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:49,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:49,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:49,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:49,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:49,043 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 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:14:50,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:50,986 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-01-09 00:14:50,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:50,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-01-09 00:14:50,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:50,997 INFO L225 Difference]: With dead ends: 1644 [2025-01-09 00:14:50,998 INFO L226 Difference]: Without dead ends: 977 [2025-01-09 00:14:51,002 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:14:51,004 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 445 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:51,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:14:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-01-09 00:14:51,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-01-09 00:14:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 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:14:51,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-01-09 00:14:51,064 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 43 [2025-01-09 00:14:51,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:51,064 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-01-09 00:14:51,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 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:14:51,065 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-01-09 00:14:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 00:14:51,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:51,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:51,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:14:51,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:51,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:51,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1814925322, now seen corresponding path program 1 times [2025-01-09 00:14:51,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:51,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103103275] [2025-01-09 00:14:51,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:51,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:51,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 00:14:51,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 00:14:51,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:51,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:51,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:51,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103103275] [2025-01-09 00:14:51,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103103275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:51,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:51,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:51,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014337699] [2025-01-09 00:14:51,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:51,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:51,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:51,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:51,395 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:14:53,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:53,366 INFO L93 Difference]: Finished difference Result 2846 states and 4429 transitions. [2025-01-09 00:14:53,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:53,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-01-09 00:14:53,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:53,373 INFO L225 Difference]: With dead ends: 2846 [2025-01-09 00:14:53,373 INFO L226 Difference]: Without dead ends: 1877 [2025-01-09 00:14:53,374 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:14:53,374 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 444 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:53,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 241 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:14:53,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2025-01-09 00:14:53,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1854. [2025-01-09 00:14:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 1.489476524554776) internal successors, (2760), 1853 states have internal predecessors, (2760), 0 states have call successors, (0), 0 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:14:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2760 transitions. [2025-01-09 00:14:53,402 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2760 transitions. Word has length 110 [2025-01-09 00:14:53,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:53,403 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2760 transitions. [2025-01-09 00:14:53,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:14:53,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2760 transitions. [2025-01-09 00:14:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 00:14:53,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:53,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:53,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:14:53,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:53,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:53,405 INFO L85 PathProgramCache]: Analyzing trace with hash -319316241, now seen corresponding path program 1 times [2025-01-09 00:14:53,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:53,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522714313] [2025-01-09 00:14:53,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:53,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:53,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 00:14:53,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 00:14:53,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:53,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:53,647 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:53,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:53,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522714313] [2025-01-09 00:14:53,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522714313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:53,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:53,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:53,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225534842] [2025-01-09 00:14:53,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:53,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:14:53,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:53,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:14:53,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:14:53,652 INFO L87 Difference]: Start difference. First operand 1854 states and 2760 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:14:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:56,329 INFO L93 Difference]: Finished difference Result 6348 states and 9546 transitions. [2025-01-09 00:14:56,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:14:56,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-01-09 00:14:56,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:56,353 INFO L225 Difference]: With dead ends: 6348 [2025-01-09 00:14:56,357 INFO L226 Difference]: Without dead ends: 4496 [2025-01-09 00:14:56,360 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:14:56,364 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 897 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2656 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 3249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:56,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 371 Invalid, 3249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2656 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 00:14:56,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4496 states. [2025-01-09 00:14:56,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4496 to 2723. [2025-01-09 00:14:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2723 states, 2722 states have (on average 1.4246877296105804) internal successors, (3878), 2722 states have internal predecessors, (3878), 0 states have call successors, (0), 0 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:14:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3878 transitions. [2025-01-09 00:14:56,475 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3878 transitions. Word has length 113 [2025-01-09 00:14:56,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:56,477 INFO L471 AbstractCegarLoop]: Abstraction has 2723 states and 3878 transitions. [2025-01-09 00:14:56,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:14:56,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3878 transitions. [2025-01-09 00:14:56,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 00:14:56,480 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:56,480 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:56,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:14:56,480 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:56,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:56,481 INFO L85 PathProgramCache]: Analyzing trace with hash 476507934, now seen corresponding path program 1 times [2025-01-09 00:14:56,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:56,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573998375] [2025-01-09 00:14:56,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:56,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:56,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 00:14:56,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 00:14:56,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:56,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:56,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:56,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573998375] [2025-01-09 00:14:56,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573998375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:56,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:56,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:56,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094185630] [2025-01-09 00:14:56,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:56,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:56,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:56,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:56,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:56,635 INFO L87 Difference]: Start difference. First operand 2723 states and 3878 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:58,360 INFO L93 Difference]: Finished difference Result 6735 states and 9619 transitions. [2025-01-09 00:14:58,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:58,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-01-09 00:14:58,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:58,377 INFO L225 Difference]: With dead ends: 6735 [2025-01-09 00:14:58,381 INFO L226 Difference]: Without dead ends: 4014 [2025-01-09 00:14:58,384 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:14:58,388 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 370 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:58,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 559 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:14:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4014 states. [2025-01-09 00:14:58,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4014 to 4010. [2025-01-09 00:14:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4010 states, 4009 states have (on average 1.3130456472935894) internal successors, (5264), 4009 states have internal predecessors, (5264), 0 states have call successors, (0), 0 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:14:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 5264 transitions. [2025-01-09 00:14:58,494 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 5264 transitions. Word has length 118 [2025-01-09 00:14:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:58,495 INFO L471 AbstractCegarLoop]: Abstraction has 4010 states and 5264 transitions. [2025-01-09 00:14:58,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 5264 transitions. [2025-01-09 00:14:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 00:14:58,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:58,502 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, 2, 2, 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:14:58,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:14:58,502 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:58,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:58,503 INFO L85 PathProgramCache]: Analyzing trace with hash -518314824, now seen corresponding path program 1 times [2025-01-09 00:14:58,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:58,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731302307] [2025-01-09 00:14:58,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:58,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:58,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 00:14:58,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 00:14:58,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:58,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-01-09 00:14:58,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:58,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731302307] [2025-01-09 00:14:58,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731302307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:58,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:58,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:58,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882158777] [2025-01-09 00:14:58,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:58,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:58,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:58,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:58,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:58,725 INFO L87 Difference]: Start difference. First operand 4010 states and 5264 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:15:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:00,189 INFO L93 Difference]: Finished difference Result 11004 states and 14655 transitions. [2025-01-09 00:15:00,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:00,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 179 [2025-01-09 00:15:00,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:00,203 INFO L225 Difference]: With dead ends: 11004 [2025-01-09 00:15:00,204 INFO L226 Difference]: Without dead ends: 6563 [2025-01-09 00:15:00,208 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:15:00,209 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:00,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:15:00,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6563 states. [2025-01-09 00:15:00,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6563 to 5287. [2025-01-09 00:15:00,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5287 states, 5286 states have (on average 1.199205448354143) internal successors, (6339), 5286 states have internal predecessors, (6339), 0 states have call successors, (0), 0 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:15:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5287 states to 5287 states and 6339 transitions. [2025-01-09 00:15:00,268 INFO L78 Accepts]: Start accepts. Automaton has 5287 states and 6339 transitions. Word has length 179 [2025-01-09 00:15:00,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:00,268 INFO L471 AbstractCegarLoop]: Abstraction has 5287 states and 6339 transitions. [2025-01-09 00:15:00,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:15:00,269 INFO L276 IsEmpty]: Start isEmpty. Operand 5287 states and 6339 transitions. [2025-01-09 00:15:00,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-09 00:15:00,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:00,270 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, 2, 2, 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:15:00,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:15:00,271 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:00,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:00,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2076104005, now seen corresponding path program 1 times [2025-01-09 00:15:00,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:00,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820222160] [2025-01-09 00:15:00,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:00,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:00,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 00:15:00,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 00:15:00,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:00,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:00,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:00,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820222160] [2025-01-09 00:15:00,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820222160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:00,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:00,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:00,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807906182] [2025-01-09 00:15:00,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:00,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:00,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:00,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:00,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:00,467 INFO L87 Difference]: Start difference. First operand 5287 states and 6339 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:01,915 INFO L93 Difference]: Finished difference Result 13557 states and 16608 transitions. [2025-01-09 00:15:01,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:01,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2025-01-09 00:15:01,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:01,966 INFO L225 Difference]: With dead ends: 13557 [2025-01-09 00:15:01,966 INFO L226 Difference]: Without dead ends: 8272 [2025-01-09 00:15:01,970 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:15:01,972 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 499 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:01,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 798 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:15:01,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8272 states. [2025-01-09 00:15:02,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8272 to 8272. [2025-01-09 00:15:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8272 states, 8271 states have (on average 1.1866763390158386) internal successors, (9815), 8271 states have internal predecessors, (9815), 0 states have call successors, (0), 0 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:15:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8272 states to 8272 states and 9815 transitions. [2025-01-09 00:15:02,121 INFO L78 Accepts]: Start accepts. Automaton has 8272 states and 9815 transitions. Word has length 192 [2025-01-09 00:15:02,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:02,121 INFO L471 AbstractCegarLoop]: Abstraction has 8272 states and 9815 transitions. [2025-01-09 00:15:02,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:02,121 INFO L276 IsEmpty]: Start isEmpty. Operand 8272 states and 9815 transitions. [2025-01-09 00:15:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 00:15:02,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:02,124 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:02,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:15:02,124 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:02,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:02,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1433583806, now seen corresponding path program 1 times [2025-01-09 00:15:02,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:02,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67455368] [2025-01-09 00:15:02,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:02,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:02,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 00:15:02,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 00:15:02,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:02,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-09 00:15:02,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:02,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67455368] [2025-01-09 00:15:02,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67455368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:02,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:02,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:02,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694727518] [2025-01-09 00:15:02,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:02,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:02,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:02,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:02,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:02,334 INFO L87 Difference]: Start difference. First operand 8272 states and 9815 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:15:04,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:04,080 INFO L93 Difference]: Finished difference Result 20404 states and 24582 transitions. [2025-01-09 00:15:04,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:04,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 197 [2025-01-09 00:15:04,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:04,101 INFO L225 Difference]: With dead ends: 20404 [2025-01-09 00:15:04,102 INFO L226 Difference]: Without dead ends: 12134 [2025-01-09 00:15:04,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:04,108 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 477 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:04,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 446 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:15:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12134 states. [2025-01-09 00:15:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12134 to 11263. [2025-01-09 00:15:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11263 states, 11262 states have (on average 1.2128396377197657) internal successors, (13659), 11262 states have internal predecessors, (13659), 0 states have call successors, (0), 0 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:15:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11263 states to 11263 states and 13659 transitions. [2025-01-09 00:15:04,218 INFO L78 Accepts]: Start accepts. Automaton has 11263 states and 13659 transitions. Word has length 197 [2025-01-09 00:15:04,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:04,218 INFO L471 AbstractCegarLoop]: Abstraction has 11263 states and 13659 transitions. [2025-01-09 00:15:04,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:15:04,223 INFO L276 IsEmpty]: Start isEmpty. Operand 11263 states and 13659 transitions. [2025-01-09 00:15:04,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-01-09 00:15:04,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:04,225 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:15:04,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:15:04,225 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:04,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:04,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2012732723, now seen corresponding path program 1 times [2025-01-09 00:15:04,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:04,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625436090] [2025-01-09 00:15:04,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:04,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:04,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-01-09 00:15:04,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-01-09 00:15:04,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:04,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:15:04,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:04,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625436090] [2025-01-09 00:15:04,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625436090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:04,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:04,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:04,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840881752] [2025-01-09 00:15:04,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:04,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:04,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:04,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:04,368 INFO L87 Difference]: Start difference. First operand 11263 states and 13659 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 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:15:06,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:06,070 INFO L93 Difference]: Finished difference Result 26356 states and 32226 transitions. [2025-01-09 00:15:06,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:06,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 242 [2025-01-09 00:15:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:06,090 INFO L225 Difference]: With dead ends: 26356 [2025-01-09 00:15:06,090 INFO L226 Difference]: Without dead ends: 15095 [2025-01-09 00:15:06,098 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:15:06,099 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 460 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:06,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 410 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:15:06,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15095 states. [2025-01-09 00:15:06,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15095 to 11246. [2025-01-09 00:15:06,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11246 states, 11245 states have (on average 1.2122721209426413) internal successors, (13632), 11245 states have internal predecessors, (13632), 0 states have call successors, (0), 0 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:15:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11246 states to 11246 states and 13632 transitions. [2025-01-09 00:15:06,193 INFO L78 Accepts]: Start accepts. Automaton has 11246 states and 13632 transitions. Word has length 242 [2025-01-09 00:15:06,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:06,194 INFO L471 AbstractCegarLoop]: Abstraction has 11246 states and 13632 transitions. [2025-01-09 00:15:06,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 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:15:06,195 INFO L276 IsEmpty]: Start isEmpty. Operand 11246 states and 13632 transitions. [2025-01-09 00:15:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-01-09 00:15:06,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:06,199 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:15:06,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:15:06,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:06,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:06,200 INFO L85 PathProgramCache]: Analyzing trace with hash 823971534, now seen corresponding path program 1 times [2025-01-09 00:15:06,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:06,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901043675] [2025-01-09 00:15:06,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:06,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:06,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-01-09 00:15:06,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-01-09 00:15:06,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:06,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:06,409 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:06,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:06,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901043675] [2025-01-09 00:15:06,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901043675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:06,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:06,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:06,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678682712] [2025-01-09 00:15:06,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:06,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:06,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:06,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:06,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:06,412 INFO L87 Difference]: Start difference. First operand 11246 states and 13632 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 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:15:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:07,979 INFO L93 Difference]: Finished difference Result 25927 states and 31650 transitions. [2025-01-09 00:15:07,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:07,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2025-01-09 00:15:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:08,002 INFO L225 Difference]: With dead ends: 25927 [2025-01-09 00:15:08,003 INFO L226 Difference]: Without dead ends: 14683 [2025-01-09 00:15:08,010 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:15:08,014 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 356 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:08,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 885 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:15:08,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14683 states. [2025-01-09 00:15:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14683 to 14250. [2025-01-09 00:15:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14250 states, 14249 states have (on average 1.1910309495403186) internal successors, (16971), 14249 states have internal predecessors, (16971), 0 states have call successors, (0), 0 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:15:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14250 states to 14250 states and 16971 transitions. [2025-01-09 00:15:08,166 INFO L78 Accepts]: Start accepts. Automaton has 14250 states and 16971 transitions. Word has length 259 [2025-01-09 00:15:08,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:08,166 INFO L471 AbstractCegarLoop]: Abstraction has 14250 states and 16971 transitions. [2025-01-09 00:15:08,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 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:15:08,166 INFO L276 IsEmpty]: Start isEmpty. Operand 14250 states and 16971 transitions. [2025-01-09 00:15:08,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-01-09 00:15:08,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:08,169 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:08,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:15:08,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:08,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:08,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1720504687, now seen corresponding path program 1 times [2025-01-09 00:15:08,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:08,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083193107] [2025-01-09 00:15:08,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:08,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:08,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-09 00:15:08,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-09 00:15:08,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:08,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 220 proven. 70 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 00:15:08,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:08,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083193107] [2025-01-09 00:15:08,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083193107] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:15:08,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462066092] [2025-01-09 00:15:08,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:08,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:15:08,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:15:08,456 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:15:08,459 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:15:08,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-09 00:15:08,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-09 00:15:08,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:08,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:08,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:15:08,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:15:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 220 proven. 70 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 00:15:08,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:15:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 00:15:08,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462066092] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:15:08,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:15:08,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-09 00:15:08,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531540194] [2025-01-09 00:15:08,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:09,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:09,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:09,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:09,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:15:09,000 INFO L87 Difference]: Start difference. First operand 14250 states and 16971 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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:15:11,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:11,763 INFO L93 Difference]: Finished difference Result 42578 states and 51035 transitions. [2025-01-09 00:15:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:11,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 267 [2025-01-09 00:15:11,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:11,796 INFO L225 Difference]: With dead ends: 42578 [2025-01-09 00:15:11,796 INFO L226 Difference]: Without dead ends: 26173 [2025-01-09 00:15:11,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:15:11,811 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 1093 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2265 mSolverCounterSat, 1398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 3663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1398 IncrementalHoareTripleChecker+Valid, 2265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:11,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 150 Invalid, 3663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1398 Valid, 2265 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 00:15:11,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26173 states. [2025-01-09 00:15:11,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26173 to 25743. [2025-01-09 00:15:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25743 states, 25742 states have (on average 1.1495998756895347) internal successors, (29593), 25742 states have internal predecessors, (29593), 0 states have call successors, (0), 0 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:15:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25743 states to 25743 states and 29593 transitions. [2025-01-09 00:15:12,147 INFO L78 Accepts]: Start accepts. Automaton has 25743 states and 29593 transitions. Word has length 267 [2025-01-09 00:15:12,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:12,147 INFO L471 AbstractCegarLoop]: Abstraction has 25743 states and 29593 transitions. [2025-01-09 00:15:12,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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:15:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand 25743 states and 29593 transitions. [2025-01-09 00:15:12,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-01-09 00:15:12,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:12,157 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:12,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 00:15:12,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 00:15:12,358 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:12,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:12,360 INFO L85 PathProgramCache]: Analyzing trace with hash 992837099, now seen corresponding path program 1 times [2025-01-09 00:15:12,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:12,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658228053] [2025-01-09 00:15:12,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:12,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:12,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-01-09 00:15:12,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-01-09 00:15:12,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:12,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-01-09 00:15:12,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:12,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658228053] [2025-01-09 00:15:12,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658228053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:12,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:12,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:12,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251917615] [2025-01-09 00:15:12,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:12,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:12,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:12,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:12,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:12,528 INFO L87 Difference]: Start difference. First operand 25743 states and 29593 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 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:15:13,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:13,919 INFO L93 Difference]: Finished difference Result 59576 states and 67991 transitions. [2025-01-09 00:15:13,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:13,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 361 [2025-01-09 00:15:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:13,956 INFO L225 Difference]: With dead ends: 59576 [2025-01-09 00:15:13,956 INFO L226 Difference]: Without dead ends: 33835 [2025-01-09 00:15:13,973 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:15:13,974 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 487 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:13,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 278 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:15:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33835 states. [2025-01-09 00:15:14,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33835 to 33387. [2025-01-09 00:15:14,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33387 states, 33386 states have (on average 1.1281375426825615) internal successors, (37664), 33386 states have internal predecessors, (37664), 0 states have call successors, (0), 0 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:15:14,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33387 states to 33387 states and 37664 transitions. [2025-01-09 00:15:14,275 INFO L78 Accepts]: Start accepts. Automaton has 33387 states and 37664 transitions. Word has length 361 [2025-01-09 00:15:14,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:14,275 INFO L471 AbstractCegarLoop]: Abstraction has 33387 states and 37664 transitions. [2025-01-09 00:15:14,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 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:15:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 33387 states and 37664 transitions. [2025-01-09 00:15:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-01-09 00:15:14,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:14,281 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:14,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:15:14,282 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:14,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2074921664, now seen corresponding path program 1 times [2025-01-09 00:15:14,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:14,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266864688] [2025-01-09 00:15:14,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:14,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:14,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-01-09 00:15:14,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-09 00:15:14,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:14,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 00:15:14,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:14,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266864688] [2025-01-09 00:15:14,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266864688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:14,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:14,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:14,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982156248] [2025-01-09 00:15:14,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:14,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:14,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:14,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:14,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:14,565 INFO L87 Difference]: Start difference. First operand 33387 states and 37664 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:15,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:15,999 INFO L93 Difference]: Finished difference Result 73991 states and 83683 transitions. [2025-01-09 00:15:15,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:16,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 382 [2025-01-09 00:15:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:16,038 INFO L225 Difference]: With dead ends: 73991 [2025-01-09 00:15:16,038 INFO L226 Difference]: Without dead ends: 40606 [2025-01-09 00:15:16,058 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:15:16,059 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 272 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:16,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 792 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:15:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40606 states. [2025-01-09 00:15:16,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40606 to 40606. [2025-01-09 00:15:16,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40606 states, 40605 states have (on average 1.111193202807536) internal successors, (45120), 40605 states have internal predecessors, (45120), 0 states have call successors, (0), 0 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:15:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40606 states to 40606 states and 45120 transitions. [2025-01-09 00:15:16,425 INFO L78 Accepts]: Start accepts. Automaton has 40606 states and 45120 transitions. Word has length 382 [2025-01-09 00:15:16,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:16,425 INFO L471 AbstractCegarLoop]: Abstraction has 40606 states and 45120 transitions. [2025-01-09 00:15:16,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 40606 states and 45120 transitions. [2025-01-09 00:15:16,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-01-09 00:15:16,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:16,432 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:15:16,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:15:16,433 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:16,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:16,433 INFO L85 PathProgramCache]: Analyzing trace with hash 820272656, now seen corresponding path program 1 times [2025-01-09 00:15:16,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:16,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108974315] [2025-01-09 00:15:16,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:16,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:16,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-01-09 00:15:16,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-01-09 00:15:16,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:16,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:15:16,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:16,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108974315] [2025-01-09 00:15:16,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108974315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:16,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:16,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:16,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81430014] [2025-01-09 00:15:16,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:16,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:16,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:16,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:16,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:16,697 INFO L87 Difference]: Start difference. First operand 40606 states and 45120 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 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:15:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:18,122 INFO L93 Difference]: Finished difference Result 91878 states and 102015 transitions. [2025-01-09 00:15:18,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:18,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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 405 [2025-01-09 00:15:18,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:18,179 INFO L225 Difference]: With dead ends: 91878 [2025-01-09 00:15:18,179 INFO L226 Difference]: Without dead ends: 51274 [2025-01-09 00:15:18,205 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:15:18,206 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 336 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:18,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 638 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:15:18,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51274 states. [2025-01-09 00:15:18,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51274 to 49119. [2025-01-09 00:15:18,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49119 states, 49118 states have (on average 1.110631540372165) internal successors, (54552), 49118 states have internal predecessors, (54552), 0 states have call successors, (0), 0 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:15:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49119 states to 49119 states and 54552 transitions. [2025-01-09 00:15:18,831 INFO L78 Accepts]: Start accepts. Automaton has 49119 states and 54552 transitions. Word has length 405 [2025-01-09 00:15:18,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:18,832 INFO L471 AbstractCegarLoop]: Abstraction has 49119 states and 54552 transitions. [2025-01-09 00:15:18,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 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:15:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 49119 states and 54552 transitions. [2025-01-09 00:15:18,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-01-09 00:15:18,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:18,846 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:18,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:15:18,846 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:18,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:18,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1931520015, now seen corresponding path program 1 times [2025-01-09 00:15:18,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:18,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625123198] [2025-01-09 00:15:18,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:18,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:18,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-01-09 00:15:18,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-01-09 00:15:18,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:18,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:15:19,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:19,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625123198] [2025-01-09 00:15:19,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625123198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:19,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:19,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:15:19,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683704902] [2025-01-09 00:15:19,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:19,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:19,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:19,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:19,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:15:19,563 INFO L87 Difference]: Start difference. First operand 49119 states and 54552 transitions. Second operand has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 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:15:22,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:22,149 INFO L93 Difference]: Finished difference Result 124236 states and 137631 transitions. [2025-01-09 00:15:22,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:22,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 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 448 [2025-01-09 00:15:22,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:22,240 INFO L225 Difference]: With dead ends: 124236 [2025-01-09 00:15:22,240 INFO L226 Difference]: Without dead ends: 74694 [2025-01-09 00:15:22,280 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:15:22,280 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 780 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 2523 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 2982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 2523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:22,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 161 Invalid, 2982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 2523 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:15:22,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74694 states. [2025-01-09 00:15:22,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74694 to 66129. [2025-01-09 00:15:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66129 states, 66128 states have (on average 1.1040860150012097) internal successors, (73011), 66128 states have internal predecessors, (73011), 0 states have call successors, (0), 0 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:15:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66129 states to 66129 states and 73011 transitions. [2025-01-09 00:15:22,990 INFO L78 Accepts]: Start accepts. Automaton has 66129 states and 73011 transitions. Word has length 448 [2025-01-09 00:15:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:22,990 INFO L471 AbstractCegarLoop]: Abstraction has 66129 states and 73011 transitions. [2025-01-09 00:15:22,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 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:15:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 66129 states and 73011 transitions. [2025-01-09 00:15:22,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-01-09 00:15:22,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:23,000 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:15:23,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:15:23,000 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:23,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:23,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1985979724, now seen corresponding path program 1 times [2025-01-09 00:15:23,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:23,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546797914] [2025-01-09 00:15:23,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:23,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:23,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-01-09 00:15:23,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-01-09 00:15:23,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:23,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:23,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:23,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546797914] [2025-01-09 00:15:23,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546797914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:23,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:23,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 00:15:23,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253408113] [2025-01-09 00:15:23,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:23,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:15:23,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:23,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:15:23,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:15:23,541 INFO L87 Difference]: Start difference. First operand 66129 states and 73011 transitions. Second operand has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 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:15:26,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:26,463 INFO L93 Difference]: Finished difference Result 154430 states and 170970 transitions. [2025-01-09 00:15:26,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:15:26,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 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 455 [2025-01-09 00:15:26,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:26,553 INFO L225 Difference]: With dead ends: 154430 [2025-01-09 00:15:26,553 INFO L226 Difference]: Without dead ends: 88303 [2025-01-09 00:15:26,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:15:26,594 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 1082 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 3247 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 3247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:26,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 192 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 3247 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 00:15:26,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88303 states. [2025-01-09 00:15:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88303 to 79354. [2025-01-09 00:15:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79354 states, 79353 states have (on average 1.1123713029123032) internal successors, (88270), 79353 states have internal predecessors, (88270), 0 states have call successors, (0), 0 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:15:27,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79354 states to 79354 states and 88270 transitions. [2025-01-09 00:15:27,440 INFO L78 Accepts]: Start accepts. Automaton has 79354 states and 88270 transitions. Word has length 455 [2025-01-09 00:15:27,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:27,440 INFO L471 AbstractCegarLoop]: Abstraction has 79354 states and 88270 transitions. [2025-01-09 00:15:27,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 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:15:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 79354 states and 88270 transitions. [2025-01-09 00:15:27,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-01-09 00:15:27,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:27,448 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:27,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:15:27,449 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:27,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:27,450 INFO L85 PathProgramCache]: Analyzing trace with hash -677057193, now seen corresponding path program 1 times [2025-01-09 00:15:27,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:27,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090963030] [2025-01-09 00:15:27,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:27,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:27,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-01-09 00:15:27,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-01-09 00:15:27,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:27,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 543 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-01-09 00:15:27,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:27,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090963030] [2025-01-09 00:15:27,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090963030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:27,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:27,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:15:27,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202822318] [2025-01-09 00:15:27,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:27,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:27,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:27,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:27,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:27,735 INFO L87 Difference]: Start difference. First operand 79354 states and 88270 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 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:15:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:29,086 INFO L93 Difference]: Finished difference Result 156569 states and 174000 transitions. [2025-01-09 00:15:29,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:29,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 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 469 [2025-01-09 00:15:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:29,191 INFO L225 Difference]: With dead ends: 156569 [2025-01-09 00:15:29,191 INFO L226 Difference]: Without dead ends: 77217 [2025-01-09 00:15:29,231 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:15:29,233 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 624 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:29,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 103 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:15:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77217 states. [2025-01-09 00:15:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77217 to 75084. [2025-01-09 00:15:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75084 states, 75083 states have (on average 1.1115432254971165) internal successors, (83458), 75083 states have internal predecessors, (83458), 0 states have call successors, (0), 0 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:15:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75084 states to 75084 states and 83458 transitions. [2025-01-09 00:15:30,241 INFO L78 Accepts]: Start accepts. Automaton has 75084 states and 83458 transitions. Word has length 469 [2025-01-09 00:15:30,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:30,242 INFO L471 AbstractCegarLoop]: Abstraction has 75084 states and 83458 transitions. [2025-01-09 00:15:30,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 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:15:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 75084 states and 83458 transitions. [2025-01-09 00:15:30,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-01-09 00:15:30,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:30,255 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:30,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:15:30,255 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:30,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:30,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2065173654, now seen corresponding path program 1 times [2025-01-09 00:15:30,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:30,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521922940] [2025-01-09 00:15:30,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:30,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:30,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-01-09 00:15:30,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-01-09 00:15:30,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:30,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 425 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-01-09 00:15:31,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:31,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521922940] [2025-01-09 00:15:31,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521922940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:31,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:31,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:15:31,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029762631] [2025-01-09 00:15:31,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:31,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:31,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:31,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:31,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:15:31,046 INFO L87 Difference]: Start difference. First operand 75084 states and 83458 transitions. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 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:15:33,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:33,582 INFO L93 Difference]: Finished difference Result 176180 states and 195321 transitions. [2025-01-09 00:15:33,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:33,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 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 487 [2025-01-09 00:15:33,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:33,679 INFO L225 Difference]: With dead ends: 176180 [2025-01-09 00:15:33,680 INFO L226 Difference]: Without dead ends: 96840 [2025-01-09 00:15:33,720 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:15:33,720 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 744 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 2856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:33,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 232 Invalid, 2856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:15:33,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96840 states. [2025-01-09 00:15:34,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96840 to 92956. [2025-01-09 00:15:34,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92956 states, 92955 states have (on average 1.1070517992577054) internal successors, (102906), 92955 states have internal predecessors, (102906), 0 states have call successors, (0), 0 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:15:35,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92956 states to 92956 states and 102906 transitions. [2025-01-09 00:15:35,046 INFO L78 Accepts]: Start accepts. Automaton has 92956 states and 102906 transitions. Word has length 487 [2025-01-09 00:15:35,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:35,046 INFO L471 AbstractCegarLoop]: Abstraction has 92956 states and 102906 transitions. [2025-01-09 00:15:35,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 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:15:35,046 INFO L276 IsEmpty]: Start isEmpty. Operand 92956 states and 102906 transitions. [2025-01-09 00:15:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-01-09 00:15:35,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:35,056 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:35,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:15:35,056 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:35,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:35,057 INFO L85 PathProgramCache]: Analyzing trace with hash 850923944, now seen corresponding path program 1 times [2025-01-09 00:15:35,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:35,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638016349] [2025-01-09 00:15:35,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:35,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:35,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-01-09 00:15:35,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-01-09 00:15:35,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:35,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 428 proven. 82 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-01-09 00:15:36,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:36,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638016349] [2025-01-09 00:15:36,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638016349] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:15:36,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463028054] [2025-01-09 00:15:36,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:36,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:15:36,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:15:36,011 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:15:36,015 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:15:36,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-01-09 00:15:36,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-01-09 00:15:36,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:36,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:36,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:15:36,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:15:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 428 proven. 82 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-01-09 00:15:36,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:15:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-01-09 00:15:36,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463028054] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:15:36,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:15:36,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-09 00:15:36,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581607642] [2025-01-09 00:15:36,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:36,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:36,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:36,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:36,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:15:36,496 INFO L87 Difference]: Start difference. First operand 92956 states and 102906 transitions. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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:15:39,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:39,138 INFO L93 Difference]: Finished difference Result 214454 states and 237741 transitions. [2025-01-09 00:15:39,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:39,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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 487 [2025-01-09 00:15:39,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:39,272 INFO L225 Difference]: With dead ends: 214454 [2025-01-09 00:15:39,273 INFO L226 Difference]: Without dead ends: 121500 [2025-01-09 00:15:39,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 975 GetRequests, 971 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:15:39,329 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 798 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2237 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 2742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 2237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:39,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 160 Invalid, 2742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 2237 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:15:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121500 states. [2025-01-09 00:15:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121500 to 121066. [2025-01-09 00:15:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121066 states, 121065 states have (on average 1.10323380002478) internal successors, (133563), 121065 states have internal predecessors, (133563), 0 states have call successors, (0), 0 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:15:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121066 states to 121066 states and 133563 transitions. [2025-01-09 00:15:40,653 INFO L78 Accepts]: Start accepts. Automaton has 121066 states and 133563 transitions. Word has length 487 [2025-01-09 00:15:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:40,653 INFO L471 AbstractCegarLoop]: Abstraction has 121066 states and 133563 transitions. [2025-01-09 00:15:40,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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:15:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 121066 states and 133563 transitions. [2025-01-09 00:15:40,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-01-09 00:15:40,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:40,662 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:40,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 00:15:40,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 00:15:40,863 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:40,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:40,863 INFO L85 PathProgramCache]: Analyzing trace with hash 938149619, now seen corresponding path program 1 times [2025-01-09 00:15:40,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:40,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638097221] [2025-01-09 00:15:40,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:40,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:40,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-01-09 00:15:40,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-01-09 00:15:40,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:40,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 00:15:41,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:41,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638097221] [2025-01-09 00:15:41,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638097221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:41,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:41,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:41,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351414506] [2025-01-09 00:15:41,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:41,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:41,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:41,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:41,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:41,312 INFO L87 Difference]: Start difference. First operand 121066 states and 133563 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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:15:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:43,219 INFO L93 Difference]: Finished difference Result 266427 states and 294289 transitions. [2025-01-09 00:15:43,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:43,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 498 [2025-01-09 00:15:43,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:43,368 INFO L225 Difference]: With dead ends: 266427 [2025-01-09 00:15:43,368 INFO L226 Difference]: Without dead ends: 144938 [2025-01-09 00:15:43,435 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:15:43,436 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 441 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:43,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 704 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:15:43,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144938 states. [2025-01-09 00:15:44,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144938 to 141082. [2025-01-09 00:15:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141082 states, 141081 states have (on average 1.1031038906727342) internal successors, (155627), 141081 states have internal predecessors, (155627), 0 states have call successors, (0), 0 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:15:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141082 states to 141082 states and 155627 transitions. [2025-01-09 00:15:45,161 INFO L78 Accepts]: Start accepts. Automaton has 141082 states and 155627 transitions. Word has length 498 [2025-01-09 00:15:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:45,161 INFO L471 AbstractCegarLoop]: Abstraction has 141082 states and 155627 transitions. [2025-01-09 00:15:45,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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:15:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 141082 states and 155627 transitions. [2025-01-09 00:15:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-01-09 00:15:45,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:45,181 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:15:45,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:15:45,182 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:45,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:45,182 INFO L85 PathProgramCache]: Analyzing trace with hash -280534380, now seen corresponding path program 1 times [2025-01-09 00:15:45,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:45,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32961590] [2025-01-09 00:15:45,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:45,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:45,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-01-09 00:15:45,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-01-09 00:15:45,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:45,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:45,643 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2025-01-09 00:15:45,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:45,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32961590] [2025-01-09 00:15:45,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32961590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:45,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:45,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:45,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372440172] [2025-01-09 00:15:45,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:45,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:45,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:45,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:45,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:45,645 INFO L87 Difference]: Start difference. First operand 141082 states and 155627 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 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:15:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:47,365 INFO L93 Difference]: Finished difference Result 297041 states and 327268 transitions. [2025-01-09 00:15:47,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:47,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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 563 [2025-01-09 00:15:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:47,523 INFO L225 Difference]: With dead ends: 297041 [2025-01-09 00:15:47,524 INFO L226 Difference]: Without dead ends: 155961 [2025-01-09 00:15:47,600 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:15:47,601 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 392 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:47,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 327 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:15:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155961 states. [2025-01-09 00:15:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155961 to 150848. [2025-01-09 00:15:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150848 states, 150847 states have (on average 1.096813327411218) internal successors, (165451), 150847 states have internal predecessors, (165451), 0 states have call successors, (0), 0 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:15:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150848 states to 150848 states and 165451 transitions. [2025-01-09 00:15:49,458 INFO L78 Accepts]: Start accepts. Automaton has 150848 states and 165451 transitions. Word has length 563 [2025-01-09 00:15:49,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:49,459 INFO L471 AbstractCegarLoop]: Abstraction has 150848 states and 165451 transitions. [2025-01-09 00:15:49,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 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:15:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand 150848 states and 165451 transitions. [2025-01-09 00:15:49,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-01-09 00:15:49,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:49,477 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:49,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:15:49,477 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:49,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:49,478 INFO L85 PathProgramCache]: Analyzing trace with hash -737870632, now seen corresponding path program 1 times [2025-01-09 00:15:49,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:49,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087220875] [2025-01-09 00:15:49,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:49,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:49,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-01-09 00:15:49,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-01-09 00:15:49,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:49,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-01-09 00:15:50,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:50,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087220875] [2025-01-09 00:15:50,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087220875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:50,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:50,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:15:50,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247683708] [2025-01-09 00:15:50,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:50,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:50,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:50,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:50,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:15:50,439 INFO L87 Difference]: Start difference. First operand 150848 states and 165451 transitions. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 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:15:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:53,490 INFO L93 Difference]: Finished difference Result 335354 states and 367031 transitions. [2025-01-09 00:15:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:53,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 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 567 [2025-01-09 00:15:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:53,680 INFO L225 Difference]: With dead ends: 335354 [2025-01-09 00:15:53,680 INFO L226 Difference]: Without dead ends: 180680 [2025-01-09 00:15:53,787 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:15:53,787 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 757 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 2438 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 2880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 2438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:53,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 162 Invalid, 2880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 2438 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 00:15:54,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180680 states. [2025-01-09 00:15:56,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180680 to 178486. [2025-01-09 00:15:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178486 states, 178485 states have (on average 1.0924503459674482) internal successors, (194986), 178485 states have internal predecessors, (194986), 0 states have call successors, (0), 0 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:15:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178486 states to 178486 states and 194986 transitions. [2025-01-09 00:15:56,272 INFO L78 Accepts]: Start accepts. Automaton has 178486 states and 194986 transitions. Word has length 567 [2025-01-09 00:15:56,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:56,272 INFO L471 AbstractCegarLoop]: Abstraction has 178486 states and 194986 transitions. [2025-01-09 00:15:56,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 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:15:56,273 INFO L276 IsEmpty]: Start isEmpty. Operand 178486 states and 194986 transitions. [2025-01-09 00:15:56,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2025-01-09 00:15:56,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:56,286 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:56,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:15:56,286 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:56,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1026440948, now seen corresponding path program 1 times [2025-01-09 00:15:56,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:56,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095965176] [2025-01-09 00:15:56,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:56,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:56,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 581 statements into 1 equivalence classes. [2025-01-09 00:15:56,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 581 of 581 statements. [2025-01-09 00:15:56,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:56,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:56,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 755 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2025-01-09 00:15:56,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:56,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095965176] [2025-01-09 00:15:56,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095965176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:56,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:56,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:56,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651133101] [2025-01-09 00:15:56,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:56,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:56,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:56,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:56,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:56,459 INFO L87 Difference]: Start difference. First operand 178486 states and 194986 transitions. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 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:15:58,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:58,414 INFO L93 Difference]: Finished difference Result 371838 states and 406553 transitions. [2025-01-09 00:15:58,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:58,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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 581 [2025-01-09 00:15:58,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:58,639 INFO L225 Difference]: With dead ends: 371838 [2025-01-09 00:15:58,639 INFO L226 Difference]: Without dead ends: 193353 [2025-01-09 00:15:58,744 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:15:58,745 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 380 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:58,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 334 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:15:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193353 states. [2025-01-09 00:16:00,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193353 to 184849. [2025-01-09 00:16:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184849 states, 184848 states have (on average 1.0821864450792003) internal successors, (200040), 184848 states have internal predecessors, (200040), 0 states have call successors, (0), 0 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:16:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184849 states to 184849 states and 200040 transitions. [2025-01-09 00:16:01,549 INFO L78 Accepts]: Start accepts. Automaton has 184849 states and 200040 transitions. Word has length 581 [2025-01-09 00:16:01,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:01,549 INFO L471 AbstractCegarLoop]: Abstraction has 184849 states and 200040 transitions. [2025-01-09 00:16:01,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 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:16:01,549 INFO L276 IsEmpty]: Start isEmpty. Operand 184849 states and 200040 transitions. [2025-01-09 00:16:01,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-01-09 00:16:01,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:01,585 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:16:01,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 00:16:01,585 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:01,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:01,585 INFO L85 PathProgramCache]: Analyzing trace with hash -688733076, now seen corresponding path program 1 times [2025-01-09 00:16:01,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:01,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138067251] [2025-01-09 00:16:01,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:01,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:01,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-01-09 00:16:01,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-01-09 00:16:01,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:01,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 498 proven. 41 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-01-09 00:16:02,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:02,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138067251] [2025-01-09 00:16:02,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138067251] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:02,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729030560] [2025-01-09 00:16:02,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:02,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:02,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:16:02,631 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:16:02,633 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:16:02,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-01-09 00:16:02,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-01-09 00:16:02,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:02,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:02,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:16:02,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:16:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 539 proven. 82 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 00:16:03,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:16:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 539 proven. 82 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 00:16:04,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729030560] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:16:04,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:16:04,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-01-09 00:16:04,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964889584] [2025-01-09 00:16:04,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:16:04,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:16:04,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:04,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:16:04,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:16:04,734 INFO L87 Difference]: Start difference. First operand 184849 states and 200040 transitions. Second operand has 9 states, 9 states have (on average 123.33333333333333) internal successors, (1110), 9 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)