./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/diamond_1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-acceleration/diamond_1-1.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 bd9be28702be20fbd75b67eebfdc5f85895ff340c238c235c391c2a8578e7b23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:14:07,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:14:07,670 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:14:07,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:14:07,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:14:07,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:14:07,703 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:14:07,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:14:07,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:14:07,704 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:14:07,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:14:07,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:14:07,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:14:07,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:14:07,704 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:14:07,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:14:07,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:14:07,704 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:14:07,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:14:07,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:14:07,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:14:07,705 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:14:07,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:14:07,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:14:07,705 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 -> bd9be28702be20fbd75b67eebfdc5f85895ff340c238c235c391c2a8578e7b23 [2025-02-07 20:14:07,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:14:07,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:14:07,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:14:07,941 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:14:07,942 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:14:07,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/diamond_1-1.c [2025-02-07 20:14:09,079 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17ecfd920/a872ea6a7f914a57adf12cd9e9e1b122/FLAG883e872c5 [2025-02-07 20:14:09,265 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:14:09,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-acceleration/diamond_1-1.c [2025-02-07 20:14:09,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17ecfd920/a872ea6a7f914a57adf12cd9e9e1b122/FLAG883e872c5 [2025-02-07 20:14:09,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17ecfd920/a872ea6a7f914a57adf12cd9e9e1b122 [2025-02-07 20:14:09,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:14:09,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:14:09,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:14:09,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:14:09,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:14:09,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:14:09" (1/1) ... [2025-02-07 20:14:09,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62558d6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:14:09, skipping insertion in model container [2025-02-07 20:14:09,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:14:09" (1/1) ... [2025-02-07 20:14:09,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:14:09,411 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-acceleration/diamond_1-1.c[373,386] [2025-02-07 20:14:09,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:14:09,429 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:14:09,436 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-acceleration/diamond_1-1.c[373,386] [2025-02-07 20:14:09,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:14:09,449 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:14:09,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:14:09 WrapperNode [2025-02-07 20:14:09,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:14:09,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:14:09,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:14:09,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:14:09,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:14:09" (1/1) ... [2025-02-07 20:14:09,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:14:09" (1/1) ... [2025-02-07 20:14:09,471 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2025-02-07 20:14:09,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:14:09,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:14:09,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:14:09,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:14:09,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:14:09" (1/1) ... [2025-02-07 20:14:09,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:14:09" (1/1) ... [2025-02-07 20:14:09,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:14:09" (1/1) ... [2025-02-07 20:14:09,489 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 20:14:09,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:14:09" (1/1) ... [2025-02-07 20:14:09,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:14:09" (1/1) ... [2025-02-07 20:14:09,491 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:14:09" (1/1) ... [2025-02-07 20:14:09,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:14:09" (1/1) ... [2025-02-07 20:14:09,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:14:09" (1/1) ... [2025-02-07 20:14:09,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:14:09" (1/1) ... [2025-02-07 20:14:09,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:14:09,494 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:14:09,494 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:14:09,494 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:14:09,496 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:14:09" (1/1) ... [2025-02-07 20:14:09,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:14:09,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:14:09,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 20:14:09,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 20:14:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:14:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:14:09,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:14:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:14:09,587 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:14:09,588 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:14:09,679 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-07 20:14:09,681 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:14:09,690 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:14:09,690 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:14:09,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:14:09 BoogieIcfgContainer [2025-02-07 20:14:09,691 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:14:09,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:14:09,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:14:09,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:14:09,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:14:09" (1/3) ... [2025-02-07 20:14:09,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623850e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:14:09, skipping insertion in model container [2025-02-07 20:14:09,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:14:09" (2/3) ... [2025-02-07 20:14:09,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623850e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:14:09, skipping insertion in model container [2025-02-07 20:14:09,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:14:09" (3/3) ... [2025-02-07 20:14:09,697 INFO L128 eAbstractionObserver]: Analyzing ICFG diamond_1-1.c [2025-02-07 20:14:09,706 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:14:09,707 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG diamond_1-1.c that has 1 procedures, 9 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 20:14:09,737 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:14:09,744 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;@d9fbee8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:14:09,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:14:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 20:14:09,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:14:09,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 20:14:09,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:14:09,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:14:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1196540, now seen corresponding path program 1 times [2025-02-07 20:14:09,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:14:09,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424437993] [2025-02-07 20:14:09,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:14:09,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:14:09,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 20:14:09,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 20:14:09,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:14:09,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:14:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:09,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:14:09,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424437993] [2025-02-07 20:14:09,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424437993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:14:09,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:14:09,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:14:09,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993835671] [2025-02-07 20:14:09,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:14:09,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:14:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:14:09,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:14:09,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:14:09,894 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:09,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:14:09,918 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2025-02-07 20:14:09,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:14:09,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-02-07 20:14:09,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:14:09,924 INFO L225 Difference]: With dead ends: 17 [2025-02-07 20:14:09,925 INFO L226 Difference]: Without dead ends: 8 [2025-02-07 20:14:09,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:14:09,930 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 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-02-07 20:14:09,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:14:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-02-07 20:14:09,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2025-02-07 20:14:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2025-02-07 20:14:09,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2025-02-07 20:14:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:14:09,953 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-02-07 20:14:09,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2025-02-07 20:14:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 20:14:09,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:14:09,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 20:14:09,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:14:09,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:14:09,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:14:09,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1152737854, now seen corresponding path program 1 times [2025-02-07 20:14:09,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:14:09,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977118962] [2025-02-07 20:14:09,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:14:09,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:14:09,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 20:14:09,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 20:14:09,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:14:09,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:14:10,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:10,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:14:10,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977118962] [2025-02-07 20:14:10,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977118962] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:14:10,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774220625] [2025-02-07 20:14:10,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:14:10,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:14:10,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:14:10,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:14:10,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 20:14:10,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 20:14:10,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 20:14:10,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:14:10,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:14:10,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 20:14:10,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:14:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:10,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:14:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:10,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774220625] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:14:10,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:14:10,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-07 20:14:10,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327251838] [2025-02-07 20:14:10,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:14:10,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:14:10,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:14:10,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:14:10,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:14:10,198 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:10,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:14:10,248 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2025-02-07 20:14:10,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:14:10,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 6 [2025-02-07 20:14:10,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:14:10,249 INFO L225 Difference]: With dead ends: 18 [2025-02-07 20:14:10,249 INFO L226 Difference]: Without dead ends: 15 [2025-02-07 20:14:10,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:14:10,250 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:14:10,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 8 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:14:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-07 20:14:10,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2025-02-07 20:14:10,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) 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-02-07 20:14:10,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-02-07 20:14:10,253 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 6 [2025-02-07 20:14:10,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:14:10,254 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-02-07 20:14:10,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:10,254 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2025-02-07 20:14:10,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 20:14:10,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:14:10,254 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2025-02-07 20:14:10,262 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-02-07 20:14:10,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:14:10,455 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:14:10,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:14:10,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1475153924, now seen corresponding path program 2 times [2025-02-07 20:14:10,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:14:10,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176480719] [2025-02-07 20:14:10,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:14:10,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:14:10,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-07 20:14:10,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:14:10,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:14:10,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:14:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:10,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:14:10,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176480719] [2025-02-07 20:14:10,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176480719] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:14:10,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794663389] [2025-02-07 20:14:10,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:14:10,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:14:10,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:14:10,579 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:14:10,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 20:14:10,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-07 20:14:10,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:14:10,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:14:10,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:14:10,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 20:14:10,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:14:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:10,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:14:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:10,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794663389] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:14:10,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:14:10,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-07 20:14:10,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492345698] [2025-02-07 20:14:10,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:14:10,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 20:14:10,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:14:10,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 20:14:10,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:14:10,729 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:10,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:14:10,931 INFO L93 Difference]: Finished difference Result 39 states and 59 transitions. [2025-02-07 20:14:10,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 20:14:10,931 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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-02-07 20:14:10,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:14:10,932 INFO L225 Difference]: With dead ends: 39 [2025-02-07 20:14:10,932 INFO L226 Difference]: Without dead ends: 36 [2025-02-07 20:14:10,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:14:10,933 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:14:10,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 16 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:14:10,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-07 20:14:10,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2025-02-07 20:14:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2025-02-07 20:14:10,937 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 12 [2025-02-07 20:14:10,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:14:10,937 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2025-02-07 20:14:10,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:10,938 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2025-02-07 20:14:10,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 20:14:10,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:14:10,938 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2025-02-07 20:14:10,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 20:14:11,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:14:11,142 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:14:11,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:14:11,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1200795433, now seen corresponding path program 1 times [2025-02-07 20:14:11,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:14:11,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685759226] [2025-02-07 20:14:11,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:14:11,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:14:11,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:14:11,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:14:11,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:14:11,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:14:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-07 20:14:11,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:14:11,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685759226] [2025-02-07 20:14:11,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685759226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:14:11,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:14:11,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:14:11,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281140450] [2025-02-07 20:14:11,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:14:11,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:14:11,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:14:11,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:14:11,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:14:11,171 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:14:11,181 INFO L93 Difference]: Finished difference Result 52 states and 74 transitions. [2025-02-07 20:14:11,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:14:11,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 18 [2025-02-07 20:14:11,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:14:11,182 INFO L225 Difference]: With dead ends: 52 [2025-02-07 20:14:11,182 INFO L226 Difference]: Without dead ends: 38 [2025-02-07 20:14:11,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:14:11,183 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 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-02-07 20:14:11,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:14:11,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-07 20:14:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-07 20:14:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2025-02-07 20:14:11,190 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 18 [2025-02-07 20:14:11,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:14:11,190 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2025-02-07 20:14:11,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2025-02-07 20:14:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 20:14:11,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:14:11,190 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2025-02-07 20:14:11,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:14:11,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:14:11,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:14:11,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1895691997, now seen corresponding path program 1 times [2025-02-07 20:14:11,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:14:11,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101206806] [2025-02-07 20:14:11,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:14:11,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:14:11,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:14:11,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:14:11,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:14:11,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:14:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:11,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:14:11,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101206806] [2025-02-07 20:14:11,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101206806] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:14:11,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142007263] [2025-02-07 20:14:11,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:14:11,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:14:11,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:14:11,349 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:14:11,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 20:14:11,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:14:11,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:14:11,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:14:11,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:14:11,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-07 20:14:11,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:14:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:11,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:14:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:11,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142007263] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:14:11,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:14:11,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-07 20:14:11,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447643287] [2025-02-07 20:14:11,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:14:11,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-07 20:14:11,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:14:11,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-07 20:14:11,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2025-02-07 20:14:11,629 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 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-02-07 20:14:12,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:14:12,234 INFO L93 Difference]: Finished difference Result 116 states and 135 transitions. [2025-02-07 20:14:12,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 20:14:12,235 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 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 18 [2025-02-07 20:14:12,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:14:12,236 INFO L225 Difference]: With dead ends: 116 [2025-02-07 20:14:12,236 INFO L226 Difference]: Without dead ends: 113 [2025-02-07 20:14:12,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2025-02-07 20:14:12,237 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:14:12,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 20 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:14:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-07 20:14:12,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 56. [2025-02-07 20:14:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-02-07 20:14:12,248 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 18 [2025-02-07 20:14:12,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:14:12,249 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-02-07 20:14:12,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 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-02-07 20:14:12,249 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-02-07 20:14:12,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 20:14:12,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:14:12,249 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2025-02-07 20:14:12,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 20:14:12,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:14:12,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:14:12,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:14:12,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1668548112, now seen corresponding path program 3 times [2025-02-07 20:14:12,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:14:12,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336295849] [2025-02-07 20:14:12,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:14:12,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:14:12,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 11 equivalence classes. [2025-02-07 20:14:12,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 20:14:12,486 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-07 20:14:12,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:14:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:12,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:14:12,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336295849] [2025-02-07 20:14:12,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336295849] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:14:12,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084627496] [2025-02-07 20:14:12,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:14:12,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:14:12,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:14:12,696 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:14:12,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 20:14:12,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 11 equivalence classes. [2025-02-07 20:14:12,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 20:14:12,730 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-07 20:14:12,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:14:12,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-07 20:14:12,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:14:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:12,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:14:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:12,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084627496] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:14:12,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:14:12,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-02-07 20:14:12,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678603552] [2025-02-07 20:14:12,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:14:12,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-07 20:14:12,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:14:12,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-07 20:14:12,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-02-07 20:14:12,990 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:14:15,897 INFO L93 Difference]: Finished difference Result 198 states and 244 transitions. [2025-02-07 20:14:15,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-07 20:14:15,898 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-07 20:14:15,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:14:15,899 INFO L225 Difference]: With dead ends: 198 [2025-02-07 20:14:15,899 INFO L226 Difference]: Without dead ends: 195 [2025-02-07 20:14:15,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=440, Invalid=750, Unknown=0, NotChecked=0, Total=1190 [2025-02-07 20:14:15,900 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 20:14:15,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 28 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 20:14:15,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-07 20:14:15,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 80. [2025-02-07 20:14:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 103 transitions. [2025-02-07 20:14:15,912 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 103 transitions. Word has length 24 [2025-02-07 20:14:15,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:14:15,912 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 103 transitions. [2025-02-07 20:14:15,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 103 transitions. [2025-02-07 20:14:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-07 20:14:15,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:14:15,913 INFO L218 NwaCegarLoop]: trace histogram [15, 13, 2, 1, 1, 1, 1] [2025-02-07 20:14:15,919 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-02-07 20:14:16,113 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,SelfDestructingSolverStorable5 [2025-02-07 20:14:16,114 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:14:16,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:14:16,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1951800749, now seen corresponding path program 2 times [2025-02-07 20:14:16,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:14:16,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418648073] [2025-02-07 20:14:16,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:14:16,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:14:16,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-07 20:14:16,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 20:14:16,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:14:16,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:14:16,145 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-07 20:14:16,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:14:16,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418648073] [2025-02-07 20:14:16,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418648073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:14:16,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:14:16,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:14:16,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589087685] [2025-02-07 20:14:16,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:14:16,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:14:16,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:14:16,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:14:16,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:14:16,149 INFO L87 Difference]: Start difference. First operand 80 states and 103 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-02-07 20:14:16,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:14:16,165 INFO L93 Difference]: Finished difference Result 110 states and 133 transitions. [2025-02-07 20:14:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:14:16,166 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 34 [2025-02-07 20:14:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:14:16,167 INFO L225 Difference]: With dead ends: 110 [2025-02-07 20:14:16,167 INFO L226 Difference]: Without dead ends: 80 [2025-02-07 20:14:16,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:14:16,167 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:14:16,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:14:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-07 20:14:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-07 20:14:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 79 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2025-02-07 20:14:16,186 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 34 [2025-02-07 20:14:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:14:16,186 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2025-02-07 20:14:16,186 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-02-07 20:14:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2025-02-07 20:14:16,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-07 20:14:16,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:14:16,187 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2025-02-07 20:14:16,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 20:14:16,187 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:14:16,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:14:16,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2093059596, now seen corresponding path program 2 times [2025-02-07 20:14:16,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:14:16,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495032194] [2025-02-07 20:14:16,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:14:16,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:14:16,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-07 20:14:16,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-07 20:14:16,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:14:16,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:14:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:16,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:14:16,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495032194] [2025-02-07 20:14:16,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495032194] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:14:16,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55297418] [2025-02-07 20:14:16,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:14:16,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:14:16,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:14:16,465 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:14:16,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 20:14:16,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-07 20:14:16,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-07 20:14:16,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:14:16,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:14:16,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-07 20:14:16,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:14:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:16,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:14:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:17,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55297418] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:14:17,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:14:17,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2025-02-07 20:14:17,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747394871] [2025-02-07 20:14:17,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:14:17,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-07 20:14:17,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:14:17,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-07 20:14:17,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2025-02-07 20:14:17,044 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 37 states, 37 states have (on average 1.945945945945946) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:27,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:14:27,775 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2025-02-07 20:14:27,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-07 20:14:27,775 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.945945945945946) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 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 36 [2025-02-07 20:14:27,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:14:27,776 INFO L225 Difference]: With dead ends: 119 [2025-02-07 20:14:27,776 INFO L226 Difference]: Without dead ends: 116 [2025-02-07 20:14:27,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=986, Invalid=1770, Unknown=0, NotChecked=0, Total=2756 [2025-02-07 20:14:27,777 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 20:14:27,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 42 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 20:14:27,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-07 20:14:27,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-07 20:14:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.0260869565217392) internal successors, (118), 115 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2025-02-07 20:14:27,809 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 36 [2025-02-07 20:14:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:14:27,809 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2025-02-07 20:14:27,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.945945945945946) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:14:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2025-02-07 20:14:27,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-07 20:14:27,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:14:27,810 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2025-02-07 20:14:27,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 20:14:28,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:14:28,011 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:14:28,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:14:28,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1646713896, now seen corresponding path program 4 times [2025-02-07 20:14:28,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:14:28,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48187411] [2025-02-07 20:14:28,011 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:14:28,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:14:28,016 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 48 statements into 2 equivalence classes. [2025-02-07 20:14:28,021 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 20:14:28,021 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 20:14:28,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:14:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:28,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:14:28,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48187411] [2025-02-07 20:14:28,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48187411] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:14:28,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267535763] [2025-02-07 20:14:28,440 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:14:28,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:14:28,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:14:28,441 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:14:28,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 20:14:28,462 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 48 statements into 2 equivalence classes. [2025-02-07 20:14:28,474 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 20:14:28,475 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 20:14:28,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:14:28,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-07 20:14:28,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:14:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:28,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:14:29,303 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:14:29,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267535763] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:14:29,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:14:29,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2025-02-07 20:14:29,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437477007] [2025-02-07 20:14:29,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:14:29,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-07 20:14:29,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:14:29,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-07 20:14:29,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2025-02-07 20:14:29,305 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand has 49 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 48 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:42,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:15:42,875 INFO L93 Difference]: Finished difference Result 167 states and 192 transitions. [2025-02-07 20:15:42,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-02-07 20:15:42,875 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 48 states have internal predecessors, (96), 0 states have call successors, (0), 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 48 [2025-02-07 20:15:42,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:15:42,876 INFO L225 Difference]: With dead ends: 167 [2025-02-07 20:15:42,876 INFO L226 Difference]: Without dead ends: 164 [2025-02-07 20:15:42,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 73.6s TimeCoverageRelationStatistics Valid=1748, Invalid=3222, Unknown=0, NotChecked=0, Total=4970 [2025-02-07 20:15:42,878 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 20:15:42,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 52 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 20:15:42,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-07 20:15:42,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-02-07 20:15:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.01840490797546) internal successors, (166), 163 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2025-02-07 20:15:42,890 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 48 [2025-02-07 20:15:42,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:15:42,890 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2025-02-07 20:15:42,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 48 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2025-02-07 20:15:42,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-07 20:15:42,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:15:42,892 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2025-02-07 20:15:42,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-07 20:15:43,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-07 20:15:43,092 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:15:43,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:15:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash -901247202, now seen corresponding path program 3 times [2025-02-07 20:15:43,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:15:43,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734936616] [2025-02-07 20:15:43,093 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:15:43,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:15:43,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 35 equivalence classes. [2025-02-07 20:15:43,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 8 of 72 statements. [2025-02-07 20:15:43,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 20:15:43,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:15:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2025-02-07 20:15:43,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:15:43,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734936616] [2025-02-07 20:15:43,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734936616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:15:43,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:15:43,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:15:43,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422488706] [2025-02-07 20:15:43,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:15:43,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:15:43,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:15:43,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:15:43,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:15:43,246 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:43,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:15:43,327 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2025-02-07 20:15:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:15:43,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-07 20:15:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:15:43,327 INFO L225 Difference]: With dead ends: 164 [2025-02-07 20:15:43,327 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 20:15:43,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:15:43,329 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 2 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:15:43,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:15:43,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 20:15:43,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 20:15:43,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 20:15:43,330 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2025-02-07 20:15:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:15:43,330 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 20:15:43,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:15:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 20:15:43,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 20:15:43,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 20:15:43,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 20:15:43,335 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1] [2025-02-07 20:15:43,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 20:15:44,712 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:15:44,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:15:44 BoogieIcfgContainer [2025-02-07 20:15:44,720 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:15:44,721 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:15:44,721 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:15:44,721 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:15:44,721 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:14:09" (3/4) ... [2025-02-07 20:15:44,722 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 20:15:44,727 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-07 20:15:44,728 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 20:15:44,728 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 20:15:44,728 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 20:15:44,774 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:15:44,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:15:44,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:15:44,775 INFO L158 Benchmark]: Toolchain (without parser) took 95469.76ms. Allocated memory was 142.6MB in the beginning and 260.0MB in the end (delta: 117.4MB). Free memory was 107.4MB in the beginning and 189.9MB in the end (delta: -82.5MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2025-02-07 20:15:44,775 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:15:44,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 143.56ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 96.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:15:44,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.39ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 95.3MB in the end (delta: 981.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:15:44,776 INFO L158 Benchmark]: Boogie Preprocessor took 20.88ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.7MB in the end (delta: 527.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:15:44,776 INFO L158 Benchmark]: IcfgBuilder took 196.68ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 84.4MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:15:44,776 INFO L158 Benchmark]: TraceAbstraction took 95027.99ms. Allocated memory was 142.6MB in the beginning and 260.0MB in the end (delta: 117.4MB). Free memory was 84.4MB in the beginning and 194.0MB in the end (delta: -109.6MB). Peak memory consumption was 79.3MB. Max. memory is 16.1GB. [2025-02-07 20:15:44,777 INFO L158 Benchmark]: Witness Printer took 54.35ms. Allocated memory is still 260.0MB. Free memory was 194.0MB in the beginning and 189.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:15:44,777 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.20ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 143.56ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 96.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.39ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 95.3MB in the end (delta: 981.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.88ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.7MB in the end (delta: 527.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 196.68ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 84.4MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 95027.99ms. Allocated memory was 142.6MB in the beginning and 260.0MB in the end (delta: 117.4MB). Free memory was 84.4MB in the beginning and 194.0MB in the end (delta: -109.6MB). Peak memory consumption was 79.3MB. Max. memory is 16.1GB. * Witness Printer took 54.35ms. Allocated memory is still 260.0MB. Free memory was 194.0MB in the beginning and 189.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: 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, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 93.6s, OverallIterations: 10, TraceHistogramMax: 34, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 88.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 200 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 153 mSDsCounter, 566 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2777 IncrementalHoareTripleChecker+Invalid, 3343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 566 mSolverCounterUnsat, 47 mSDtfsCounter, 2777 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 423 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 88.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=9, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 186 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 416 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 538 ConstructedInterpolants, 0 QuantifiedInterpolants, 1900 SizeOfPredicates, 0 NumberOfNonLiveVariables, 463 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 1430/4148 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: 17]: Location Invariant Derived location invariant: ((((y % 2) != 0) && ((x < ((49 + (x / 2)) + (y % 2))) || ((y % 2) < ((x % 2) + 1)))) || (((y % 2) == 0) && ((x % 2) <= 0))) RESULT: Ultimate proved your program to be correct! [2025-02-07 20:15:44,790 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