./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label01.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_label01.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 a4e6e263a6fe01660f2ecabfa1a654296517a773a2b8a9b458da8809aa3aafd8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:09:57,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:09:57,598 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:09:57,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:09:57,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:09:57,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:09:57,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:09:57,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:09:57,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:09:57,617 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:09:57,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:09:57,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:09:57,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:09:57,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:09:57,618 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:09:57,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:09:57,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:09:57,618 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:09:57,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:09:57,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:09:57,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:09:57,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:09:57,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:09:57,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:09:57,619 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:09:57,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:09:57,619 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:09:57,619 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:09:57,619 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:09:57,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:09:57,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:09:57,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:09:57,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:09:57,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:09:57,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:09:57,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:09:57,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:09:57,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:09:57,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:09:57,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:09:57,620 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:09:57,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:09:57,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:09:57,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:09:57,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:09:57,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:09:57,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:09:57,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:09:57,621 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 -> a4e6e263a6fe01660f2ecabfa1a654296517a773a2b8a9b458da8809aa3aafd8 [2025-01-09 00:09:57,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:09:57,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:09:57,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:09:57,833 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:09:57,834 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:09:57,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label01.c [2025-01-09 00:09:59,021 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42a2d4689/5a5f4922423b426dafe7e93e1f99e76f/FLAG5b8946b30 [2025-01-09 00:09:59,469 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:09:59,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label01.c [2025-01-09 00:09:59,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42a2d4689/5a5f4922423b426dafe7e93e1f99e76f/FLAG5b8946b30 [2025-01-09 00:09:59,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42a2d4689/5a5f4922423b426dafe7e93e1f99e76f [2025-01-09 00:09:59,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:09:59,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:09:59,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:09:59,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:09:59,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:09:59,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:09:59" (1/1) ... [2025-01-09 00:09:59,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a01903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:59, skipping insertion in model container [2025-01-09 00:09:59,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:09:59" (1/1) ... [2025-01-09 00:09:59,695 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:09:59,878 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_label01.c[6877,6890] [2025-01-09 00:10:00,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:10:00,253 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:10:00,298 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_label01.c[6877,6890] [2025-01-09 00:10:00,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:10:00,497 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:10:00,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:00 WrapperNode [2025-01-09 00:10:00,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:10:00,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:10:00,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:10:00,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:10:00,505 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:10:00" (1/1) ... [2025-01-09 00:10:00,544 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:10:00" (1/1) ... [2025-01-09 00:10:00,745 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:10:00,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:10:00,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:10:00,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:10:00,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:10:00,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:00" (1/1) ... [2025-01-09 00:10:00,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:00" (1/1) ... [2025-01-09 00:10:00,826 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:00" (1/1) ... [2025-01-09 00:10:00,944 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:10:00,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:00" (1/1) ... [2025-01-09 00:10:00,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:00" (1/1) ... [2025-01-09 00:10:01,073 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:00" (1/1) ... [2025-01-09 00:10:01,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:00" (1/1) ... [2025-01-09 00:10:01,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:00" (1/1) ... [2025-01-09 00:10:01,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:00" (1/1) ... [2025-01-09 00:10:01,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:00" (1/1) ... [2025-01-09 00:10:01,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:10:01,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:10:01,168 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:10:01,168 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:10:01,170 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:00" (1/1) ... [2025-01-09 00:10:01,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:10:01,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:10:01,200 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:10:01,208 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:10:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:10:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:10:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:10:01,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:10:01,289 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:10:01,291 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:10:03,812 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:10:03,812 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:10:03,837 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:10:03,838 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:10:03,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:10:03 BoogieIcfgContainer [2025-01-09 00:10:03,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:10:03,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:10:03,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:10:03,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:10:03,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:09:59" (1/3) ... [2025-01-09 00:10:03,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280051dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:10:03, skipping insertion in model container [2025-01-09 00:10:03,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:00" (2/3) ... [2025-01-09 00:10:03,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280051dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:10:03, skipping insertion in model container [2025-01-09 00:10:03,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:10:03" (3/3) ... [2025-01-09 00:10:03,846 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label01.c [2025-01-09 00:10:03,856 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:10:03,858 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label01.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:10:03,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:10:03,925 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;@7bef2b27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:10:03,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:10:03,929 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:10:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 00:10:03,933 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:03,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:10:03,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:03,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:03,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2006201642, now seen corresponding path program 1 times [2025-01-09 00:10:03,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:03,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524472078] [2025-01-09 00:10:03,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:03,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:04,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 00:10:04,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 00:10:04,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:04,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:04,263 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:10:04,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:04,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524472078] [2025-01-09 00:10:04,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524472078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:04,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:04,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:10:04,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223246170] [2025-01-09 00:10:04,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:04,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:04,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:04,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:04,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:04,282 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 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 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:10:06,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:06,538 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-01-09 00:10:06,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:06,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-01-09 00:10:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:06,554 INFO L225 Difference]: With dead ends: 1644 [2025-01-09 00:10:06,554 INFO L226 Difference]: Without dead ends: 977 [2025-01-09 00:10:06,557 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:10:06,559 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 442 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 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, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:06,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:10:06,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-01-09 00:10:06,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-01-09 00:10:06,693 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:10:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-01-09 00:10:06,707 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 46 [2025-01-09 00:10:06,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:06,708 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-01-09 00:10:06,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 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:10:06,709 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-01-09 00:10:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 00:10:06,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:06,714 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:10:06,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:10:06,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:06,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:06,717 INFO L85 PathProgramCache]: Analyzing trace with hash 739777853, now seen corresponding path program 1 times [2025-01-09 00:10:06,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:06,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835547781] [2025-01-09 00:10:06,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:06,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:06,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 00:10:06,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 00:10:06,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:06,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:10:07,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:07,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835547781] [2025-01-09 00:10:07,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835547781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:07,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:07,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:10:07,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853121046] [2025-01-09 00:10:07,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:07,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:07,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:07,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:07,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:07,045 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 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:10:09,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:09,148 INFO L93 Difference]: Finished difference Result 2844 states and 4428 transitions. [2025-01-09 00:10:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:09,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 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:10:09,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:09,156 INFO L225 Difference]: With dead ends: 2844 [2025-01-09 00:10:09,157 INFO L226 Difference]: Without dead ends: 1875 [2025-01-09 00:10:09,159 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:10:09,189 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 442 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:09,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 242 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:10:09,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2025-01-09 00:10:09,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1854. [2025-01-09 00:10:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 1.4889368591473287) internal successors, (2759), 1853 states have internal predecessors, (2759), 0 states have call successors, (0), 0 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:10:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2759 transitions. [2025-01-09 00:10:09,232 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2759 transitions. Word has length 113 [2025-01-09 00:10:09,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:09,234 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2759 transitions. [2025-01-09 00:10:09,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 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:10:09,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2759 transitions. [2025-01-09 00:10:09,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 00:10:09,236 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:09,237 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:09,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:10:09,237 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:09,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:09,240 INFO L85 PathProgramCache]: Analyzing trace with hash 816882857, now seen corresponding path program 1 times [2025-01-09 00:10:09,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:09,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481345995] [2025-01-09 00:10:09,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:09,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:09,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 00:10:09,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 00:10:09,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:09,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:10:09,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:09,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481345995] [2025-01-09 00:10:09,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481345995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:09,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:09,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:10:09,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253615876] [2025-01-09 00:10:09,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:09,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:09,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:09,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:09,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:09,544 INFO L87 Difference]: Start difference. First operand 1854 states and 2759 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:10:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:11,552 INFO L93 Difference]: Finished difference Result 4995 states and 7380 transitions. [2025-01-09 00:10:11,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:11,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-01-09 00:10:11,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:11,566 INFO L225 Difference]: With dead ends: 4995 [2025-01-09 00:10:11,567 INFO L226 Difference]: Without dead ends: 3143 [2025-01-09 00:10:11,569 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:10:11,572 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 368 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:11,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 558 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:10:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2025-01-09 00:10:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 3141. [2025-01-09 00:10:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3140 states have (on average 1.3197452229299362) internal successors, (4144), 3140 states have internal predecessors, (4144), 0 states have call successors, (0), 0 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:10:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 4144 transitions. [2025-01-09 00:10:11,628 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 4144 transitions. Word has length 121 [2025-01-09 00:10:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:11,629 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 4144 transitions. [2025-01-09 00:10:11,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:10:11,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 4144 transitions. [2025-01-09 00:10:11,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 00:10:11,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:11,632 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:10:11,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:10:11,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:11,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:11,633 INFO L85 PathProgramCache]: Analyzing trace with hash 191806966, now seen corresponding path program 1 times [2025-01-09 00:10:11,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:11,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893171460] [2025-01-09 00:10:11,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:11,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:11,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 00:10:11,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 00:10:11,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:11,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:11,820 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 00:10:11,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:11,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893171460] [2025-01-09 00:10:11,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893171460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:11,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:11,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:10:11,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278136498] [2025-01-09 00:10:11,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:11,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:11,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:11,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:11,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:11,822 INFO L87 Difference]: Start difference. First operand 3141 states and 4144 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:10:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:13,594 INFO L93 Difference]: Finished difference Result 8416 states and 11323 transitions. [2025-01-09 00:10:13,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:13,595 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 181 [2025-01-09 00:10:13,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:13,607 INFO L225 Difference]: With dead ends: 8416 [2025-01-09 00:10:13,608 INFO L226 Difference]: Without dead ends: 5702 [2025-01-09 00:10:13,610 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:10:13,611 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:13,611 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.7s Time] [2025-01-09 00:10:13,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5702 states. [2025-01-09 00:10:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5702 to 3999. [2025-01-09 00:10:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3999 states, 3998 states have (on average 1.2511255627813906) internal successors, (5002), 3998 states have internal predecessors, (5002), 0 states have call successors, (0), 0 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:10:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 5002 transitions. [2025-01-09 00:10:13,665 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 5002 transitions. Word has length 181 [2025-01-09 00:10:13,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:13,665 INFO L471 AbstractCegarLoop]: Abstraction has 3999 states and 5002 transitions. [2025-01-09 00:10:13,665 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:10:13,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 5002 transitions. [2025-01-09 00:10:13,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 00:10:13,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:13,667 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:10:13,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:10:13,667 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:13,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:13,668 INFO L85 PathProgramCache]: Analyzing trace with hash -624442537, now seen corresponding path program 1 times [2025-01-09 00:10:13,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:13,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390551629] [2025-01-09 00:10:13,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:13,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:13,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 00:10:13,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 00:10:13,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:13,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:10:13,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:13,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390551629] [2025-01-09 00:10:13,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390551629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:13,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:13,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 00:10:13,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982591842] [2025-01-09 00:10:13,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:13,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:10:13,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:13,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:10:13,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:10:13,974 INFO L87 Difference]: Start difference. First operand 3999 states and 5002 transitions. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:16,511 INFO L93 Difference]: Finished difference Result 10144 states and 13051 transitions. [2025-01-09 00:10:16,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:10:16,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2025-01-09 00:10:16,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:16,529 INFO L225 Difference]: With dead ends: 10144 [2025-01-09 00:10:16,529 INFO L226 Difference]: Without dead ends: 6147 [2025-01-09 00:10:16,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:10:16,535 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 594 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 3094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:16,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 915 Invalid, 3094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 00:10:16,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2025-01-09 00:10:16,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 6134. [2025-01-09 00:10:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6134 states, 6133 states have (on average 1.2437632480026088) internal successors, (7628), 6133 states have internal predecessors, (7628), 0 states have call successors, (0), 0 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:10:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 7628 transitions. [2025-01-09 00:10:16,618 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 7628 transitions. Word has length 194 [2025-01-09 00:10:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:16,619 INFO L471 AbstractCegarLoop]: Abstraction has 6134 states and 7628 transitions. [2025-01-09 00:10:16,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 7628 transitions. [2025-01-09 00:10:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-09 00:10:16,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:16,621 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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:10:16,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:10:16,621 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:16,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:16,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1211690792, now seen corresponding path program 1 times [2025-01-09 00:10:16,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:16,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933776475] [2025-01-09 00:10:16,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:16,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:16,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 00:10:16,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 00:10:16,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:16,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-09 00:10:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:16,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933776475] [2025-01-09 00:10:16,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933776475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:16,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:16,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:10:16,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489125297] [2025-01-09 00:10:16,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:16,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:16,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:16,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:16,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:16,747 INFO L87 Difference]: Start difference. First operand 6134 states and 7628 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:10:18,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:18,597 INFO L93 Difference]: Finished difference Result 16089 states and 20189 transitions. [2025-01-09 00:10:18,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:18,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 200 [2025-01-09 00:10:18,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:18,628 INFO L225 Difference]: With dead ends: 16089 [2025-01-09 00:10:18,628 INFO L226 Difference]: Without dead ends: 9957 [2025-01-09 00:10:18,637 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:10:18,639 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 402 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:18,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 545 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:10:18,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9957 states. [2025-01-09 00:10:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9957 to 8678. [2025-01-09 00:10:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8678 states, 8677 states have (on average 1.202489339633514) internal successors, (10434), 8677 states have internal predecessors, (10434), 0 states have call successors, (0), 0 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:10:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8678 states to 8678 states and 10434 transitions. [2025-01-09 00:10:18,788 INFO L78 Accepts]: Start accepts. Automaton has 8678 states and 10434 transitions. Word has length 200 [2025-01-09 00:10:18,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:18,788 INFO L471 AbstractCegarLoop]: Abstraction has 8678 states and 10434 transitions. [2025-01-09 00:10:18,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:10:18,788 INFO L276 IsEmpty]: Start isEmpty. Operand 8678 states and 10434 transitions. [2025-01-09 00:10:18,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 00:10:18,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:18,792 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:10:18,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:10:18,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:18,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:18,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1738882313, now seen corresponding path program 1 times [2025-01-09 00:10:18,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:18,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736994183] [2025-01-09 00:10:18,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:18,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:18,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 00:10:18,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 00:10:18,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:18,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:10:18,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:18,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736994183] [2025-01-09 00:10:18,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736994183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:18,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:18,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:10:18,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765986119] [2025-01-09 00:10:18,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:18,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:18,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:18,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:18,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:18,905 INFO L87 Difference]: Start difference. First operand 8678 states and 10434 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:10:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:20,944 INFO L93 Difference]: Finished difference Result 21610 states and 26256 transitions. [2025-01-09 00:10:20,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:20,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 213 [2025-01-09 00:10:20,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:20,986 INFO L225 Difference]: With dead ends: 21610 [2025-01-09 00:10:20,989 INFO L226 Difference]: Without dead ends: 12934 [2025-01-09 00:10:21,009 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:10:21,009 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 438 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:21,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 484 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:10:21,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12934 states. [2025-01-09 00:10:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12934 to 11648. [2025-01-09 00:10:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11648 states, 11647 states have (on average 1.199364643255774) internal successors, (13969), 11647 states have internal predecessors, (13969), 0 states have call successors, (0), 0 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:10:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11648 states to 11648 states and 13969 transitions. [2025-01-09 00:10:21,279 INFO L78 Accepts]: Start accepts. Automaton has 11648 states and 13969 transitions. Word has length 213 [2025-01-09 00:10:21,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:21,280 INFO L471 AbstractCegarLoop]: Abstraction has 11648 states and 13969 transitions. [2025-01-09 00:10:21,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:10:21,280 INFO L276 IsEmpty]: Start isEmpty. Operand 11648 states and 13969 transitions. [2025-01-09 00:10:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-01-09 00:10:21,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:21,284 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:10:21,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:10:21,285 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:21,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:21,285 INFO L85 PathProgramCache]: Analyzing trace with hash -839483624, now seen corresponding path program 1 times [2025-01-09 00:10:21,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:21,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218723523] [2025-01-09 00:10:21,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:21,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:21,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-09 00:10:21,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-09 00:10:21,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:21,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:21,584 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:10:21,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:21,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218723523] [2025-01-09 00:10:21,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218723523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:21,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:21,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:10:21,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207179823] [2025-01-09 00:10:21,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:21,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:21,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:21,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:21,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:21,586 INFO L87 Difference]: Start difference. First operand 11648 states and 13969 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 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:10:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:24,106 INFO L93 Difference]: Finished difference Result 28849 states and 35120 transitions. [2025-01-09 00:10:24,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:24,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 262 [2025-01-09 00:10:24,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:24,133 INFO L225 Difference]: With dead ends: 28849 [2025-01-09 00:10:24,133 INFO L226 Difference]: Without dead ends: 17203 [2025-01-09 00:10:24,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:24,146 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 458 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:24,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 515 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 00:10:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17203 states. [2025-01-09 00:10:24,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17203 to 15918. [2025-01-09 00:10:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15918 states, 15917 states have (on average 1.2205189420116855) internal successors, (19427), 15917 states have internal predecessors, (19427), 0 states have call successors, (0), 0 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:10:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15918 states to 15918 states and 19427 transitions. [2025-01-09 00:10:24,365 INFO L78 Accepts]: Start accepts. Automaton has 15918 states and 19427 transitions. Word has length 262 [2025-01-09 00:10:24,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:24,365 INFO L471 AbstractCegarLoop]: Abstraction has 15918 states and 19427 transitions. [2025-01-09 00:10:24,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 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:10:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 15918 states and 19427 transitions. [2025-01-09 00:10:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 00:10:24,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:24,370 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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:10:24,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:10:24,371 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:24,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:24,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1366754924, now seen corresponding path program 1 times [2025-01-09 00:10:24,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:24,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625477705] [2025-01-09 00:10:24,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:24,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:24,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 00:10:24,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 00:10:24,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:24,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 226 proven. 70 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 00:10:24,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:24,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625477705] [2025-01-09 00:10:24,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625477705] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:10:24,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468744397] [2025-01-09 00:10:24,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:24,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:10:24,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:10:24,683 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:10:24,684 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:10:24,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 00:10:24,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 00:10:24,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:24,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:24,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:10:24,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:10:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 226 proven. 70 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 00:10:25,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:10:25,467 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 00:10:25,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468744397] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:10:25,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:10:25,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-09 00:10:25,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603128050] [2025-01-09 00:10:25,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:25,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:10:25,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:25,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:10:25,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:10:25,468 INFO L87 Difference]: Start difference. First operand 15918 states and 19427 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:10:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:28,734 INFO L93 Difference]: Finished difference Result 43775 states and 53764 transitions. [2025-01-09 00:10:28,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:10:28,734 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 270 [2025-01-09 00:10:28,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:28,769 INFO L225 Difference]: With dead ends: 43775 [2025-01-09 00:10:28,770 INFO L226 Difference]: Without dead ends: 26990 [2025-01-09 00:10:28,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 537 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:10:28,784 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 1129 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 1450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 3754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1450 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:28,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 144 Invalid, 3754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1450 Valid, 2304 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 00:10:28,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26990 states. [2025-01-09 00:10:29,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26990 to 26989. [2025-01-09 00:10:29,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26989 states, 26988 states have (on average 1.148399288572699) internal successors, (30993), 26988 states have internal predecessors, (30993), 0 states have call successors, (0), 0 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:10:29,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26989 states to 26989 states and 30993 transitions. [2025-01-09 00:10:29,065 INFO L78 Accepts]: Start accepts. Automaton has 26989 states and 30993 transitions. Word has length 270 [2025-01-09 00:10:29,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:29,066 INFO L471 AbstractCegarLoop]: Abstraction has 26989 states and 30993 transitions. [2025-01-09 00:10:29,066 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:10:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 26989 states and 30993 transitions. [2025-01-09 00:10:29,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-01-09 00:10:29,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:29,070 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:10:29,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:10:29,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:10:29,274 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:29,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:29,275 INFO L85 PathProgramCache]: Analyzing trace with hash 154249155, now seen corresponding path program 1 times [2025-01-09 00:10:29,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:29,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113641428] [2025-01-09 00:10:29,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:29,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:29,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-01-09 00:10:29,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-01-09 00:10:29,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:29,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 00:10:29,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:29,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113641428] [2025-01-09 00:10:29,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113641428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:29,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:29,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:10:29,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354811602] [2025-01-09 00:10:29,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:29,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:29,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:29,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:29,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:29,512 INFO L87 Difference]: Start difference. First operand 26989 states and 30993 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 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:10:30,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:30,968 INFO L93 Difference]: Finished difference Result 57794 states and 66503 transitions. [2025-01-09 00:10:30,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:30,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 283 [2025-01-09 00:10:30,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:31,096 INFO L225 Difference]: With dead ends: 57794 [2025-01-09 00:10:31,097 INFO L226 Difference]: Without dead ends: 30807 [2025-01-09 00:10:31,108 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:10:31,109 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 373 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:31,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 832 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:10:31,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30807 states. [2025-01-09 00:10:31,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30807 to 30382. [2025-01-09 00:10:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30382 states, 30381 states have (on average 1.1347552746782528) internal successors, (34475), 30381 states have internal predecessors, (34475), 0 states have call successors, (0), 0 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:10:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30382 states to 30382 states and 34475 transitions. [2025-01-09 00:10:31,631 INFO L78 Accepts]: Start accepts. Automaton has 30382 states and 34475 transitions. Word has length 283 [2025-01-09 00:10:31,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:31,632 INFO L471 AbstractCegarLoop]: Abstraction has 30382 states and 34475 transitions. [2025-01-09 00:10:31,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 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:10:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 30382 states and 34475 transitions. [2025-01-09 00:10:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-01-09 00:10:31,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:31,638 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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:10:31,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:10:31,638 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:31,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:31,639 INFO L85 PathProgramCache]: Analyzing trace with hash -570416717, now seen corresponding path program 1 times [2025-01-09 00:10:31,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:31,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497909383] [2025-01-09 00:10:31,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:31,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:31,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-01-09 00:10:31,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-01-09 00:10:31,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:31,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:10:32,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:32,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497909383] [2025-01-09 00:10:32,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497909383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:32,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:32,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:10:32,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551793252] [2025-01-09 00:10:32,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:32,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:10:32,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:32,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:10:32,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:10:32,049 INFO L87 Difference]: Start difference. First operand 30382 states and 34475 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 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:10:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:34,939 INFO L93 Difference]: Finished difference Result 88907 states and 100828 transitions. [2025-01-09 00:10:34,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:10:34,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 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 306 [2025-01-09 00:10:34,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:35,018 INFO L225 Difference]: With dead ends: 88907 [2025-01-09 00:10:35,019 INFO L226 Difference]: Without dead ends: 55542 [2025-01-09 00:10:35,037 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:10:35,038 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 851 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:35,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 329 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 00:10:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55542 states. [2025-01-09 00:10:35,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55542 to 52089. [2025-01-09 00:10:35,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52089 states, 52088 states have (on average 1.126228689909384) internal successors, (58663), 52088 states have internal predecessors, (58663), 0 states have call successors, (0), 0 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:10:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52089 states to 52089 states and 58663 transitions. [2025-01-09 00:10:35,649 INFO L78 Accepts]: Start accepts. Automaton has 52089 states and 58663 transitions. Word has length 306 [2025-01-09 00:10:35,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:35,650 INFO L471 AbstractCegarLoop]: Abstraction has 52089 states and 58663 transitions. [2025-01-09 00:10:35,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 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:10:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 52089 states and 58663 transitions. [2025-01-09 00:10:35,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-01-09 00:10:35,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:35,687 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:35,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:10:35,688 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:35,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:35,689 INFO L85 PathProgramCache]: Analyzing trace with hash -494250247, now seen corresponding path program 1 times [2025-01-09 00:10:35,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:35,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049604624] [2025-01-09 00:10:35,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:35,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:35,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-01-09 00:10:35,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-01-09 00:10:35,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:35,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 00:10:36,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:36,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049604624] [2025-01-09 00:10:36,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049604624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:36,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:36,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:10:36,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812935971] [2025-01-09 00:10:36,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:36,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:36,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:36,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:36,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:36,160 INFO L87 Difference]: Start difference. First operand 52089 states and 58663 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 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:10:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:38,333 INFO L93 Difference]: Finished difference Result 119533 states and 134923 transitions. [2025-01-09 00:10:38,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:38,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 321 [2025-01-09 00:10:38,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:38,406 INFO L225 Difference]: With dead ends: 119533 [2025-01-09 00:10:38,406 INFO L226 Difference]: Without dead ends: 65744 [2025-01-09 00:10:38,429 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:10:38,431 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 361 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:38,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 789 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:10:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65744 states. [2025-01-09 00:10:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65744 to 64457. [2025-01-09 00:10:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64457 states, 64456 states have (on average 1.1081512970088123) internal successors, (71427), 64456 states have internal predecessors, (71427), 0 states have call successors, (0), 0 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:10:39,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64457 states to 64457 states and 71427 transitions. [2025-01-09 00:10:39,488 INFO L78 Accepts]: Start accepts. Automaton has 64457 states and 71427 transitions. Word has length 321 [2025-01-09 00:10:39,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:39,489 INFO L471 AbstractCegarLoop]: Abstraction has 64457 states and 71427 transitions. [2025-01-09 00:10:39,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 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:10:39,489 INFO L276 IsEmpty]: Start isEmpty. Operand 64457 states and 71427 transitions. [2025-01-09 00:10:39,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-01-09 00:10:39,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:39,496 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:10:39,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:10:39,497 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:39,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:39,497 INFO L85 PathProgramCache]: Analyzing trace with hash 254844466, now seen corresponding path program 1 times [2025-01-09 00:10:39,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:39,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889471228] [2025-01-09 00:10:39,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:39,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:39,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-09 00:10:39,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-09 00:10:39,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:39,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:40,097 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 340 proven. 214 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 00:10:40,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:40,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889471228] [2025-01-09 00:10:40,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889471228] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:10:40,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401957128] [2025-01-09 00:10:40,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:40,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:10:40,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:10:40,106 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:10:40,157 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:10:40,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-09 00:10:40,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-09 00:10:40,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:40,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:40,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:10:40,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:10:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 367 proven. 73 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-01-09 00:10:40,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:10:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-01-09 00:10:40,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401957128] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:10:40,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:10:40,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2025-01-09 00:10:40,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709139476] [2025-01-09 00:10:40,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:40,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:10:40,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:40,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:10:40,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:10:40,725 INFO L87 Difference]: Start difference. First operand 64457 states and 71427 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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:10:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:43,490 INFO L93 Difference]: Finished difference Result 149364 states and 165622 transitions. [2025-01-09 00:10:43,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:10:43,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 344 [2025-01-09 00:10:43,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:43,609 INFO L225 Difference]: With dead ends: 149364 [2025-01-09 00:10:43,609 INFO L226 Difference]: Without dead ends: 84909 [2025-01-09 00:10:43,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 685 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:10:43,643 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 843 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:43,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 190 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 2301 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 00:10:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84909 states. [2025-01-09 00:10:44,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84909 to 80230. [2025-01-09 00:10:44,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80230 states, 80229 states have (on average 1.1101596679504917) internal successors, (89067), 80229 states have internal predecessors, (89067), 0 states have call successors, (0), 0 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:10:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80230 states to 80230 states and 89067 transitions. [2025-01-09 00:10:45,057 INFO L78 Accepts]: Start accepts. Automaton has 80230 states and 89067 transitions. Word has length 344 [2025-01-09 00:10:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:45,058 INFO L471 AbstractCegarLoop]: Abstraction has 80230 states and 89067 transitions. [2025-01-09 00:10:45,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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:10:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 80230 states and 89067 transitions. [2025-01-09 00:10:45,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-01-09 00:10:45,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:45,066 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 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:10:45,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 00:10:45,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:10:45,267 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:45,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash 841178340, now seen corresponding path program 1 times [2025-01-09 00:10:45,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:45,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597595008] [2025-01-09 00:10:45,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:45,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:45,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-01-09 00:10:45,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-01-09 00:10:45,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:45,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-01-09 00:10:45,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:45,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597595008] [2025-01-09 00:10:45,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597595008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:45,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:45,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:10:45,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676940296] [2025-01-09 00:10:45,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:45,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:45,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:45,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:45,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:45,636 INFO L87 Difference]: Start difference. First operand 80230 states and 89067 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 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:10:47,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:47,416 INFO L93 Difference]: Finished difference Result 174506 states and 193898 transitions. [2025-01-09 00:10:47,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:47,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 374 [2025-01-09 00:10:47,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:47,519 INFO L225 Difference]: With dead ends: 174506 [2025-01-09 00:10:47,519 INFO L226 Difference]: Without dead ends: 93426 [2025-01-09 00:10:47,552 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:10:47,553 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 391 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:47,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 788 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:10:47,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93426 states. [2025-01-09 00:10:48,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93426 to 79343. [2025-01-09 00:10:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79343 states, 79342 states have (on average 1.1059716165460916) internal successors, (87750), 79342 states have internal predecessors, (87750), 0 states have call successors, (0), 0 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:10:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79343 states to 79343 states and 87750 transitions. [2025-01-09 00:10:48,490 INFO L78 Accepts]: Start accepts. Automaton has 79343 states and 87750 transitions. Word has length 374 [2025-01-09 00:10:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:48,490 INFO L471 AbstractCegarLoop]: Abstraction has 79343 states and 87750 transitions. [2025-01-09 00:10:48,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 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:10:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 79343 states and 87750 transitions. [2025-01-09 00:10:48,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-01-09 00:10:48,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:48,496 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:10:48,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:10:48,496 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:48,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:48,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1945010293, now seen corresponding path program 1 times [2025-01-09 00:10:48,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:48,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450902215] [2025-01-09 00:10:48,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:48,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:48,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-01-09 00:10:48,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-01-09 00:10:48,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:48,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-01-09 00:10:48,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:48,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450902215] [2025-01-09 00:10:48,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450902215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:48,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:48,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:10:48,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32034932] [2025-01-09 00:10:48,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:48,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:48,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:48,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:48,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:48,794 INFO L87 Difference]: Start difference. First operand 79343 states and 87750 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:50,611 INFO L93 Difference]: Finished difference Result 165068 states and 182887 transitions. [2025-01-09 00:10:50,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:50,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 379 [2025-01-09 00:10:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:50,738 INFO L225 Difference]: With dead ends: 165068 [2025-01-09 00:10:50,738 INFO L226 Difference]: Without dead ends: 85300 [2025-01-09 00:10:50,788 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:10:50,789 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 468 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:50,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 257 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:10:50,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85300 states. [2025-01-09 00:10:51,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85300 to 82310. [2025-01-09 00:10:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82310 states, 82309 states have (on average 1.103901152972336) internal successors, (90861), 82309 states have internal predecessors, (90861), 0 states have call successors, (0), 0 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:10:52,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82310 states to 82310 states and 90861 transitions. [2025-01-09 00:10:52,111 INFO L78 Accepts]: Start accepts. Automaton has 82310 states and 90861 transitions. Word has length 379 [2025-01-09 00:10:52,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:52,111 INFO L471 AbstractCegarLoop]: Abstraction has 82310 states and 90861 transitions. [2025-01-09 00:10:52,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:52,112 INFO L276 IsEmpty]: Start isEmpty. Operand 82310 states and 90861 transitions. [2025-01-09 00:10:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-01-09 00:10:52,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:52,119 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:10:52,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:10:52,120 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:52,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:52,123 INFO L85 PathProgramCache]: Analyzing trace with hash -504612353, now seen corresponding path program 1 times [2025-01-09 00:10:52,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:52,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692236371] [2025-01-09 00:10:52,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:52,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:52,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-01-09 00:10:52,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-01-09 00:10:52,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:52,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 419 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-01-09 00:10:52,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:52,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692236371] [2025-01-09 00:10:52,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692236371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:52,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:52,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:10:52,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924791811] [2025-01-09 00:10:52,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:52,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:52,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:52,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:52,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:52,456 INFO L87 Difference]: Start difference. First operand 82310 states and 90861 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:54,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:54,327 INFO L93 Difference]: Finished difference Result 172698 states and 190240 transitions. [2025-01-09 00:10:54,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:54,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 396 [2025-01-09 00:10:54,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:54,430 INFO L225 Difference]: With dead ends: 172698 [2025-01-09 00:10:54,431 INFO L226 Difference]: Without dead ends: 90389 [2025-01-09 00:10:54,473 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:10:54,474 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 388 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:54,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 316 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:10:54,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90389 states. [2025-01-09 00:10:55,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90389 to 85283. [2025-01-09 00:10:55,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85283 states, 85282 states have (on average 1.100185267700101) internal successors, (93826), 85282 states have internal predecessors, (93826), 0 states have call successors, (0), 0 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:10:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85283 states to 85283 states and 93826 transitions. [2025-01-09 00:10:55,625 INFO L78 Accepts]: Start accepts. Automaton has 85283 states and 93826 transitions. Word has length 396 [2025-01-09 00:10:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:55,626 INFO L471 AbstractCegarLoop]: Abstraction has 85283 states and 93826 transitions. [2025-01-09 00:10:55,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 85283 states and 93826 transitions. [2025-01-09 00:10:55,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-01-09 00:10:55,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:55,632 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 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:10:55,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:10:55,632 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:55,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:55,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1598822032, now seen corresponding path program 1 times [2025-01-09 00:10:55,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:55,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151313774] [2025-01-09 00:10:55,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:55,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:55,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-01-09 00:10:55,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-01-09 00:10:55,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:55,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 346 proven. 44 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-01-09 00:10:56,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:56,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151313774] [2025-01-09 00:10:56,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151313774] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:10:56,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570073881] [2025-01-09 00:10:56,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:56,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:10:56,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:10:56,284 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:10:56,286 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:10:56,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-01-09 00:10:56,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-01-09 00:10:56,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:56,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:56,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:10:56,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:10:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 417 proven. 82 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-01-09 00:10:56,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:10:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 417 proven. 82 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-01-09 00:10:57,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570073881] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:10:57,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:10:57,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-01-09 00:10:57,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90654390] [2025-01-09 00:10:57,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:10:57,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:10:57,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:57,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:10:57,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:10:57,951 INFO L87 Difference]: Start difference. First operand 85283 states and 93826 transitions. Second operand has 9 states, 9 states have (on average 82.33333333333333) internal successors, (741), 9 states have internal predecessors, (741), 0 states have call successors, (0), 0 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:11:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:06,641 INFO L93 Difference]: Finished difference Result 213142 states and 233111 transitions. [2025-01-09 00:11:06,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 00:11:06,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.33333333333333) internal successors, (741), 9 states have internal predecessors, (741), 0 states have call successors, (0), 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 426 [2025-01-09 00:11:06,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:06,810 INFO L225 Difference]: With dead ends: 213142 [2025-01-09 00:11:06,811 INFO L226 Difference]: Without dead ends: 121478 [2025-01-09 00:11:06,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 872 GetRequests, 856 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2025-01-09 00:11:06,872 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 7507 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 10241 mSolverCounterSat, 2244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7507 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 12485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2244 IncrementalHoareTripleChecker+Valid, 10241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:06,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7507 Valid, 396 Invalid, 12485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2244 Valid, 10241 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2025-01-09 00:11:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121478 states. [2025-01-09 00:11:08,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121478 to 100967. [2025-01-09 00:11:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100967 states, 100966 states have (on average 1.0715191252500842) internal successors, (108187), 100966 states have internal predecessors, (108187), 0 states have call successors, (0), 0 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:11:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100967 states to 100967 states and 108187 transitions. [2025-01-09 00:11:08,319 INFO L78 Accepts]: Start accepts. Automaton has 100967 states and 108187 transitions. Word has length 426 [2025-01-09 00:11:08,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:08,320 INFO L471 AbstractCegarLoop]: Abstraction has 100967 states and 108187 transitions. [2025-01-09 00:11:08,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.33333333333333) internal successors, (741), 9 states have internal predecessors, (741), 0 states have call successors, (0), 0 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:11:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 100967 states and 108187 transitions. [2025-01-09 00:11:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-01-09 00:11:08,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:08,330 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:08,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 00:11:08,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:11:08,534 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:08,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:08,534 INFO L85 PathProgramCache]: Analyzing trace with hash 898290074, now seen corresponding path program 1 times [2025-01-09 00:11:08,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:08,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721821137] [2025-01-09 00:11:08,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:08,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:08,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 00:11:08,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 00:11:08,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:08,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 251 proven. 44 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 00:11:09,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:09,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721821137] [2025-01-09 00:11:09,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721821137] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:11:09,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342180903] [2025-01-09 00:11:09,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:09,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:11:09,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:11:09,032 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:11:09,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 00:11:09,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 00:11:09,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 00:11:09,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:09,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:09,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:11:09,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:11:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 251 proven. 44 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 00:11:09,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:11:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 251 proven. 44 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 00:11:11,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342180903] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:11:11,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:11:11,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-09 00:11:11,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929879162] [2025-01-09 00:11:11,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:11:11,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 00:11:11,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:11,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 00:11:11,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:11:11,371 INFO L87 Difference]: Start difference. First operand 100967 states and 108187 transitions. Second operand has 8 states, 8 states have (on average 137.5) internal successors, (1100), 8 states have internal predecessors, (1100), 0 states have call successors, (0), 0 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:11:16,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:16,830 INFO L93 Difference]: Finished difference Result 233050 states and 248958 transitions. [2025-01-09 00:11:16,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 00:11:16,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 137.5) internal successors, (1100), 8 states have internal predecessors, (1100), 0 states have call successors, (0), 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 504 [2025-01-09 00:11:16,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:17,015 INFO L225 Difference]: With dead ends: 233050 [2025-01-09 00:11:17,015 INFO L226 Difference]: Without dead ends: 131235 [2025-01-09 00:11:17,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1014 GetRequests, 1006 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:11:17,087 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 2338 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 5965 mSolverCounterSat, 1686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2338 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1686 IncrementalHoareTripleChecker+Valid, 5965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:17,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2338 Valid, 220 Invalid, 7651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1686 Valid, 5965 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 00:11:17,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131235 states. [2025-01-09 00:11:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131235 to 108181. [2025-01-09 00:11:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108181 states, 108180 states have (on average 1.062469957478277) internal successors, (114938), 108180 states have internal predecessors, (114938), 0 states have call successors, (0), 0 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:11:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108181 states to 108181 states and 114938 transitions. [2025-01-09 00:11:18,697 INFO L78 Accepts]: Start accepts. Automaton has 108181 states and 114938 transitions. Word has length 504 [2025-01-09 00:11:18,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:18,697 INFO L471 AbstractCegarLoop]: Abstraction has 108181 states and 114938 transitions. [2025-01-09 00:11:18,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 137.5) internal successors, (1100), 8 states have internal predecessors, (1100), 0 states have call successors, (0), 0 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:11:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 108181 states and 114938 transitions. [2025-01-09 00:11:18,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2025-01-09 00:11:18,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:18,712 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-01-09 00:11:18,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 00:11:18,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 00:11:18,913 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:18,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:18,914 INFO L85 PathProgramCache]: Analyzing trace with hash 283875168, now seen corresponding path program 1 times [2025-01-09 00:11:18,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:18,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413369556] [2025-01-09 00:11:18,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:18,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:18,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-01-09 00:11:18,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-01-09 00:11:18,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:18,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 519 proven. 0 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2025-01-09 00:11:19,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:19,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413369556] [2025-01-09 00:11:19,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413369556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:19,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:19,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:11:19,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662019853] [2025-01-09 00:11:19,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:19,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:19,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:19,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:19,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:19,207 INFO L87 Difference]: Start difference. First operand 108181 states and 114938 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:11:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:20,414 INFO L93 Difference]: Finished difference Result 208684 states and 221521 transitions. [2025-01-09 00:11:20,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:20,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 550 [2025-01-09 00:11:20,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:20,549 INFO L225 Difference]: With dead ends: 208684 [2025-01-09 00:11:20,550 INFO L226 Difference]: Without dead ends: 100929 [2025-01-09 00:11:20,618 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:11:20,619 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 590 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:20,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 79 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:11:20,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100929 states. [2025-01-09 00:11:21,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100929 to 100495. [2025-01-09 00:11:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100495 states, 100494 states have (on average 1.0601428941031306) internal successors, (106538), 100494 states have internal predecessors, (106538), 0 states have call successors, (0), 0 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:11:21,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100495 states to 100495 states and 106538 transitions. [2025-01-09 00:11:21,710 INFO L78 Accepts]: Start accepts. Automaton has 100495 states and 106538 transitions. Word has length 550 [2025-01-09 00:11:21,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:21,715 INFO L471 AbstractCegarLoop]: Abstraction has 100495 states and 106538 transitions. [2025-01-09 00:11:21,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:11:21,715 INFO L276 IsEmpty]: Start isEmpty. Operand 100495 states and 106538 transitions. [2025-01-09 00:11:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-01-09 00:11:21,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:21,731 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:11:21,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:11:21,731 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:21,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:21,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2111707249, now seen corresponding path program 1 times [2025-01-09 00:11:21,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:21,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694060249] [2025-01-09 00:11:21,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:21,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:21,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-01-09 00:11:21,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-01-09 00:11:21,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:21,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2025-01-09 00:11:22,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:22,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694060249] [2025-01-09 00:11:22,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694060249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:22,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:22,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:11:22,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13661024] [2025-01-09 00:11:22,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:22,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:22,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:22,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:22,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:22,171 INFO L87 Difference]: Start difference. First operand 100495 states and 106538 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)