./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label14.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/Problem18_label14.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 a02231a91e38821a474a995aa0f6354f8b6e8aefa7ca1b1921ca101a19abba9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:17:38,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:17:38,368 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:17:38,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:17:38,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:17:38,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:17:38,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:17:38,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:17:38,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:17:38,402 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:17:38,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:17:38,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:17:38,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:17:38,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:17:38,403 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:17:38,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:17:38,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:17:38,404 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:17:38,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:17:38,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:17:38,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:17:38,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:17:38,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:17:38,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:17:38,404 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:17:38,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:17:38,405 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:17:38,405 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:17:38,405 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:17:38,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:17:38,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:17:38,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:17:38,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:17:38,405 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:17:38,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:17:38,406 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:17:38,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:17:38,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:17:38,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:17:38,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:17:38,406 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:17:38,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:17:38,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:17:38,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:17:38,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:17:38,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:17:38,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:17:38,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:17:38,407 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 -> a02231a91e38821a474a995aa0f6354f8b6e8aefa7ca1b1921ca101a19abba9e [2025-01-09 00:17:38,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:17:38,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:17:38,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:17:38,618 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:17:38,618 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:17:38,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label14.c [2025-01-09 00:17:39,816 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22c5c2069/f7fdc9af0e2c49259437d831f42cc583/FLAGc14178569 [2025-01-09 00:17:40,297 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:17:40,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label14.c [2025-01-09 00:17:40,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22c5c2069/f7fdc9af0e2c49259437d831f42cc583/FLAGc14178569 [2025-01-09 00:17:40,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22c5c2069/f7fdc9af0e2c49259437d831f42cc583 [2025-01-09 00:17:40,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:17:40,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:17:40,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:17:40,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:17:40,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:17:40,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:17:40" (1/1) ... [2025-01-09 00:17:40,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226b7fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:40, skipping insertion in model container [2025-01-09 00:17:40,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:17:40" (1/1) ... [2025-01-09 00:17:40,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:17:40,583 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/Problem18_label14.c[5298,5311] [2025-01-09 00:17:40,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:17:40,962 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:17:40,998 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/Problem18_label14.c[5298,5311] [2025-01-09 00:17:41,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:17:41,182 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:17:41,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:41 WrapperNode [2025-01-09 00:17:41,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:17:41,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:17:41,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:17:41,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:17:41,190 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:17:41" (1/1) ... [2025-01-09 00:17:41,235 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:17:41" (1/1) ... [2025-01-09 00:17:41,404 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-01-09 00:17:41,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:17:41,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:17:41,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:17:41,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:17:41,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:41" (1/1) ... [2025-01-09 00:17:41,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:41" (1/1) ... [2025-01-09 00:17:41,429 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:41" (1/1) ... [2025-01-09 00:17:41,525 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:17:41,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:41" (1/1) ... [2025-01-09 00:17:41,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:41" (1/1) ... [2025-01-09 00:17:41,598 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:41" (1/1) ... [2025-01-09 00:17:41,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:41" (1/1) ... [2025-01-09 00:17:41,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:41" (1/1) ... [2025-01-09 00:17:41,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:41" (1/1) ... [2025-01-09 00:17:41,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:41" (1/1) ... [2025-01-09 00:17:41,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:17:41,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:17:41,703 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:17:41,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:17:41,735 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:41" (1/1) ... [2025-01-09 00:17:41,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:17:41,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:17:41,762 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:17:41,765 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:17:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:17:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:17:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:17:41,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:17:41,832 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:17:41,833 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:17:44,501 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-01-09 00:17:44,502 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:17:44,518 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:17:44,518 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:17:44,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:17:44 BoogieIcfgContainer [2025-01-09 00:17:44,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:17:44,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:17:44,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:17:44,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:17:44,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:17:40" (1/3) ... [2025-01-09 00:17:44,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425ed10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:17:44, skipping insertion in model container [2025-01-09 00:17:44,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:41" (2/3) ... [2025-01-09 00:17:44,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425ed10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:17:44, skipping insertion in model container [2025-01-09 00:17:44,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:17:44" (3/3) ... [2025-01-09 00:17:44,526 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label14.c [2025-01-09 00:17:44,536 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:17:44,537 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label14.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:17:44,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:17:44,601 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;@4527a5e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:17:44,602 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:17:44,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 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:17:44,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 00:17:44,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:44,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:17:44,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:44,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:44,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2100804166, now seen corresponding path program 1 times [2025-01-09 00:17:44,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:44,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769033647] [2025-01-09 00:17:44,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:44,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:44,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 00:17:44,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 00:17:44,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:44,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:44,984 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:17:44,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:44,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769033647] [2025-01-09 00:17:44,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769033647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:44,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:44,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:17:44,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14453790] [2025-01-09 00:17:44,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:44,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:17:44,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:45,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:17:45,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:17:45,009 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 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:17:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:49,852 INFO L93 Difference]: Finished difference Result 2898 states and 5642 transitions. [2025-01-09 00:17:49,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:17:49,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-01-09 00:17:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:49,870 INFO L225 Difference]: With dead ends: 2898 [2025-01-09 00:17:49,870 INFO L226 Difference]: Without dead ends: 2074 [2025-01-09 00:17:49,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:17:49,877 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 2021 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5431 mSolverCounterSat, 1014 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2021 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 6445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1014 IncrementalHoareTripleChecker+Valid, 5431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:49,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2021 Valid, 712 Invalid, 6445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1014 Valid, 5431 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 00:17:49,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2025-01-09 00:17:49,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074. [2025-01-09 00:17:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 2073 states have (on average 1.5909310178485288) internal successors, (3298), 2073 states have internal predecessors, (3298), 0 states have call successors, (0), 0 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:17:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3298 transitions. [2025-01-09 00:17:49,963 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3298 transitions. Word has length 50 [2025-01-09 00:17:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:49,963 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 3298 transitions. [2025-01-09 00:17:49,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 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:17:49,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3298 transitions. [2025-01-09 00:17:49,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-09 00:17:49,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:49,968 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:49,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:17:49,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:49,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:49,969 INFO L85 PathProgramCache]: Analyzing trace with hash 910583585, now seen corresponding path program 1 times [2025-01-09 00:17:49,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:49,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361826009] [2025-01-09 00:17:49,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:49,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:50,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 00:17:50,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 00:17:50,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:50,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 00:17:50,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:50,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361826009] [2025-01-09 00:17:50,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361826009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:50,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:50,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:17:50,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940882743] [2025-01-09 00:17:50,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:50,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:17:50,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:50,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:17:50,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:17:50,395 INFO L87 Difference]: Start difference. First operand 2074 states and 3298 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 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:17:52,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:52,860 INFO L93 Difference]: Finished difference Result 5526 states and 9187 transitions. [2025-01-09 00:17:52,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:17:52,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2025-01-09 00:17:52,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:52,871 INFO L225 Difference]: With dead ends: 5526 [2025-01-09 00:17:52,872 INFO L226 Difference]: Without dead ends: 3454 [2025-01-09 00:17:52,875 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:17:52,875 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 590 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:52,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 436 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 00:17:52,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2025-01-09 00:17:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 3454. [2025-01-09 00:17:52,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 3453 states have (on average 1.4694468578048074) internal successors, (5074), 3453 states have internal predecessors, (5074), 0 states have call successors, (0), 0 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:17:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 5074 transitions. [2025-01-09 00:17:52,933 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 5074 transitions. Word has length 232 [2025-01-09 00:17:52,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:52,935 INFO L471 AbstractCegarLoop]: Abstraction has 3454 states and 5074 transitions. [2025-01-09 00:17:52,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 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:17:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 5074 transitions. [2025-01-09 00:17:52,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-01-09 00:17:52,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:52,942 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:17:52,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:17:52,943 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:52,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:52,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1536197762, now seen corresponding path program 1 times [2025-01-09 00:17:52,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:52,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691033606] [2025-01-09 00:17:52,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:52,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:52,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-09 00:17:53,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-09 00:17:53,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:53,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:17:53,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:53,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691033606] [2025-01-09 00:17:53,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691033606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:53,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:53,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:17:53,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993402218] [2025-01-09 00:17:53,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:53,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:17:53,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:53,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:17:53,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:17:53,341 INFO L87 Difference]: Start difference. First operand 3454 states and 5074 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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:17:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:55,791 INFO L93 Difference]: Finished difference Result 8339 states and 11975 transitions. [2025-01-09 00:17:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:17:55,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 297 [2025-01-09 00:17:55,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:55,830 INFO L225 Difference]: With dead ends: 8339 [2025-01-09 00:17:55,830 INFO L226 Difference]: Without dead ends: 4834 [2025-01-09 00:17:55,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:17:55,844 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 529 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 3145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:55,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 637 Invalid, 3145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 00:17:55,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2025-01-09 00:17:55,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4144. [2025-01-09 00:17:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4143 states have (on average 1.3019551049963793) internal successors, (5394), 4143 states have internal predecessors, (5394), 0 states have call successors, (0), 0 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:17:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5394 transitions. [2025-01-09 00:17:55,911 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5394 transitions. Word has length 297 [2025-01-09 00:17:55,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:55,912 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5394 transitions. [2025-01-09 00:17:55,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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:17:55,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5394 transitions. [2025-01-09 00:17:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-01-09 00:17:55,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:55,917 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:55,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:17:55,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:55,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:55,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1354467204, now seen corresponding path program 1 times [2025-01-09 00:17:55,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:55,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177360872] [2025-01-09 00:17:55,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:55,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:55,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 00:17:55,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 00:17:55,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:55,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 00:17:56,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:56,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177360872] [2025-01-09 00:17:56,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177360872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:56,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:56,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:17:56,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954345459] [2025-01-09 00:17:56,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:56,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:17:56,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:56,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:17:56,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:17:56,239 INFO L87 Difference]: Start difference. First operand 4144 states and 5394 transitions. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 2 states have internal predecessors, (351), 0 states have call successors, (0), 0 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:17:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:57,924 INFO L93 Difference]: Finished difference Result 11046 states and 14785 transitions. [2025-01-09 00:17:57,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:17:57,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 2 states have internal predecessors, (351), 0 states have call successors, (0), 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 414 [2025-01-09 00:17:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:57,947 INFO L225 Difference]: With dead ends: 11046 [2025-01-09 00:17:57,948 INFO L226 Difference]: Without dead ends: 6904 [2025-01-09 00:17:57,958 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:17:57,962 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 444 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:57,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 388 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:17:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6904 states. [2025-01-09 00:17:58,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6904 to 6214. [2025-01-09 00:17:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6214 states, 6213 states have (on average 1.2296797038467728) internal successors, (7640), 6213 states have internal predecessors, (7640), 0 states have call successors, (0), 0 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:17:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 7640 transitions. [2025-01-09 00:17:58,091 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 7640 transitions. Word has length 414 [2025-01-09 00:17:58,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:58,091 INFO L471 AbstractCegarLoop]: Abstraction has 6214 states and 7640 transitions. [2025-01-09 00:17:58,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 2 states have internal predecessors, (351), 0 states have call successors, (0), 0 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:17:58,092 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 7640 transitions. [2025-01-09 00:17:58,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-01-09 00:17:58,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:58,096 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:17:58,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:17:58,096 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:58,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:58,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1943343106, now seen corresponding path program 1 times [2025-01-09 00:17:58,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:58,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854883103] [2025-01-09 00:17:58,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:58,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:58,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-01-09 00:17:58,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-09 00:17:58,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:58,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:17:58,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:58,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854883103] [2025-01-09 00:17:58,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854883103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:58,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:58,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:17:58,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103648775] [2025-01-09 00:17:58,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:58,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:17:58,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:58,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:17:58,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:17:58,574 INFO L87 Difference]: Start difference. First operand 6214 states and 7640 transitions. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 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:18:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:00,294 INFO L93 Difference]: Finished difference Result 15876 states and 19412 transitions. [2025-01-09 00:18:00,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:00,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 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 442 [2025-01-09 00:18:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:00,318 INFO L225 Difference]: With dead ends: 15876 [2025-01-09 00:18:00,318 INFO L226 Difference]: Without dead ends: 9664 [2025-01-09 00:18:00,322 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:18:00,323 INFO L435 NwaCegarLoop]: 1118 mSDtfsCounter, 598 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:00,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1125 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 2079 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:18:00,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9664 states. [2025-01-09 00:18:00,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9664 to 9664. [2025-01-09 00:18:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9664 states, 9663 states have (on average 1.1778950636448309) internal successors, (11382), 9663 states have internal predecessors, (11382), 0 states have call successors, (0), 0 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:18:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9664 states to 9664 states and 11382 transitions. [2025-01-09 00:18:00,490 INFO L78 Accepts]: Start accepts. Automaton has 9664 states and 11382 transitions. Word has length 442 [2025-01-09 00:18:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:00,490 INFO L471 AbstractCegarLoop]: Abstraction has 9664 states and 11382 transitions. [2025-01-09 00:18:00,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 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:18:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 9664 states and 11382 transitions. [2025-01-09 00:18:00,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-01-09 00:18:00,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:00,504 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:18:00,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:18:00,504 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:00,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:00,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1644712404, now seen corresponding path program 1 times [2025-01-09 00:18:00,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:00,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651071148] [2025-01-09 00:18:00,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:00,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:00,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-01-09 00:18:00,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-01-09 00:18:00,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:00,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:00,752 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-01-09 00:18:00,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:00,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651071148] [2025-01-09 00:18:00,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651071148] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:00,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:00,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:18:00,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548872055] [2025-01-09 00:18:00,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:00,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:00,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:00,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:00,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:00,755 INFO L87 Difference]: Start difference. First operand 9664 states and 11382 transitions. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 2 states have internal predecessors, (351), 0 states have call successors, (0), 0 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:18:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:02,422 INFO L93 Difference]: Finished difference Result 26226 states and 31184 transitions. [2025-01-09 00:18:02,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:02,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 2 states have internal predecessors, (351), 0 states have call successors, (0), 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 447 [2025-01-09 00:18:02,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:02,442 INFO L225 Difference]: With dead ends: 26226 [2025-01-09 00:18:02,442 INFO L226 Difference]: Without dead ends: 17254 [2025-01-09 00:18:02,446 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:18:02,447 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 466 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:02,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 77 Invalid, 2549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:18:02,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17254 states. [2025-01-09 00:18:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17254 to 16564. [2025-01-09 00:18:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16564 states, 16563 states have (on average 1.1766588178470083) internal successors, (19489), 16563 states have internal predecessors, (19489), 0 states have call successors, (0), 0 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:18:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16564 states to 16564 states and 19489 transitions. [2025-01-09 00:18:02,585 INFO L78 Accepts]: Start accepts. Automaton has 16564 states and 19489 transitions. Word has length 447 [2025-01-09 00:18:02,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:02,585 INFO L471 AbstractCegarLoop]: Abstraction has 16564 states and 19489 transitions. [2025-01-09 00:18:02,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 2 states have internal predecessors, (351), 0 states have call successors, (0), 0 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:18:02,586 INFO L276 IsEmpty]: Start isEmpty. Operand 16564 states and 19489 transitions. [2025-01-09 00:18:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-01-09 00:18:02,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:02,588 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:18:02,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:18:02,588 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:02,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:02,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1078120020, now seen corresponding path program 1 times [2025-01-09 00:18:02,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:02,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414579454] [2025-01-09 00:18:02,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:02,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:02,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-01-09 00:18:02,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-01-09 00:18:02,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:02,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:03,023 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:18:03,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:03,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414579454] [2025-01-09 00:18:03,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414579454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:03,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:03,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:03,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303697759] [2025-01-09 00:18:03,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:03,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:18:03,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:03,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:18:03,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:18:03,026 INFO L87 Difference]: Start difference. First operand 16564 states and 19489 transitions. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 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:18:05,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:05,809 INFO L93 Difference]: Finished difference Result 35886 states and 42295 transitions. [2025-01-09 00:18:05,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:18:05,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 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 449 [2025-01-09 00:18:05,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:05,836 INFO L225 Difference]: With dead ends: 35886 [2025-01-09 00:18:05,836 INFO L226 Difference]: Without dead ends: 20014 [2025-01-09 00:18:05,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:18:05,851 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1449 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 3059 mSolverCounterSat, 1009 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 4068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1009 IncrementalHoareTripleChecker+Valid, 3059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:05,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 100 Invalid, 4068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1009 Valid, 3059 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 00:18:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20014 states. [2025-01-09 00:18:06,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20014 to 20014. [2025-01-09 00:18:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20014 states, 20013 states have (on average 1.1577974316694148) internal successors, (23171), 20013 states have internal predecessors, (23171), 0 states have call successors, (0), 0 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:18:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20014 states to 20014 states and 23171 transitions. [2025-01-09 00:18:06,086 INFO L78 Accepts]: Start accepts. Automaton has 20014 states and 23171 transitions. Word has length 449 [2025-01-09 00:18:06,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:06,087 INFO L471 AbstractCegarLoop]: Abstraction has 20014 states and 23171 transitions. [2025-01-09 00:18:06,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 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:18:06,087 INFO L276 IsEmpty]: Start isEmpty. Operand 20014 states and 23171 transitions. [2025-01-09 00:18:06,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 979 [2025-01-09 00:18:06,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:06,093 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 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:18:06,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:18:06,093 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:06,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:06,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1432586781, now seen corresponding path program 1 times [2025-01-09 00:18:06,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:06,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096661821] [2025-01-09 00:18:06,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:06,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:06,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 978 statements into 1 equivalence classes. [2025-01-09 00:18:06,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 978 of 978 statements. [2025-01-09 00:18:06,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:06,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-09 00:18:06,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:06,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096661821] [2025-01-09 00:18:06,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096661821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:06,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:06,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:06,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704604790] [2025-01-09 00:18:06,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:06,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:06,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:06,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:06,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:06,762 INFO L87 Difference]: Start difference. First operand 20014 states and 23171 transitions. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 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:18:09,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:09,117 INFO L93 Difference]: Finished difference Result 47616 states and 55890 transitions. [2025-01-09 00:18:09,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:09,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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 978 [2025-01-09 00:18:09,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:09,158 INFO L225 Difference]: With dead ends: 47616 [2025-01-09 00:18:09,158 INFO L226 Difference]: Without dead ends: 28984 [2025-01-09 00:18:09,176 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:18:09,177 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 666 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:09,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 223 Invalid, 2351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:18:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28984 states. [2025-01-09 00:18:09,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28984 to 28294. [2025-01-09 00:18:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28294 states, 28293 states have (on average 1.1511681334605732) internal successors, (32570), 28293 states have internal predecessors, (32570), 0 states have call successors, (0), 0 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:18:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28294 states to 28294 states and 32570 transitions. [2025-01-09 00:18:09,450 INFO L78 Accepts]: Start accepts. Automaton has 28294 states and 32570 transitions. Word has length 978 [2025-01-09 00:18:09,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:09,452 INFO L471 AbstractCegarLoop]: Abstraction has 28294 states and 32570 transitions. [2025-01-09 00:18:09,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 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:18:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 28294 states and 32570 transitions. [2025-01-09 00:18:09,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1097 [2025-01-09 00:18:09,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:09,462 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 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:18:09,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:18:09,462 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:09,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:09,463 INFO L85 PathProgramCache]: Analyzing trace with hash -680453787, now seen corresponding path program 1 times [2025-01-09 00:18:09,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:09,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405909482] [2025-01-09 00:18:09,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:09,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:09,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1096 statements into 1 equivalence classes. [2025-01-09 00:18:09,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1096 of 1096 statements. [2025-01-09 00:18:09,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:09,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 513 proven. 531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:18:11,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:11,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405909482] [2025-01-09 00:18:11,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405909482] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:18:11,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323364844] [2025-01-09 00:18:11,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:11,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:18:11,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:18:11,125 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:18:11,126 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:18:11,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1096 statements into 1 equivalence classes. [2025-01-09 00:18:11,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1096 of 1096 statements. [2025-01-09 00:18:11,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:11,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:11,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:18:11,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:18:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 469 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 00:18:12,603 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:18:12,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323364844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:12,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:18:12,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-01-09 00:18:12,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770493459] [2025-01-09 00:18:12,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:12,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:18:12,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:12,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:18:12,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 00:18:12,607 INFO L87 Difference]: Start difference. First operand 28294 states and 32570 transitions. Second operand has 4 states, 4 states have (on average 165.25) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 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:18:15,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:15,401 INFO L93 Difference]: Finished difference Result 62106 states and 71869 transitions. [2025-01-09 00:18:15,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:18:15,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 165.25) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 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 1096 [2025-01-09 00:18:15,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:15,448 INFO L225 Difference]: With dead ends: 62106 [2025-01-09 00:18:15,448 INFO L226 Difference]: Without dead ends: 35194 [2025-01-09 00:18:15,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1103 GetRequests, 1094 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 00:18:15,467 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1068 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2778 mSolverCounterSat, 1451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 4229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1451 IncrementalHoareTripleChecker+Valid, 2778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:15,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 115 Invalid, 4229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1451 Valid, 2778 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 00:18:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35194 states. [2025-01-09 00:18:15,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35194 to 33124. [2025-01-09 00:18:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33124 states, 33123 states have (on average 1.154062132053256) internal successors, (38226), 33123 states have internal predecessors, (38226), 0 states have call successors, (0), 0 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:18:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33124 states to 33124 states and 38226 transitions. [2025-01-09 00:18:15,772 INFO L78 Accepts]: Start accepts. Automaton has 33124 states and 38226 transitions. Word has length 1096 [2025-01-09 00:18:15,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:15,774 INFO L471 AbstractCegarLoop]: Abstraction has 33124 states and 38226 transitions. [2025-01-09 00:18:15,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.25) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 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:18:15,774 INFO L276 IsEmpty]: Start isEmpty. Operand 33124 states and 38226 transitions. [2025-01-09 00:18:15,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1190 [2025-01-09 00:18:15,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:15,784 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 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:18:15,792 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:18:15,984 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:18:15,985 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:15,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:15,986 INFO L85 PathProgramCache]: Analyzing trace with hash 542421215, now seen corresponding path program 1 times [2025-01-09 00:18:15,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:15,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737745466] [2025-01-09 00:18:15,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:15,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:16,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1189 statements into 1 equivalence classes. [2025-01-09 00:18:16,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1189 of 1189 statements. [2025-01-09 00:18:16,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:16,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-01-09 00:18:16,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:16,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737745466] [2025-01-09 00:18:16,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737745466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:16,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:16,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:18:16,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997830724] [2025-01-09 00:18:16,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:16,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:18:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:16,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:18:16,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:18:16,633 INFO L87 Difference]: Start difference. First operand 33124 states and 38226 transitions. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 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:18:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:20,069 INFO L93 Difference]: Finished difference Result 86258 states and 99748 transitions. [2025-01-09 00:18:20,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:18:20,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 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 1189 [2025-01-09 00:18:20,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:20,128 INFO L225 Difference]: With dead ends: 86258 [2025-01-09 00:18:20,129 INFO L226 Difference]: Without dead ends: 53136 [2025-01-09 00:18:20,155 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:18:20,156 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 1394 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4050 mSolverCounterSat, 770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 4820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 770 IncrementalHoareTripleChecker+Valid, 4050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:20,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 211 Invalid, 4820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [770 Valid, 4050 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 00:18:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53136 states. [2025-01-09 00:18:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53136 to 44164. [2025-01-09 00:18:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44164 states, 44163 states have (on average 1.1618549464483845) internal successors, (51311), 44163 states have internal predecessors, (51311), 0 states have call successors, (0), 0 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:18:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44164 states to 44164 states and 51311 transitions. [2025-01-09 00:18:20,707 INFO L78 Accepts]: Start accepts. Automaton has 44164 states and 51311 transitions. Word has length 1189 [2025-01-09 00:18:20,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:20,707 INFO L471 AbstractCegarLoop]: Abstraction has 44164 states and 51311 transitions. [2025-01-09 00:18:20,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 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:18:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 44164 states and 51311 transitions. [2025-01-09 00:18:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1204 [2025-01-09 00:18:20,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:20,729 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 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:18:20,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:18:20,730 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:20,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:20,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1496662953, now seen corresponding path program 1 times [2025-01-09 00:18:20,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:20,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887513462] [2025-01-09 00:18:20,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:20,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:20,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1203 statements into 1 equivalence classes. [2025-01-09 00:18:20,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1203 of 1203 statements. [2025-01-09 00:18:20,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:20,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1505 backedges. 837 proven. 93 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 00:18:22,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:22,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887513462] [2025-01-09 00:18:22,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887513462] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:18:22,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395746577] [2025-01-09 00:18:22,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:22,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:18:22,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:18:22,014 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:18:22,077 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:18:22,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1203 statements into 1 equivalence classes. [2025-01-09 00:18:22,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1203 of 1203 statements. [2025-01-09 00:18:22,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:22,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:22,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 1382 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:18:22,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:18:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1505 backedges. 610 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2025-01-09 00:18:22,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:18:22,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395746577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:22,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:18:22,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 00:18:22,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963662302] [2025-01-09 00:18:22,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:22,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:22,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:22,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:22,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:18:22,580 INFO L87 Difference]: Start difference. First operand 44164 states and 51311 transitions. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 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:18:24,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:24,463 INFO L93 Difference]: Finished difference Result 89706 states and 104136 transitions. [2025-01-09 00:18:24,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:24,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 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 1203 [2025-01-09 00:18:24,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:24,510 INFO L225 Difference]: With dead ends: 89706 [2025-01-09 00:18:24,511 INFO L226 Difference]: Without dead ends: 45544 [2025-01-09 00:18:24,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1207 GetRequests, 1203 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:18:24,537 INFO L435 NwaCegarLoop]: 1128 mSDtfsCounter, 598 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:24,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1135 Invalid, 2255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:18:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45544 states. [2025-01-09 00:18:24,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45544 to 45544. [2025-01-09 00:18:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45544 states, 45543 states have (on average 1.1391212700085633) internal successors, (51879), 45543 states have internal predecessors, (51879), 0 states have call successors, (0), 0 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:18:24,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45544 states to 45544 states and 51879 transitions. [2025-01-09 00:18:24,890 INFO L78 Accepts]: Start accepts. Automaton has 45544 states and 51879 transitions. Word has length 1203 [2025-01-09 00:18:24,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:24,890 INFO L471 AbstractCegarLoop]: Abstraction has 45544 states and 51879 transitions. [2025-01-09 00:18:24,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 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:18:24,891 INFO L276 IsEmpty]: Start isEmpty. Operand 45544 states and 51879 transitions. [2025-01-09 00:18:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1222 [2025-01-09 00:18:24,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:24,900 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 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:18:24,907 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:18:25,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:18:25,101 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:25,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:25,101 INFO L85 PathProgramCache]: Analyzing trace with hash -212104112, now seen corresponding path program 1 times [2025-01-09 00:18:25,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:25,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514470426] [2025-01-09 00:18:25,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:25,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:25,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1221 statements into 1 equivalence classes. [2025-01-09 00:18:25,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1221 of 1221 statements. [2025-01-09 00:18:25,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:25,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1710 backedges. 675 proven. 815 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 00:18:26,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:26,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514470426] [2025-01-09 00:18:26,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514470426] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:18:26,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053606504] [2025-01-09 00:18:26,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:26,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:18:26,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:18:26,644 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:18:26,645 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:18:26,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1221 statements into 1 equivalence classes. [2025-01-09 00:18:26,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1221 of 1221 statements. [2025-01-09 00:18:26,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:26,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:26,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:18:26,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:18:26,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1710 backedges. 611 proven. 0 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2025-01-09 00:18:26,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:18:26,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053606504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:26,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:18:26,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 00:18:26,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620588283] [2025-01-09 00:18:26,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:26,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:26,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:26,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:26,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:18:26,995 INFO L87 Difference]: Start difference. First operand 45544 states and 51879 transitions. Second operand has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 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:18:28,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:29,000 INFO L93 Difference]: Finished difference Result 105576 states and 122144 transitions. [2025-01-09 00:18:29,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:29,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 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 1221 [2025-01-09 00:18:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:29,068 INFO L225 Difference]: With dead ends: 105576 [2025-01-09 00:18:29,068 INFO L226 Difference]: Without dead ends: 60034 [2025-01-09 00:18:29,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1227 GetRequests, 1221 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:18:29,092 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 695 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1862 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 1862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:29,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 275 Invalid, 2336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 1862 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:18:29,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60034 states. [2025-01-09 00:18:29,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60034 to 60034. [2025-01-09 00:18:29,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60034 states, 60033 states have (on average 1.1387903319840755) internal successors, (68365), 60033 states have internal predecessors, (68365), 0 states have call successors, (0), 0 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:18:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60034 states to 60034 states and 68365 transitions. [2025-01-09 00:18:29,831 INFO L78 Accepts]: Start accepts. Automaton has 60034 states and 68365 transitions. Word has length 1221 [2025-01-09 00:18:29,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:29,832 INFO L471 AbstractCegarLoop]: Abstraction has 60034 states and 68365 transitions. [2025-01-09 00:18:29,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 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:18:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 60034 states and 68365 transitions. [2025-01-09 00:18:29,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2025-01-09 00:18:29,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:29,843 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 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:18:29,850 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:18:30,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:18:30,044 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:30,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:30,046 INFO L85 PathProgramCache]: Analyzing trace with hash 988191061, now seen corresponding path program 1 times [2025-01-09 00:18:30,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:30,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163081827] [2025-01-09 00:18:30,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:30,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:30,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1280 statements into 1 equivalence classes. [2025-01-09 00:18:30,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1280 of 1280 statements. [2025-01-09 00:18:30,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:30,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:30,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 1310 trivial. 0 not checked. [2025-01-09 00:18:30,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:30,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163081827] [2025-01-09 00:18:30,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163081827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:30,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:30,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:30,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184256536] [2025-01-09 00:18:30,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:30,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:30,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:30,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:30,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:30,723 INFO L87 Difference]: Start difference. First operand 60034 states and 68365 transitions. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 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:18:32,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:32,755 INFO L93 Difference]: Finished difference Result 146286 states and 168149 transitions. [2025-01-09 00:18:32,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:32,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 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 1280 [2025-01-09 00:18:32,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:32,849 INFO L225 Difference]: With dead ends: 146286 [2025-01-09 00:18:32,849 INFO L226 Difference]: Without dead ends: 78664 [2025-01-09 00:18:32,893 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:18:32,894 INFO L435 NwaCegarLoop]: 1072 mSDtfsCounter, 638 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:32,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1079 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:18:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78664 states. [2025-01-09 00:18:33,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78664 to 77284. [2025-01-09 00:18:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77284 states, 77283 states have (on average 1.117930204572804) internal successors, (86397), 77283 states have internal predecessors, (86397), 0 states have call successors, (0), 0 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:18:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77284 states to 77284 states and 86397 transitions. [2025-01-09 00:18:34,032 INFO L78 Accepts]: Start accepts. Automaton has 77284 states and 86397 transitions. Word has length 1280 [2025-01-09 00:18:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:34,034 INFO L471 AbstractCegarLoop]: Abstraction has 77284 states and 86397 transitions. [2025-01-09 00:18:34,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 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:18:34,035 INFO L276 IsEmpty]: Start isEmpty. Operand 77284 states and 86397 transitions. [2025-01-09 00:18:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1283 [2025-01-09 00:18:34,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:34,047 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 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:18:34,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:18:34,048 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:34,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:34,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2069508090, now seen corresponding path program 1 times [2025-01-09 00:18:34,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:34,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141604401] [2025-01-09 00:18:34,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:34,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:34,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1282 statements into 1 equivalence classes. [2025-01-09 00:18:34,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1282 of 1282 statements. [2025-01-09 00:18:34,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:34,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 541 proven. 189 refuted. 0 times theorem prover too weak. 1203 trivial. 0 not checked. [2025-01-09 00:18:35,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:35,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141604401] [2025-01-09 00:18:35,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141604401] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:18:35,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371622161] [2025-01-09 00:18:35,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:35,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:18:35,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:18:35,192 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:18:35,194 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:18:35,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1282 statements into 1 equivalence classes. [2025-01-09 00:18:35,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1282 of 1282 statements. [2025-01-09 00:18:35,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:35,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:35,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 1484 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 00:18:35,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:18:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 1143 proven. 0 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-01-09 00:18:36,917 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:18:36,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371622161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:36,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:18:36,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-01-09 00:18:36,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799154029] [2025-01-09 00:18:36,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:36,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:18:36,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:36,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:18:36,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:18:36,919 INFO L87 Difference]: Start difference. First operand 77284 states and 86397 transitions. Second operand has 5 states, 5 states have (on average 155.2) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 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:18:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:39,420 INFO L93 Difference]: Finished difference Result 158813 states and 177267 transitions. [2025-01-09 00:18:39,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:18:39,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 155.2) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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 1282 [2025-01-09 00:18:39,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:39,507 INFO L225 Difference]: With dead ends: 158813 [2025-01-09 00:18:39,508 INFO L226 Difference]: Without dead ends: 82116 [2025-01-09 00:18:39,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1286 GetRequests, 1280 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:18:39,551 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 797 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3851 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 4121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 3851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:39,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 397 Invalid, 4121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 3851 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:18:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82116 states. [2025-01-09 00:18:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82116 to 80734. [2025-01-09 00:18:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80734 states, 80733 states have (on average 1.1148848674024252) internal successors, (90008), 80733 states have internal predecessors, (90008), 0 states have call successors, (0), 0 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:18:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80734 states to 80734 states and 90008 transitions. [2025-01-09 00:18:40,525 INFO L78 Accepts]: Start accepts. Automaton has 80734 states and 90008 transitions. Word has length 1282 [2025-01-09 00:18:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:40,526 INFO L471 AbstractCegarLoop]: Abstraction has 80734 states and 90008 transitions. [2025-01-09 00:18:40,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 155.2) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 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:18:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 80734 states and 90008 transitions. [2025-01-09 00:18:40,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1298 [2025-01-09 00:18:40,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:40,538 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:40,545 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:18:40,738 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,SelfDestructingSolverStorable13 [2025-01-09 00:18:40,739 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:40,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:40,739 INFO L85 PathProgramCache]: Analyzing trace with hash 566927628, now seen corresponding path program 1 times [2025-01-09 00:18:40,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:40,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057704323] [2025-01-09 00:18:40,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:40,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:40,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1297 statements into 1 equivalence classes. [2025-01-09 00:18:40,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1297 of 1297 statements. [2025-01-09 00:18:40,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:40,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1753 backedges. 1071 proven. 107 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 00:18:41,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:41,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057704323] [2025-01-09 00:18:41,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057704323] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:18:41,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406380528] [2025-01-09 00:18:41,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:41,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:18:41,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:18:41,937 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:18:41,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 00:18:42,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1297 statements into 1 equivalence classes. [2025-01-09 00:18:42,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1297 of 1297 statements. [2025-01-09 00:18:42,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:42,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:42,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 1479 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:18:42,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:18:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1753 backedges. 1071 proven. 107 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 00:18:42,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:18:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1753 backedges. 1178 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 00:18:43,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406380528] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:18:43,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:18:43,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-01-09 00:18:43,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959874148] [2025-01-09 00:18:43,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:43,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:18:43,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:43,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:18:43,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:18:43,175 INFO L87 Difference]: Start difference. First operand 80734 states and 90008 transitions. Second operand has 5 states, 5 states have (on average 172.4) internal successors, (862), 5 states have internal predecessors, (862), 0 states have call successors, (0), 0 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:18:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:45,507 INFO L93 Difference]: Finished difference Result 175266 states and 196982 transitions. [2025-01-09 00:18:45,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:18:45,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 172.4) internal successors, (862), 5 states have internal predecessors, (862), 0 states have call successors, (0), 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 1297 [2025-01-09 00:18:45,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:45,613 INFO L225 Difference]: With dead ends: 175266 [2025-01-09 00:18:45,613 INFO L226 Difference]: Without dead ends: 95224 [2025-01-09 00:18:45,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2597 GetRequests, 2589 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:18:45,662 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1976 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 1078 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1976 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 3049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1078 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:45,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1976 Valid, 14 Invalid, 3049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1078 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:18:45,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95224 states. [2025-01-09 00:18:46,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95224 to 89704. [2025-01-09 00:18:46,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89704 states, 89703 states have (on average 1.1240872657547685) internal successors, (100834), 89703 states have internal predecessors, (100834), 0 states have call successors, (0), 0 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:18:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89704 states to 89704 states and 100834 transitions. [2025-01-09 00:18:46,471 INFO L78 Accepts]: Start accepts. Automaton has 89704 states and 100834 transitions. Word has length 1297 [2025-01-09 00:18:46,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:46,472 INFO L471 AbstractCegarLoop]: Abstraction has 89704 states and 100834 transitions. [2025-01-09 00:18:46,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 172.4) internal successors, (862), 5 states have internal predecessors, (862), 0 states have call successors, (0), 0 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:18:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 89704 states and 100834 transitions. [2025-01-09 00:18:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1377 [2025-01-09 00:18:46,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:46,497 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 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:18:46,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 00:18:46,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 00:18:46,698 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:46,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:46,699 INFO L85 PathProgramCache]: Analyzing trace with hash 213445520, now seen corresponding path program 1 times [2025-01-09 00:18:46,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:46,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164755866] [2025-01-09 00:18:46,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:46,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:46,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1376 statements into 1 equivalence classes. [2025-01-09 00:18:46,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1376 of 1376 statements. [2025-01-09 00:18:46,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:46,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 1257 proven. 0 refuted. 0 times theorem prover too weak. 1515 trivial. 0 not checked. [2025-01-09 00:18:47,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:47,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164755866] [2025-01-09 00:18:47,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164755866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:47,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:47,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:47,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632706325] [2025-01-09 00:18:47,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:47,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:47,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:47,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:47,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:47,504 INFO L87 Difference]: Start difference. First operand 89704 states and 100834 transitions. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 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:18:49,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:49,357 INFO L93 Difference]: Finished difference Result 175956 states and 197616 transitions. [2025-01-09 00:18:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:49,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 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 1376 [2025-01-09 00:18:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:49,458 INFO L225 Difference]: With dead ends: 175956 [2025-01-09 00:18:49,459 INFO L226 Difference]: Without dead ends: 86944 [2025-01-09 00:18:49,484 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:18:49,484 INFO L435 NwaCegarLoop]: 990 mSDtfsCounter, 679 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1810 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 1810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:49,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 997 Invalid, 2120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 1810 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:18:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86944 states. [2025-01-09 00:18:50,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86944 to 81424. [2025-01-09 00:18:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81424 states, 81423 states have (on average 1.0797072080370411) internal successors, (87913), 81423 states have internal predecessors, (87913), 0 states have call successors, (0), 0 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:18:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81424 states to 81424 states and 87913 transitions. [2025-01-09 00:18:50,426 INFO L78 Accepts]: Start accepts. Automaton has 81424 states and 87913 transitions. Word has length 1376 [2025-01-09 00:18:50,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:50,426 INFO L471 AbstractCegarLoop]: Abstraction has 81424 states and 87913 transitions. [2025-01-09 00:18:50,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 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:18:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 81424 states and 87913 transitions. [2025-01-09 00:18:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1390 [2025-01-09 00:18:50,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:50,441 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 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:18:50,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:18:50,442 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:50,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2039156397, now seen corresponding path program 1 times [2025-01-09 00:18:50,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:50,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580514727] [2025-01-09 00:18:50,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:50,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:50,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1389 statements into 1 equivalence classes. [2025-01-09 00:18:50,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1389 of 1389 statements. [2025-01-09 00:18:50,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:50,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:51,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2826 backedges. 1308 proven. 0 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2025-01-09 00:18:51,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:51,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580514727] [2025-01-09 00:18:51,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580514727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:51,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:51,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:51,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381024716] [2025-01-09 00:18:51,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:51,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:51,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:51,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:51,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:51,770 INFO L87 Difference]: Start difference. First operand 81424 states and 87913 transitions. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 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:18:54,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:54,084 INFO L93 Difference]: Finished difference Result 182856 states and 198394 transitions. [2025-01-09 00:18:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:54,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 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 1389 [2025-01-09 00:18:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:54,216 INFO L225 Difference]: With dead ends: 182856 [2025-01-09 00:18:54,216 INFO L226 Difference]: Without dead ends: 102124 [2025-01-09 00:18:54,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:18:54,258 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 673 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 657 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 657 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:54,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 94 Invalid, 2437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [657 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:18:54,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102124 states. [2025-01-09 00:18:55,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102124 to 98674. [2025-01-09 00:18:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98674 states, 98673 states have (on average 1.0814305838476583) internal successors, (106708), 98673 states have internal predecessors, (106708), 0 states have call successors, (0), 0 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:18:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98674 states to 98674 states and 106708 transitions. [2025-01-09 00:18:55,549 INFO L78 Accepts]: Start accepts. Automaton has 98674 states and 106708 transitions. Word has length 1389 [2025-01-09 00:18:55,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:55,549 INFO L471 AbstractCegarLoop]: Abstraction has 98674 states and 106708 transitions. [2025-01-09 00:18:55,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 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:18:55,550 INFO L276 IsEmpty]: Start isEmpty. Operand 98674 states and 106708 transitions. [2025-01-09 00:18:55,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1440 [2025-01-09 00:18:55,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:55,566 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:55,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:18:55,567 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:55,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:55,567 INFO L85 PathProgramCache]: Analyzing trace with hash -674991086, now seen corresponding path program 1 times [2025-01-09 00:18:55,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:55,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398551062] [2025-01-09 00:18:55,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:55,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:55,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1439 statements into 1 equivalence classes. [2025-01-09 00:18:55,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1439 of 1439 statements. [2025-01-09 00:18:55,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:55,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1902 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 1661 trivial. 0 not checked. [2025-01-09 00:18:56,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:56,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398551062] [2025-01-09 00:18:56,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398551062] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:56,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:56,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:56,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512597628] [2025-01-09 00:18:56,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:56,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:56,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:56,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:56,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:56,987 INFO L87 Difference]: Start difference. First operand 98674 states and 106708 transitions. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 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:18:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:59,121 INFO L93 Difference]: Finished difference Result 196656 states and 212723 transitions. [2025-01-09 00:18:59,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:59,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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 1439 [2025-01-09 00:18:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:59,239 INFO L225 Difference]: With dead ends: 196656 [2025-01-09 00:18:59,239 INFO L226 Difference]: Without dead ends: 98674 [2025-01-09 00:18:59,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:59,293 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 746 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1952 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 2138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:59,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 780 Invalid, 2138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1952 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:18:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98674 states. [2025-01-09 00:19:00,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98674 to 98674. [2025-01-09 00:19:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98674 states, 98673 states have (on average 1.0744073860123844) internal successors, (106015), 98673 states have internal predecessors, (106015), 0 states have call successors, (0), 0 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:19:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98674 states to 98674 states and 106015 transitions. [2025-01-09 00:19:00,964 INFO L78 Accepts]: Start accepts. Automaton has 98674 states and 106015 transitions. Word has length 1439 [2025-01-09 00:19:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:00,964 INFO L471 AbstractCegarLoop]: Abstraction has 98674 states and 106015 transitions. [2025-01-09 00:19:00,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 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:19:00,965 INFO L276 IsEmpty]: Start isEmpty. Operand 98674 states and 106015 transitions. [2025-01-09 00:19:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1454 [2025-01-09 00:19:00,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:00,984 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:00,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:19:00,984 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:00,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:00,986 INFO L85 PathProgramCache]: Analyzing trace with hash 723645171, now seen corresponding path program 1 times [2025-01-09 00:19:00,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:00,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336987186] [2025-01-09 00:19:00,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:00,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:01,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1453 statements into 1 equivalence classes. [2025-01-09 00:19:01,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1453 of 1453 statements. [2025-01-09 00:19:01,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:01,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1994 backedges. 782 proven. 637 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 00:19:02,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:02,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336987186] [2025-01-09 00:19:02,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336987186] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:19:02,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431446584] [2025-01-09 00:19:02,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:02,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:19:02,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:19:02,922 INFO L229 MonitoredProcess]: Starting monitored process 7 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:19:02,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 00:19:03,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1453 statements into 1 equivalence classes. [2025-01-09 00:19:03,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1453 of 1453 statements. [2025-01-09 00:19:03,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:03,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:03,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 1642 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 00:19:03,207 INFO L279 TraceCheckSpWp]: Computing forward predicates...