./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/loops-crafted-1/nested_delay_notd2.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 a8791b6973aa1a0d5421161a634fa2e6c3276aa5fd05ed6d81de7a2762aa206a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:22:03,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:22:03,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:22:03,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:22:03,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:22:03,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:22:03,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:22:03,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:22:03,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:22:03,173 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:22:03,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:22:03,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:22:03,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:22:03,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:22:03,174 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:22:03,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:22:03,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:22:03,175 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:22:03,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:22:03,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:22:03,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:22:03,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:22:03,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:22:03,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:22:03,175 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:22:03,175 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:22:03,175 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:22:03,175 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:22:03,176 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:22:03,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:22:03,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:22:03,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:22:03,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:22:03,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:22:03,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:22:03,177 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:22:03,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:22:03,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:22:03,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:22:03,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:22:03,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:22:03,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:22:03,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:22:03,178 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 -> a8791b6973aa1a0d5421161a634fa2e6c3276aa5fd05ed6d81de7a2762aa206a [2025-02-07 20:22:03,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:22:03,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:22:03,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:22:03,459 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:22:03,459 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:22:03,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2025-02-07 20:22:04,707 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d4a65ed7/5239a48896a4459e9ffa0bfcc755335c/FLAG49a2bc5c4 [2025-02-07 20:22:04,911 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:22:04,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2025-02-07 20:22:04,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d4a65ed7/5239a48896a4459e9ffa0bfcc755335c/FLAG49a2bc5c4 [2025-02-07 20:22:05,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d4a65ed7/5239a48896a4459e9ffa0bfcc755335c [2025-02-07 20:22:05,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:22:05,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:22:05,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:22:05,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:22:05,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:22:05,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:22:05" (1/1) ... [2025-02-07 20:22:05,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f70081f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:22:05, skipping insertion in model container [2025-02-07 20:22:05,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:22:05" (1/1) ... [2025-02-07 20:22:05,295 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:22:05,429 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/loops-crafted-1/nested_delay_notd2.c[468,481] [2025-02-07 20:22:05,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:22:05,453 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:22:05,463 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/loops-crafted-1/nested_delay_notd2.c[468,481] [2025-02-07 20:22:05,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:22:05,485 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:22:05,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:22:05 WrapperNode [2025-02-07 20:22:05,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:22:05,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:22:05,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:22:05,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:22:05,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:22:05" (1/1) ... [2025-02-07 20:22:05,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:22:05" (1/1) ... [2025-02-07 20:22:05,518 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2025-02-07 20:22:05,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:22:05,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:22:05,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:22:05,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:22:05,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:22:05" (1/1) ... [2025-02-07 20:22:05,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:22:05" (1/1) ... [2025-02-07 20:22:05,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:22:05" (1/1) ... [2025-02-07 20:22:05,543 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-02-07 20:22:05,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:22:05" (1/1) ... [2025-02-07 20:22:05,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:22:05" (1/1) ... [2025-02-07 20:22:05,547 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:22:05" (1/1) ... [2025-02-07 20:22:05,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:22:05" (1/1) ... [2025-02-07 20:22:05,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:22:05" (1/1) ... [2025-02-07 20:22:05,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:22:05" (1/1) ... [2025-02-07 20:22:05,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:22:05,555 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:22:05,557 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:22:05,557 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:22:05,558 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:22:05" (1/1) ... [2025-02-07 20:22:05,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:22:05,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:22:05,587 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-02-07 20:22:05,589 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-02-07 20:22:05,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:22:05,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:22:05,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:22:05,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:22:05,662 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:22:05,664 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:22:05,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; [2025-02-07 20:22:05,803 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-02-07 20:22:05,803 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:22:05,813 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:22:05,813 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:22:05,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:22:05 BoogieIcfgContainer [2025-02-07 20:22:05,814 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:22:05,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:22:05,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:22:05,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:22:05,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:22:05" (1/3) ... [2025-02-07 20:22:05,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c224d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:22:05, skipping insertion in model container [2025-02-07 20:22:05,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:22:05" (2/3) ... [2025-02-07 20:22:05,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c224d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:22:05, skipping insertion in model container [2025-02-07 20:22:05,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:22:05" (3/3) ... [2025-02-07 20:22:05,825 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2025-02-07 20:22:05,838 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:22:05,840 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested_delay_notd2.c that has 1 procedures, 18 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 20:22:05,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:22:05,905 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;@29e72092, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:22:05,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:22:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 20:22:05,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:22:05,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:22:05,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:22:05,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:22:05,919 INFO L85 PathProgramCache]: Analyzing trace with hash 40607504, now seen corresponding path program 1 times [2025-02-07 20:22:05,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:22:05,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179268424] [2025-02-07 20:22:05,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:22:05,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:22:05,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 20:22:06,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 20:22:06,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:22:06,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:06,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:22:06,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:22:06,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179268424] [2025-02-07 20:22:06,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179268424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:22:06,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:22:06,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:22:06,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855809731] [2025-02-07 20:22:06,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:22:06,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:22:06,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:22:06,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:22:06,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:22:06,064 INFO L87 Difference]: Start difference. First operand has 18 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:06,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:22:06,071 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2025-02-07 20:22:06,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:22:06,072 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-02-07 20:22:06,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:22:06,075 INFO L225 Difference]: With dead ends: 32 [2025-02-07 20:22:06,076 INFO L226 Difference]: Without dead ends: 15 [2025-02-07 20:22:06,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:22:06,079 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:22:06,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:22:06,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-07 20:22:06,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-07 20:22:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2025-02-07 20:22:06,101 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 11 [2025-02-07 20:22:06,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:22:06,101 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-02-07 20:22:06,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2025-02-07 20:22:06,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 20:22:06,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:22:06,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:22:06,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:22:06,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:22:06,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:22:06,104 INFO L85 PathProgramCache]: Analyzing trace with hash -155906001, now seen corresponding path program 1 times [2025-02-07 20:22:06,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:22:06,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618845323] [2025-02-07 20:22:06,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:22:06,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:22:06,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 20:22:06,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 20:22:06,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:22:06,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:22:06,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:22:06,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618845323] [2025-02-07 20:22:06,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618845323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:22:06,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:22:06,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:22:06,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141844435] [2025-02-07 20:22:06,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:22:06,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:22:06,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:22:06,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:22:06,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:22:06,261 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:22:06,314 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2025-02-07 20:22:06,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:22:06,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-02-07 20:22:06,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:22:06,315 INFO L225 Difference]: With dead ends: 26 [2025-02-07 20:22:06,315 INFO L226 Difference]: Without dead ends: 18 [2025-02-07 20:22:06,316 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-02-07 20:22:06,316 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:22:06,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 14 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:22:06,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-07 20:22:06,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-02-07 20:22:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-02-07 20:22:06,324 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 11 [2025-02-07 20:22:06,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:22:06,325 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-02-07 20:22:06,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:06,325 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2025-02-07 20:22:06,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 20:22:06,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:22:06,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:22:06,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:22:06,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:22:06,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:22:06,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1465273307, now seen corresponding path program 1 times [2025-02-07 20:22:06,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:22:06,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692268063] [2025-02-07 20:22:06,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:22:06,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:22:06,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:22:06,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:22:06,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:22:06,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:06,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:22:06,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:22:06,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692268063] [2025-02-07 20:22:06,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692268063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:22:06,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:22:06,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:22:06,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977500487] [2025-02-07 20:22:06,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:22:06,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:22:06,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:22:06,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:22:06,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:22:06,391 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:06,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:22:06,427 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2025-02-07 20:22:06,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:22:06,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-02-07 20:22:06,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:22:06,430 INFO L225 Difference]: With dead ends: 25 [2025-02-07 20:22:06,430 INFO L226 Difference]: Without dead ends: 20 [2025-02-07 20:22:06,430 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-02-07 20:22:06,431 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:22:06,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 25 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:22:06,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-07 20:22:06,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2025-02-07 20:22:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2025-02-07 20:22:06,435 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 14 [2025-02-07 20:22:06,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:22:06,435 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-02-07 20:22:06,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:06,436 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2025-02-07 20:22:06,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 20:22:06,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:22:06,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:22:06,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:22:06,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:22:06,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:22:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1493902458, now seen corresponding path program 1 times [2025-02-07 20:22:06,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:22:06,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364555033] [2025-02-07 20:22:06,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:22:06,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:22:06,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:22:06,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:22:06,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:22:06,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:22:06,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:22:06,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364555033] [2025-02-07 20:22:06,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364555033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:22:06,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:22:06,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:22:06,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072967776] [2025-02-07 20:22:06,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:22:06,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:22:06,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:22:06,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:22:06,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:22:06,572 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:06,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:22:06,597 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2025-02-07 20:22:06,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:22:06,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-02-07 20:22:06,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:22:06,598 INFO L225 Difference]: With dead ends: 22 [2025-02-07 20:22:06,598 INFO L226 Difference]: Without dead ends: 18 [2025-02-07 20:22:06,598 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-02-07 20:22:06,600 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:22:06,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 16 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:22:06,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-07 20:22:06,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-07 20:22:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2025-02-07 20:22:06,608 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 14 [2025-02-07 20:22:06,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:22:06,608 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-02-07 20:22:06,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:06,608 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2025-02-07 20:22:06,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 20:22:06,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:22:06,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:22:06,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:22:06,609 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:22:06,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:22:06,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1493932249, now seen corresponding path program 1 times [2025-02-07 20:22:06,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:22:06,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988049330] [2025-02-07 20:22:06,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:22:06,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:22:06,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:22:06,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:22:06,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:22:06,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:22:06,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:22:06,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988049330] [2025-02-07 20:22:06,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988049330] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:22:06,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751396898] [2025-02-07 20:22:06,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:22:06,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:22:06,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:22:06,729 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-02-07 20:22:06,730 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-02-07 20:22:06,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:22:06,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:22:06,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:22:06,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:06,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 20:22:06,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:22:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:22:06,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:22:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:22:06,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751396898] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:22:06,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:22:06,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-07 20:22:06,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404999054] [2025-02-07 20:22:06,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:22:06,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 20:22:06,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:22:06,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 20:22:06,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:22:06,920 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:22:07,004 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2025-02-07 20:22:07,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:22:07,004 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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 14 [2025-02-07 20:22:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:22:07,023 INFO L225 Difference]: With dead ends: 37 [2025-02-07 20:22:07,023 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 20:22:07,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-02-07 20:22:07,024 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:22:07,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 22 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:22:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 20:22:07,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-07 20:22:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-02-07 20:22:07,034 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2025-02-07 20:22:07,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:22:07,034 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-02-07 20:22:07,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-02-07 20:22:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:22:07,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:22:07,036 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:22:07,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 20:22:07,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:22:07,241 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:22:07,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:22:07,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1426890285, now seen corresponding path program 2 times [2025-02-07 20:22:07,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:22:07,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548469328] [2025-02-07 20:22:07,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:22:07,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:22:07,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-07 20:22:07,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:22:07,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:22:07,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 20:22:07,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:22:07,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548469328] [2025-02-07 20:22:07,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548469328] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:22:07,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440045601] [2025-02-07 20:22:07,390 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:22:07,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:22:07,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:22:07,393 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-02-07 20:22:07,395 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-02-07 20:22:07,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-07 20:22:07,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:22:07,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:22:07,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:07,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 20:22:07,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:22:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 20:22:07,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:22:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 20:22:07,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440045601] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:22:07,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:22:07,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-02-07 20:22:07,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267821924] [2025-02-07 20:22:07,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:22:07,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 20:22:07,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:22:07,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 20:22:07,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-07 20:22:07,637 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:22:07,881 INFO L93 Difference]: Finished difference Result 85 states and 112 transitions. [2025-02-07 20:22:07,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 20:22:07,882 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 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 23 [2025-02-07 20:22:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:22:07,882 INFO L225 Difference]: With dead ends: 85 [2025-02-07 20:22:07,884 INFO L226 Difference]: Without dead ends: 67 [2025-02-07 20:22:07,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-02-07 20:22:07,885 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 109 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:22:07,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 44 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:22:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-07 20:22:07,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2025-02-07 20:22:07,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:07,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2025-02-07 20:22:07,900 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 23 [2025-02-07 20:22:07,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:22:07,900 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2025-02-07 20:22:07,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2025-02-07 20:22:07,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:22:07,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:22:07,902 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:22:07,908 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-02-07 20:22:08,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:22:08,103 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:22:08,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:22:08,104 INFO L85 PathProgramCache]: Analyzing trace with hash 258997997, now seen corresponding path program 1 times [2025-02-07 20:22:08,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:22:08,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987008028] [2025-02-07 20:22:08,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:22:08,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:22:08,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:22:08,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:22:08,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:22:08,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-07 20:22:08,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:22:08,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987008028] [2025-02-07 20:22:08,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987008028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:22:08,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:22:08,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:22:08,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353127334] [2025-02-07 20:22:08,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:22:08,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:22:08,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:22:08,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:22:08,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:22:08,153 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:22:08,173 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2025-02-07 20:22:08,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:22:08,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 23 [2025-02-07 20:22:08,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:22:08,174 INFO L225 Difference]: With dead ends: 57 [2025-02-07 20:22:08,175 INFO L226 Difference]: Without dead ends: 49 [2025-02-07 20:22:08,175 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-02-07 20:22:08,176 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:22:08,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 31 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:22:08,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-07 20:22:08,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-07 20:22:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2025-02-07 20:22:08,187 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 23 [2025-02-07 20:22:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:22:08,188 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2025-02-07 20:22:08,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2025-02-07 20:22:08,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 20:22:08,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:22:08,189 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:22:08,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 20:22:08,189 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:22:08,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:22:08,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1372645430, now seen corresponding path program 1 times [2025-02-07 20:22:08,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:22:08,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280329953] [2025-02-07 20:22:08,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:22:08,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:22:08,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 20:22:08,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 20:22:08,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:22:08,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:22:08,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:22:08,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280329953] [2025-02-07 20:22:08,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280329953] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:22:08,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666366713] [2025-02-07 20:22:08,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:22:08,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:22:08,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:22:08,293 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-02-07 20:22:08,297 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-02-07 20:22:08,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 20:22:08,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 20:22:08,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:22:08,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:08,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 20:22:08,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:22:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:22:08,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:22:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:22:08,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666366713] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:22:08,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:22:08,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-02-07 20:22:08,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376908391] [2025-02-07 20:22:08,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:22:08,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-07 20:22:08,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:22:08,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-07 20:22:08,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-02-07 20:22:08,582 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:22:08,762 INFO L93 Difference]: Finished difference Result 116 states and 159 transitions. [2025-02-07 20:22:08,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 20:22:08,764 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 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 24 [2025-02-07 20:22:08,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:22:08,764 INFO L225 Difference]: With dead ends: 116 [2025-02-07 20:22:08,765 INFO L226 Difference]: Without dead ends: 103 [2025-02-07 20:22:08,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2025-02-07 20:22:08,767 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 98 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:22:08,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 25 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:22:08,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-07 20:22:08,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-02-07 20:22:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.2352941176470589) internal successors, (126), 102 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2025-02-07 20:22:08,784 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 24 [2025-02-07 20:22:08,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:22:08,785 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2025-02-07 20:22:08,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2025-02-07 20:22:08,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-07 20:22:08,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:22:08,787 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:22:08,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 20:22:08,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:22:08,988 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:22:08,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:22:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash -675051850, now seen corresponding path program 2 times [2025-02-07 20:22:08,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:22:08,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453346605] [2025-02-07 20:22:08,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:22:08,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:22:08,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-07 20:22:09,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 20:22:09,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:22:09,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:22:09,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:22:09,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453346605] [2025-02-07 20:22:09,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453346605] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:22:09,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859543143] [2025-02-07 20:22:09,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:22:09,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:22:09,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:22:09,227 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-02-07 20:22:09,229 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-02-07 20:22:09,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-07 20:22:09,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 20:22:09,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:22:09,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:09,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-07 20:22:09,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:22:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:22:09,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:22:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:22:09,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859543143] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:22:09,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:22:09,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2025-02-07 20:22:09,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883378872] [2025-02-07 20:22:09,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:22:09,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-07 20:22:09,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:22:09,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-07 20:22:09,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=678, Unknown=0, NotChecked=0, Total=1190 [2025-02-07 20:22:09,817 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 35 states, 35 states have (on average 3.0285714285714285) internal successors, (106), 34 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:10,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:22:10,137 INFO L93 Difference]: Finished difference Result 206 states and 281 transitions. [2025-02-07 20:22:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-07 20:22:10,137 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.0285714285714285) internal successors, (106), 34 states have internal predecessors, (106), 0 states have call successors, (0), 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 42 [2025-02-07 20:22:10,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:22:10,138 INFO L225 Difference]: With dead ends: 206 [2025-02-07 20:22:10,139 INFO L226 Difference]: Without dead ends: 193 [2025-02-07 20:22:10,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2025-02-07 20:22:10,140 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:22:10,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 17 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:22:10,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-07 20:22:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-02-07 20:22:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.2291666666666667) internal successors, (236), 192 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 236 transitions. [2025-02-07 20:22:10,160 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 236 transitions. Word has length 42 [2025-02-07 20:22:10,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:22:10,160 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 236 transitions. [2025-02-07 20:22:10,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.0285714285714285) internal successors, (106), 34 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 236 transitions. [2025-02-07 20:22:10,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-07 20:22:10,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:22:10,163 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:22:10,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 20:22:10,367 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,SelfDestructingSolverStorable8 [2025-02-07 20:22:10,367 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:22:10,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:22:10,368 INFO L85 PathProgramCache]: Analyzing trace with hash -645438410, now seen corresponding path program 3 times [2025-02-07 20:22:10,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:22:10,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064566219] [2025-02-07 20:22:10,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:22:10,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:22:10,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 21 equivalence classes. [2025-02-07 20:22:10,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 72 statements. [2025-02-07 20:22:10,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 20:22:10,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2025-02-07 20:22:10,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:22:10,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064566219] [2025-02-07 20:22:10,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064566219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:22:10,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:22:10,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:22:10,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176530038] [2025-02-07 20:22:10,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:22:10,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:22:10,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:22:10,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:22:10,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:22:10,434 INFO L87 Difference]: Start difference. First operand 193 states and 236 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:22:10,464 INFO L93 Difference]: Finished difference Result 200 states and 242 transitions. [2025-02-07 20:22:10,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:22:10,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 72 [2025-02-07 20:22:10,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:22:10,466 INFO L225 Difference]: With dead ends: 200 [2025-02-07 20:22:10,466 INFO L226 Difference]: Without dead ends: 133 [2025-02-07 20:22:10,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:22:10,467 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:22:10,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 14 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:22:10,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-07 20:22:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-02-07 20:22:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.3181818181818181) internal successors, (174), 132 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 174 transitions. [2025-02-07 20:22:10,477 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 174 transitions. Word has length 72 [2025-02-07 20:22:10,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:22:10,477 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 174 transitions. [2025-02-07 20:22:10,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:10,477 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 174 transitions. [2025-02-07 20:22:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-07 20:22:10,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:22:10,478 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:22:10,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 20:22:10,479 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:22:10,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:22:10,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2141018954, now seen corresponding path program 1 times [2025-02-07 20:22:10,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:22:10,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416886117] [2025-02-07 20:22:10,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:22:10,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:22:10,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-07 20:22:10,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-07 20:22:10,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:22:10,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:22:10,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:22:10,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416886117] [2025-02-07 20:22:10,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416886117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:22:10,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:22:10,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-07 20:22:10,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845031442] [2025-02-07 20:22:10,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:22:10,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-07 20:22:10,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:22:10,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-07 20:22:10,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-02-07 20:22:10,920 INFO L87 Difference]: Start difference. First operand 133 states and 174 transitions. Second operand has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:22:11,220 INFO L93 Difference]: Finished difference Result 783 states and 1032 transitions. [2025-02-07 20:22:11,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-07 20:22:11,221 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 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 72 [2025-02-07 20:22:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:22:11,225 INFO L225 Difference]: With dead ends: 783 [2025-02-07 20:22:11,225 INFO L226 Difference]: Without dead ends: 722 [2025-02-07 20:22:11,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-02-07 20:22:11,226 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 245 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:22:11,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 52 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:22:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-02-07 20:22:11,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 136. [2025-02-07 20:22:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.1851851851851851) internal successors, (160), 135 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2025-02-07 20:22:11,261 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 72 [2025-02-07 20:22:11,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:22:11,261 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2025-02-07 20:22:11,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:11,262 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2025-02-07 20:22:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-07 20:22:11,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:22:11,265 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:22:11,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 20:22:11,265 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:22:11,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:22:11,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1253515273, now seen corresponding path program 1 times [2025-02-07 20:22:11,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:22:11,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375156423] [2025-02-07 20:22:11,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:22:11,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:22:11,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-07 20:22:11,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-07 20:22:11,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:22:11,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:22:12,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:22:12,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375156423] [2025-02-07 20:22:12,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375156423] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:22:12,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976623272] [2025-02-07 20:22:12,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:22:12,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:22:12,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:22:12,159 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-02-07 20:22:12,161 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-02-07 20:22:12,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-07 20:22:12,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-07 20:22:12,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:22:12,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:12,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-07 20:22:12,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:22:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:22:13,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:22:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:22:14,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976623272] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:22:14,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:22:14,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 73 [2025-02-07 20:22:14,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900405061] [2025-02-07 20:22:14,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:22:14,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2025-02-07 20:22:14,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:22:14,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2025-02-07 20:22:14,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1574, Invalid=3828, Unknown=0, NotChecked=0, Total=5402 [2025-02-07 20:22:14,818 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand has 74 states, 74 states have (on average 2.77027027027027) internal successors, (205), 73 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:22:15,215 INFO L93 Difference]: Finished difference Result 163 states and 194 transitions. [2025-02-07 20:22:15,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-07 20:22:15,216 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 2.77027027027027) internal successors, (205), 73 states have internal predecessors, (205), 0 states have call successors, (0), 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 72 [2025-02-07 20:22:15,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:22:15,217 INFO L225 Difference]: With dead ends: 163 [2025-02-07 20:22:15,218 INFO L226 Difference]: Without dead ends: 82 [2025-02-07 20:22:15,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3023 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1693, Invalid=4627, Unknown=0, NotChecked=0, Total=6320 [2025-02-07 20:22:15,221 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 167 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:22:15,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 55 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:22:15,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-07 20:22:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2025-02-07 20:22:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2025-02-07 20:22:15,231 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 72 [2025-02-07 20:22:15,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:22:15,232 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2025-02-07 20:22:15,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 2.77027027027027) internal successors, (205), 73 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:15,232 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2025-02-07 20:22:15,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-07 20:22:15,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:22:15,233 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:22:15,241 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-02-07 20:22:15,433 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,SelfDestructingSolverStorable11 [2025-02-07 20:22:15,434 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:22:15,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:22:15,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1161057130, now seen corresponding path program 1 times [2025-02-07 20:22:15,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:22:15,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865336915] [2025-02-07 20:22:15,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:22:15,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:22:15,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-07 20:22:15,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-07 20:22:15,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:22:15,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:22:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-02-07 20:22:15,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:22:15,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865336915] [2025-02-07 20:22:15,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865336915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:22:15,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:22:15,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:22:15,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256764304] [2025-02-07 20:22:15,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:22:15,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:22:15,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:22:15,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:22:15,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:22:15,541 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:15,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:22:15,555 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2025-02-07 20:22:15,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:22:15,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 72 [2025-02-07 20:22:15,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:22:15,556 INFO L225 Difference]: With dead ends: 73 [2025-02-07 20:22:15,556 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 20:22:15,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:22:15,557 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:22:15,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:22:15,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 20:22:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 20:22:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 20:22:15,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2025-02-07 20:22:15,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:22:15,559 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 20:22:15,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:22:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 20:22:15,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 20:22:15,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 20:22:15,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 20:22:15,567 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:22:15,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 20:22:17,196 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:22:17,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:22:17 BoogieIcfgContainer [2025-02-07 20:22:17,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:22:17,216 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:22:17,216 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:22:17,217 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:22:17,217 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:22:05" (3/4) ... [2025-02-07 20:22:17,219 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 20:22:17,226 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-07 20:22:17,227 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 20:22:17,227 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 20:22:17,227 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 20:22:17,302 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:22:17,302 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:22:17,302 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:22:17,303 INFO L158 Benchmark]: Toolchain (without parser) took 12027.11ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 125.3MB in the beginning and 129.1MB in the end (delta: -3.8MB). Peak memory consumption was 167.1MB. Max. memory is 16.1GB. [2025-02-07 20:22:17,303 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:22:17,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.36ms. Allocated memory is still 167.8MB. Free memory was 125.3MB in the beginning and 114.5MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:22:17,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.45ms. Allocated memory is still 167.8MB. Free memory was 113.8MB in the beginning and 113.1MB in the end (delta: 674.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:22:17,304 INFO L158 Benchmark]: Boogie Preprocessor took 33.66ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 111.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:22:17,305 INFO L158 Benchmark]: IcfgBuilder took 258.98ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 99.9MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:22:17,305 INFO L158 Benchmark]: TraceAbstraction took 11396.68ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 99.2MB in the beginning and 133.7MB in the end (delta: -34.4MB). Peak memory consumption was 160.8MB. Max. memory is 16.1GB. [2025-02-07 20:22:17,305 INFO L158 Benchmark]: Witness Printer took 85.88ms. Allocated memory is still 343.9MB. Free memory was 133.7MB in the beginning and 129.1MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:22:17,306 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.36ms. Allocated memory is still 167.8MB. Free memory was 125.3MB in the beginning and 114.5MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.45ms. Allocated memory is still 167.8MB. Free memory was 113.8MB in the beginning and 113.1MB in the end (delta: 674.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.66ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 111.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 258.98ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 99.9MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11396.68ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 99.2MB in the beginning and 133.7MB in the end (delta: -34.4MB). Peak memory consumption was 160.8MB. Max. memory is 16.1GB. * Witness Printer took 85.88ms. Allocated memory is still 343.9MB. Free memory was 133.7MB in the beginning and 129.1MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 13, TraceHistogramMax: 20, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 860 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 860 mSDsluCounter, 346 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 190 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1202 IncrementalHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 156 mSDtfsCounter, 1202 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 475 GetRequests, 265 SyntacticMatches, 4 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4001 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=9, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 617 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 639 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 791 ConstructedInterpolants, 0 QuantifiedInterpolants, 4928 SizeOfPredicates, 13 NumberOfNonLiveVariables, 540 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 23 InterpolantComputations, 8 PerfectInterpolantSequences, 1836/4134 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Location Invariant Derived location invariant: ((((((((b == 0) && (1 <= last)) && (20 <= SIZE)) && (c <= SIZE)) && (d == 0)) && (a == 0)) && (st == 1)) || (((((((b == 0) && (1 <= last)) && (20 <= SIZE)) && (c <= SIZE)) && (d == 0)) && (a == 0)) && (((long long) last + 1) <= c))) - InvariantResult [Line: 23]: Location Invariant Derived location invariant: (((((b == 0) && (1 <= last)) && (20 <= SIZE)) && (d == 0)) && (a == 0)) RESULT: Ultimate proved your program to be correct! [2025-02-07 20:22:17,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE