./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-simple/nested_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-simple/nested_4.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 fcf77da5263056f8d62c4caf3b92919690d80ef4ff864a75d0d8d1eec10bdccf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:06:47,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:06:47,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:06:47,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:06:47,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:06:47,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:06:47,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:06:47,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:06:47,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:06:47,562 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:06:47,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:06:47,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:06:47,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:06:47,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:06:47,562 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:06:47,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:06:47,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:06:47,562 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:06:47,562 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:06:47,562 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:06:47,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:06:47,562 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:06:47,562 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:06:47,562 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:06:47,563 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:06:47,563 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:06:47,563 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:06:47,563 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:06:47,563 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:06:47,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:06:47,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:06:47,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:06:47,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:06:47,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:06:47,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:06:47,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:06:47,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:06:47,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:06:47,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:06:47,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:06:47,563 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:06:47,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:06:47,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:06:47,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:06:47,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:06:47,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:06:47,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:06:47,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:06:47,564 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 -> fcf77da5263056f8d62c4caf3b92919690d80ef4ff864a75d0d8d1eec10bdccf [2025-01-09 03:06:47,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:06:47,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:06:47,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:06:47,811 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:06:47,812 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:06:47,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_4.c [2025-01-09 03:06:48,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d914ecc9e/434951168eb04b5ea1455f8fd2367042/FLAGabd8b5834 [2025-01-09 03:06:49,141 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:06:49,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_4.c [2025-01-09 03:06:49,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d914ecc9e/434951168eb04b5ea1455f8fd2367042/FLAGabd8b5834 [2025-01-09 03:06:49,503 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d914ecc9e/434951168eb04b5ea1455f8fd2367042 [2025-01-09 03:06:49,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:06:49,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:06:49,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:06:49,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:06:49,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:06:49,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43fe77ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49, skipping insertion in model container [2025-01-09 03:06:49,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,521 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:06:49,621 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/loop-simple/nested_4.c[841,854] [2025-01-09 03:06:49,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:06:49,633 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:06:49,642 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/loop-simple/nested_4.c[841,854] [2025-01-09 03:06:49,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:06:49,654 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:06:49,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49 WrapperNode [2025-01-09 03:06:49,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:06:49,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:06:49,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:06:49,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:06:49,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,682 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-01-09 03:06:49,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:06:49,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:06:49,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:06:49,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:06:49,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,698 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 03:06:49,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,703 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:06:49,712 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:06:49,712 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:06:49,712 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:06:49,713 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (1/1) ... [2025-01-09 03:06:49,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:06:49,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:06:49,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:06:49,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:06:49,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:06:49,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:06:49,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:06:49,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:06:49,791 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:06:49,793 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:06:49,859 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 03:06:49,859 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:06:49,865 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:06:49,866 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 03:06:49,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:06:49 BoogieIcfgContainer [2025-01-09 03:06:49,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:06:49,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:06:49,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:06:49,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:06:49,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:06:49" (1/3) ... [2025-01-09 03:06:49,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71fb77f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:06:49, skipping insertion in model container [2025-01-09 03:06:49,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:49" (2/3) ... [2025-01-09 03:06:49,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71fb77f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:06:49, skipping insertion in model container [2025-01-09 03:06:49,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:06:49" (3/3) ... [2025-01-09 03:06:49,872 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_4.c [2025-01-09 03:06:49,881 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:06:49,882 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested_4.c that has 1 procedures, 13 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 03:06:49,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:06:49,924 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;@1eac333a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:06:49,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:06:49,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 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-01-09 03:06:49,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 03:06:49,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:49,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 03:06:49,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:49,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:49,935 INFO L85 PathProgramCache]: Analyzing trace with hash 28714648, now seen corresponding path program 1 times [2025-01-09 03:06:49,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:49,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834538622] [2025-01-09 03:06:49,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:06:49,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:49,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 03:06:49,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 03:06:49,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:06:49,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:50,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:50,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834538622] [2025-01-09 03:06:50,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834538622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:06:50,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:06:50,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:06:50,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453957254] [2025-01-09 03:06:50,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:06:50,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:06:50,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:50,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:06:50,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:06:50,092 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 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) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:50,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:50,119 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2025-01-09 03:06:50,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:06:50,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-01-09 03:06:50,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:50,126 INFO L225 Difference]: With dead ends: 24 [2025-01-09 03:06:50,126 INFO L226 Difference]: Without dead ends: 13 [2025-01-09 03:06:50,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:06:50,131 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:06:50,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:50,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-09 03:06:50,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2025-01-09 03:06:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:50,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2025-01-09 03:06:50,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 5 [2025-01-09 03:06:50,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:50,158 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2025-01-09 03:06:50,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:50,158 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2025-01-09 03:06:50,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 03:06:50,159 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:50,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:06:50,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:06:50,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:50,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:50,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1806350662, now seen corresponding path program 1 times [2025-01-09 03:06:50,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:50,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068811157] [2025-01-09 03:06:50,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:06:50,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:50,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 03:06:50,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 03:06:50,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:06:50,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:50,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:50,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068811157] [2025-01-09 03:06:50,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068811157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:06:50,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:06:50,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:06:50,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712878154] [2025-01-09 03:06:50,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:06:50,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:06:50,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:50,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:06:50,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:06:50,210 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:50,228 INFO L93 Difference]: Finished difference Result 20 states and 29 transitions. [2025-01-09 03:06:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:06:50,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-01-09 03:06:50,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:50,229 INFO L225 Difference]: With dead ends: 20 [2025-01-09 03:06:50,229 INFO L226 Difference]: Without dead ends: 13 [2025-01-09 03:06:50,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:06:50,229 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:06:50,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 16 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-09 03:06:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2025-01-09 03:06:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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-01-09 03:06:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2025-01-09 03:06:50,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 7 [2025-01-09 03:06:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:50,233 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2025-01-09 03:06:50,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2025-01-09 03:06:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 03:06:50,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:50,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:06:50,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:06:50,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:50,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:50,235 INFO L85 PathProgramCache]: Analyzing trace with hash 331544530, now seen corresponding path program 1 times [2025-01-09 03:06:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:50,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981941673] [2025-01-09 03:06:50,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:06:50,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:50,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 03:06:50,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 03:06:50,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:06:50,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:50,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:50,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:50,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981941673] [2025-01-09 03:06:50,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981941673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:06:50,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:06:50,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:06:50,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479830819] [2025-01-09 03:06:50,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:06:50,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:06:50,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:50,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:06:50,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:06:50,293 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:50,312 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2025-01-09 03:06:50,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:06:50,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-01-09 03:06:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:50,313 INFO L225 Difference]: With dead ends: 21 [2025-01-09 03:06:50,313 INFO L226 Difference]: Without dead ends: 13 [2025-01-09 03:06:50,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:06:50,314 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:06:50,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 16 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:50,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-09 03:06:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-01-09 03:06:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-01-09 03:06:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2025-01-09 03:06:50,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 9 [2025-01-09 03:06:50,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:50,316 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2025-01-09 03:06:50,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2025-01-09 03:06:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 03:06:50,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:50,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:06:50,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:06:50,319 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:50,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:50,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2136711284, now seen corresponding path program 1 times [2025-01-09 03:06:50,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:50,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617273761] [2025-01-09 03:06:50,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:06:50,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:50,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 03:06:50,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 03:06:50,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:06:50,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:50,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:50,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617273761] [2025-01-09 03:06:50,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617273761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:06:50,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:06:50,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:06:50,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453442319] [2025-01-09 03:06:50,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:06:50,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:06:50,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:50,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:06:50,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:06:50,375 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) 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-01-09 03:06:50,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:50,388 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2025-01-09 03:06:50,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:06:50,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) 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-01-09 03:06:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:50,389 INFO L225 Difference]: With dead ends: 22 [2025-01-09 03:06:50,389 INFO L226 Difference]: Without dead ends: 13 [2025-01-09 03:06:50,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:06:50,389 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:06:50,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:50,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-09 03:06:50,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-01-09 03:06:50,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2025-01-09 03:06:50,391 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 11 [2025-01-09 03:06:50,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:50,392 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-01-09 03:06:50,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) 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-01-09 03:06:50,392 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2025-01-09 03:06:50,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 03:06:50,392 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:50,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:06:50,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:06:50,392 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:50,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:50,392 INFO L85 PathProgramCache]: Analyzing trace with hash 647251760, now seen corresponding path program 1 times [2025-01-09 03:06:50,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:50,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782255386] [2025-01-09 03:06:50,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:06:50,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:50,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 03:06:50,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 03:06:50,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:06:50,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:50,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:50,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782255386] [2025-01-09 03:06:50,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782255386] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:06:50,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531110762] [2025-01-09 03:06:50,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:06:50,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:06:50,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:06:50,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:06:50,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:06:50,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 03:06:50,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 03:06:50,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:06:50,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:50,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:06:50,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:06:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:50,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:06:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:50,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531110762] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:06:50,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:06:50,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:06:50,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829711384] [2025-01-09 03:06:50,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:06:50,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:06:50,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:50,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:06:50,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:06:50,538 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-01-09 03:06:50,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:50,556 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2025-01-09 03:06:50,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:06:50,556 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 12 [2025-01-09 03:06:50,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:50,556 INFO L225 Difference]: With dead ends: 26 [2025-01-09 03:06:50,556 INFO L226 Difference]: Without dead ends: 16 [2025-01-09 03:06:50,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:06:50,557 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:06:50,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:50,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-01-09 03:06:50,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-01-09 03:06:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-01-09 03:06:50,559 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2025-01-09 03:06:50,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:50,563 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-01-09 03:06:50,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-01-09 03:06:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-01-09 03:06:50,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 03:06:50,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:50,565 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:06:50,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:06:50,766 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-01-09 03:06:50,766 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:50,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1899178124, now seen corresponding path program 2 times [2025-01-09 03:06:50,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:50,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462429593] [2025-01-09 03:06:50,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:06:50,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:50,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-09 03:06:50,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 03:06:50,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:06:50,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:06:50,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:50,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462429593] [2025-01-09 03:06:50,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462429593] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:06:50,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218476208] [2025-01-09 03:06:50,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:06:50,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:06:50,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:06:50,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:06:50,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:06:50,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-09 03:06:50,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 03:06:50,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:06:50,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:50,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:06:50,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:06:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:50,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:06:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:06:50,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218476208] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:06:50,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:06:50,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2025-01-09 03:06:50,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647631534] [2025-01-09 03:06:50,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:06:50,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:06:50,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:50,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:06:50,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:06:50,954 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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-01-09 03:06:51,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:51,074 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2025-01-09 03:06:51,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 03:06:51,075 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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) Word has length 15 [2025-01-09 03:06:51,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:51,075 INFO L225 Difference]: With dead ends: 46 [2025-01-09 03:06:51,075 INFO L226 Difference]: Without dead ends: 33 [2025-01-09 03:06:51,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2025-01-09 03:06:51,076 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:06:51,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 40 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:51,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-09 03:06:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2025-01-09 03:06:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-01-09 03:06:51,083 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 15 [2025-01-09 03:06:51,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:51,083 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-01-09 03:06:51,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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-01-09 03:06:51,083 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-01-09 03:06:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 03:06:51,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:51,084 INFO L218 NwaCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:06:51,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:06:51,284 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-01-09 03:06:51,284 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:51,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:51,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1974671290, now seen corresponding path program 3 times [2025-01-09 03:06:51,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:51,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520333794] [2025-01-09 03:06:51,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:06:51,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:51,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 11 equivalence classes. [2025-01-09 03:06:51,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 7 of 25 statements. [2025-01-09 03:06:51,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:06:51,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-01-09 03:06:51,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:51,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520333794] [2025-01-09 03:06:51,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520333794] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:06:51,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70686355] [2025-01-09 03:06:51,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:06:51,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:06:51,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:06:51,314 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:06:51,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:06:51,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 11 equivalence classes. [2025-01-09 03:06:51,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 7 of 25 statements. [2025-01-09 03:06:51,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:06:51,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:51,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:06:51,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:06:51,368 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-01-09 03:06:51,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:06:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-01-09 03:06:51,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70686355] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:06:51,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:06:51,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:06:51,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008813106] [2025-01-09 03:06:51,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:06:51,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:06:51,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:51,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:06:51,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:06:51,404 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:51,443 INFO L93 Difference]: Finished difference Result 89 states and 107 transitions. [2025-01-09 03:06:51,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:06:51,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 25 [2025-01-09 03:06:51,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:51,444 INFO L225 Difference]: With dead ends: 89 [2025-01-09 03:06:51,444 INFO L226 Difference]: Without dead ends: 86 [2025-01-09 03:06:51,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:06:51,445 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:06:51,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-09 03:06:51,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-01-09 03:06:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.2) internal successors, (102), 85 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2025-01-09 03:06:51,457 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 25 [2025-01-09 03:06:51,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:51,458 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2025-01-09 03:06:51,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2025-01-09 03:06:51,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 03:06:51,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:51,459 INFO L218 NwaCegarLoop]: trace histogram [48, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 03:06:51,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:06:51,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:06:51,660 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:51,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:51,660 INFO L85 PathProgramCache]: Analyzing trace with hash -631678128, now seen corresponding path program 4 times [2025-01-09 03:06:51,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:51,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459203298] [2025-01-09 03:06:51,660 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 03:06:51,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:51,668 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-01-09 03:06:51,672 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 84 of 85 statements. [2025-01-09 03:06:51,672 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 03:06:51,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1644 backedges. 631 proven. 1 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 03:06:51,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:51,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459203298] [2025-01-09 03:06:51,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459203298] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:06:51,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851848964] [2025-01-09 03:06:51,758 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 03:06:51,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:06:51,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:06:51,762 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:06:51,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:06:51,790 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-01-09 03:06:51,816 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 84 of 85 statements. [2025-01-09 03:06:51,816 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 03:06:51,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:51,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 03:06:51,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:06:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1644 backedges. 626 proven. 52 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2025-01-09 03:06:51,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:06:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1644 backedges. 626 proven. 52 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2025-01-09 03:06:51,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851848964] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:06:51,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:06:51,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-01-09 03:06:51,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585918349] [2025-01-09 03:06:51,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:06:51,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:06:51,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:51,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:06:51,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:06:51,909 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:52,095 INFO L93 Difference]: Finished difference Result 692 states and 848 transitions. [2025-01-09 03:06:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 03:06:52,095 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 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 85 [2025-01-09 03:06:52,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:52,098 INFO L225 Difference]: With dead ends: 692 [2025-01-09 03:06:52,098 INFO L226 Difference]: Without dead ends: 610 [2025-01-09 03:06:52,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2025-01-09 03:06:52,102 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 32 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:06:52,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 31 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:52,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-01-09 03:06:52,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 414. [2025-01-09 03:06:52,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.1476997578692494) internal successors, (474), 413 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 474 transitions. [2025-01-09 03:06:52,176 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 474 transitions. Word has length 85 [2025-01-09 03:06:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:52,176 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 474 transitions. [2025-01-09 03:06:52,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 474 transitions. [2025-01-09 03:06:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-01-09 03:06:52,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:52,180 INFO L218 NwaCegarLoop]: trace histogram [288, 48, 48, 8, 8, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 03:06:52,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:06:52,385 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,SelfDestructingSolverStorable7 [2025-01-09 03:06:52,385 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:52,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:52,386 INFO L85 PathProgramCache]: Analyzing trace with hash 341578128, now seen corresponding path program 5 times [2025-01-09 03:06:52,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:52,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343909119] [2025-01-09 03:06:52,386 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 03:06:52,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:52,409 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 413 statements into 205 equivalence classes. [2025-01-09 03:06:52,487 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 102 check-sat command(s) and asserted 204 of 413 statements. [2025-01-09 03:06:52,488 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 102 check-sat command(s) [2025-01-09 03:06:52,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 57896 backedges. 36311 proven. 1816 refuted. 0 times theorem prover too weak. 19769 trivial. 0 not checked. [2025-01-09 03:06:52,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:52,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343909119] [2025-01-09 03:06:52,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343909119] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:06:52,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714316739] [2025-01-09 03:06:52,682 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 03:06:52,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:06:52,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:06:52,684 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:06:52,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:06:52,748 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 413 statements into 205 equivalence classes. [2025-01-09 03:06:52,853 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 102 check-sat command(s) and asserted 204 of 413 statements. [2025-01-09 03:06:52,853 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 102 check-sat command(s) [2025-01-09 03:06:52,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:52,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 03:06:52,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:06:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 57896 backedges. 36311 proven. 1816 refuted. 0 times theorem prover too weak. 19769 trivial. 0 not checked. [2025-01-09 03:06:53,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:06:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 57896 backedges. 36311 proven. 1816 refuted. 0 times theorem prover too weak. 19769 trivial. 0 not checked. [2025-01-09 03:06:53,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714316739] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:06:53,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:06:53,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 03:06:53,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856830677] [2025-01-09 03:06:53,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:06:53,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:06:53,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:53,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:06:53,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:06:53,140 INFO L87 Difference]: Start difference. First operand 414 states and 474 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:53,249 INFO L93 Difference]: Finished difference Result 1524 states and 1757 transitions. [2025-01-09 03:06:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:06:53,249 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 413 [2025-01-09 03:06:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:53,254 INFO L225 Difference]: With dead ends: 1524 [2025-01-09 03:06:53,254 INFO L226 Difference]: Without dead ends: 1214 [2025-01-09 03:06:53,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 823 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:06:53,255 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:06:53,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 31 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:53,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-01-09 03:06:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2025-01-09 03:06:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1213 states have (on average 1.1426215993404782) internal successors, (1386), 1213 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1386 transitions. [2025-01-09 03:06:53,351 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1386 transitions. Word has length 413 [2025-01-09 03:06:53,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:53,352 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1386 transitions. [2025-01-09 03:06:53,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1386 transitions. [2025-01-09 03:06:53,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1214 [2025-01-09 03:06:53,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:06:53,388 INFO L218 NwaCegarLoop]: trace histogram [864, 144, 144, 24, 24, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 03:06:53,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:06:53,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:06:53,593 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:06:53,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:06:53,594 INFO L85 PathProgramCache]: Analyzing trace with hash 415972368, now seen corresponding path program 6 times [2025-01-09 03:06:53,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:06:53,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120076664] [2025-01-09 03:06:53,594 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 03:06:53,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:06:53,634 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1213 statements into 605 equivalence classes. [2025-01-09 03:06:54,276 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 605 check-sat command(s) and asserted 1213 of 1213 statements. [2025-01-09 03:06:54,277 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 605 check-sat command(s) [2025-01-09 03:06:54,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:06:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 521944 backedges. 205283 proven. 0 refuted. 0 times theorem prover too weak. 316661 trivial. 0 not checked. [2025-01-09 03:06:56,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:06:56,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120076664] [2025-01-09 03:06:56,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120076664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:06:56,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:06:56,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 03:06:56,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497386573] [2025-01-09 03:06:56,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:06:56,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:06:56,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:06:56,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:06:56,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:06:56,441 INFO L87 Difference]: Start difference. First operand 1214 states and 1386 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:56,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:06:56,640 INFO L93 Difference]: Finished difference Result 1214 states and 1386 transitions. [2025-01-09 03:06:56,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:06:56,641 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 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 1213 [2025-01-09 03:06:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:06:56,644 INFO L225 Difference]: With dead ends: 1214 [2025-01-09 03:06:56,644 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 03:06:56,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:06:56,649 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:06:56,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:06:56,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 03:06:56,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 03:06:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 03:06:56,651 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1213 [2025-01-09 03:06:56,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:06:56,653 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 03:06:56,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:06:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 03:06:56,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 03:06:56,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 03:06:56,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:06:56,658 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2025-01-09 03:06:56,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 03:08:06,420 WARN L286 SmtUtils]: Spent 1.16m on a formula simplification. DAG size of input: 1571 DAG size of output: 1412 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-09 03:08:27,504 WARN L286 SmtUtils]: Spent 19.74s on a formula simplification. DAG size of input: 1412 DAG size of output: 11 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-01-09 03:08:28,240 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 03:08:28,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:08:28 BoogieIcfgContainer [2025-01-09 03:08:28,250 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 03:08:28,251 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 03:08:28,251 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 03:08:28,251 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 03:08:28,252 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:06:49" (3/4) ... [2025-01-09 03:08:28,253 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 03:08:28,258 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-01-09 03:08:28,258 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 03:08:28,258 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 03:08:28,258 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 03:08:28,313 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 03:08:28,314 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 03:08:28,314 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 03:08:28,315 INFO L158 Benchmark]: Toolchain (without parser) took 98808.69ms. Allocated memory was 201.3MB in the beginning and 671.1MB in the end (delta: 469.8MB). Free memory was 157.2MB in the beginning and 296.4MB in the end (delta: -139.2MB). Peak memory consumption was 330.6MB. Max. memory is 16.1GB. [2025-01-09 03:08:28,315 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:08:28,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 149.25ms. Allocated memory is still 201.3MB. Free memory was 157.2MB in the beginning and 146.6MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:08:28,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.93ms. Allocated memory is still 201.3MB. Free memory was 146.6MB in the beginning and 145.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:08:28,316 INFO L158 Benchmark]: Boogie Preprocessor took 28.95ms. Allocated memory is still 201.3MB. Free memory was 145.4MB in the beginning and 144.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:08:28,316 INFO L158 Benchmark]: RCFGBuilder took 154.52ms. Allocated memory is still 201.3MB. Free memory was 144.3MB in the beginning and 133.5MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:08:28,316 INFO L158 Benchmark]: TraceAbstraction took 98382.35ms. Allocated memory was 201.3MB in the beginning and 671.1MB in the end (delta: 469.8MB). Free memory was 133.2MB in the beginning and 304.5MB in the end (delta: -171.3MB). Peak memory consumption was 368.1MB. Max. memory is 16.1GB. [2025-01-09 03:08:28,317 INFO L158 Benchmark]: Witness Printer took 63.43ms. Allocated memory is still 671.1MB. Free memory was 304.5MB in the beginning and 296.4MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:08:28,318 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.25ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 149.25ms. Allocated memory is still 201.3MB. Free memory was 157.2MB in the beginning and 146.6MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.93ms. Allocated memory is still 201.3MB. Free memory was 146.6MB in the beginning and 145.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.95ms. Allocated memory is still 201.3MB. Free memory was 145.4MB in the beginning and 144.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 154.52ms. Allocated memory is still 201.3MB. Free memory was 144.3MB in the beginning and 133.5MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 98382.35ms. Allocated memory was 201.3MB in the beginning and 671.1MB in the end (delta: 469.8MB). Free memory was 133.2MB in the beginning and 304.5MB in the end (delta: -171.3MB). Peak memory consumption was 368.1MB. Max. memory is 16.1GB. * Witness Printer took 63.43ms. Allocated memory is still 671.1MB. Free memory was 304.5MB in the beginning and 296.4MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. 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: 32]: 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, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 10, TraceHistogramMax: 864, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 228 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 164 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 95 mSDtfsCounter, 164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1164 GetRequests, 1089 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1214occurred in iteration=9, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 209 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2345 NumberOfCodeBlocks, 1889 NumberOfCodeBlocksAsserted, 825 NumberOfCheckSat, 2875 ConstructedInterpolants, 0 QuantifiedInterpolants, 4629 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1020 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 695329/700909 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: 22]: Loop Invariant Derived loop invariant: ((((a <= 6) && (6 == b)) && (6 == d)) && (6 == c)) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((c <= 5) && (d <= 6)) && (a <= 5)) && (b <= 5)) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((a <= 5) && (b <= 5)) && (6 == d)) && (c <= 6)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((a <= 5) && (6 == d)) && (b <= 6)) && (6 == c)) RESULT: Ultimate proved your program to be correct! [2025-01-09 03:08:28,332 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