./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/nla-digbench-scaling/bresenham-ll_unwindbound20.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 68bb6d7d6818d105c8d36601291f0fbd6a765091c35c37006c1280fceb3f620a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:01:27,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:01:27,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:01:27,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:01:27,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:01:27,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:01:27,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:01:27,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:01:27,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:01:27,586 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:01:27,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:01:27,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:01:27,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:01:27,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:01:27,587 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:01:27,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:01:27,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:01:27,587 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:01:27,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:01:27,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:01:27,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:01:27,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:01:27,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:01:27,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:01:27,587 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:01:27,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:01:27,588 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:01:27,588 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:01:27,588 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:01:27,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:01:27,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:01:27,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:01:27,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:01:27,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:01:27,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:01:27,588 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:01:27,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:01:27,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:01:27,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:01:27,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:01:27,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:01:27,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:01:27,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:01:27,588 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 -> 68bb6d7d6818d105c8d36601291f0fbd6a765091c35c37006c1280fceb3f620a [2025-02-05 15:01:27,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:01:27,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:01:27,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:01:27,789 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:01:27,789 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:01:27,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2025-02-05 15:01:28,937 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7b428269/b83ccb0b968a4cbb9ea01ea472826744/FLAG17ffda72a [2025-02-05 15:01:29,183 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:01:29,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2025-02-05 15:01:29,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7b428269/b83ccb0b968a4cbb9ea01ea472826744/FLAG17ffda72a [2025-02-05 15:01:29,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7b428269/b83ccb0b968a4cbb9ea01ea472826744 [2025-02-05 15:01:29,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:01:29,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:01:29,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:01:29,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:01:29,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:01:29,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:01:29" (1/1) ... [2025-02-05 15:01:29,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcac6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:29, skipping insertion in model container [2025-02-05 15:01:29,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:01:29" (1/1) ... [2025-02-05 15:01:29,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:01:29,650 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/nla-digbench-scaling/bresenham-ll_unwindbound20.c[597,610] [2025-02-05 15:01:29,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:01:29,671 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:01:29,678 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/nla-digbench-scaling/bresenham-ll_unwindbound20.c[597,610] [2025-02-05 15:01:29,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:01:29,702 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:01:29,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:29 WrapperNode [2025-02-05 15:01:29,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:01:29,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:01:29,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:01:29,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:01:29,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:29" (1/1) ... [2025-02-05 15:01:29,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:29" (1/1) ... [2025-02-05 15:01:29,719 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2025-02-05 15:01:29,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:01:29,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:01:29,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:01:29,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:01:29,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:29" (1/1) ... [2025-02-05 15:01:29,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:29" (1/1) ... [2025-02-05 15:01:29,730 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:29" (1/1) ... [2025-02-05 15:01:29,735 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-05 15:01:29,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:29" (1/1) ... [2025-02-05 15:01:29,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:29" (1/1) ... [2025-02-05 15:01:29,740 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:29" (1/1) ... [2025-02-05 15:01:29,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:29" (1/1) ... [2025-02-05 15:01:29,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:29" (1/1) ... [2025-02-05 15:01:29,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:29" (1/1) ... [2025-02-05 15:01:29,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:01:29,746 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:01:29,746 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:01:29,746 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:01:29,747 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:29" (1/1) ... [2025-02-05 15:01:29,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:01:29,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:29,779 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-05 15:01:29,785 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-05 15:01:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:01:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:01:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:01:29,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:01:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 15:01:29,799 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 15:01:29,838 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:01:29,839 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:01:29,945 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-02-05 15:01:29,945 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:01:29,951 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:01:29,951 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:01:29,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:01:29 BoogieIcfgContainer [2025-02-05 15:01:29,952 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:01:29,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:01:29,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:01:29,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:01:29,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:01:29" (1/3) ... [2025-02-05 15:01:29,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10dcd3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:01:29, skipping insertion in model container [2025-02-05 15:01:29,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:01:29" (2/3) ... [2025-02-05 15:01:29,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10dcd3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:01:29, skipping insertion in model container [2025-02-05 15:01:29,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:01:29" (3/3) ... [2025-02-05 15:01:29,958 INFO L128 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound20.c [2025-02-05 15:01:29,967 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:01:29,968 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bresenham-ll_unwindbound20.c that has 2 procedures, 20 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:01:29,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:01:30,003 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;@6a62bd58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:01:30,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:01:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:01:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 15:01:30,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:30,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:30,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:30,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2131387279, now seen corresponding path program 1 times [2025-02-05 15:01:30,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:30,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713373984] [2025-02-05 15:01:30,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:30,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:30,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 15:01:30,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 15:01:30,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:30,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:30,092 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-05 15:01:30,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:30,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713373984] [2025-02-05 15:01:30,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713373984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:01:30,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:01:30,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:01:30,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267706990] [2025-02-05 15:01:30,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:01:30,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:01:30,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:30,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:01:30,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:01:30,111 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:01:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:30,120 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2025-02-05 15:01:30,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:01:30,121 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 15:01:30,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:30,124 INFO L225 Difference]: With dead ends: 38 [2025-02-05 15:01:30,125 INFO L226 Difference]: Without dead ends: 16 [2025-02-05 15:01:30,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:01:30,128 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:30,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:01:30,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-05 15:01:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-05 15:01:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:01:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-02-05 15:01:30,146 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 8 [2025-02-05 15:01:30,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:30,146 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-02-05 15:01:30,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:01:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-02-05 15:01:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 15:01:30,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:30,147 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:30,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:01:30,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:30,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:30,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2144245658, now seen corresponding path program 1 times [2025-02-05 15:01:30,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:30,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341000404] [2025-02-05 15:01:30,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:30,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:30,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 15:01:30,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 15:01:30,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:30,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:01:30,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979447938] [2025-02-05 15:01:30,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:30,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:30,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:30,170 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-05 15:01:30,174 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-05 15:01:30,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 15:01:30,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 15:01:30,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:30,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:30,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:01:30,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:30,300 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-05 15:01:30,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:01:30,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:30,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341000404] [2025-02-05 15:01:30,301 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:01:30,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979447938] [2025-02-05 15:01:30,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979447938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:01:30,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:01:30,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:01:30,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148793887] [2025-02-05 15:01:30,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:01:30,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:01:30,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:30,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:01:30,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:01:30,303 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:01:30,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:30,370 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-02-05 15:01:30,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:01:30,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 15:01:30,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:30,371 INFO L225 Difference]: With dead ends: 30 [2025-02-05 15:01:30,371 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 15:01:30,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:01:30,372 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:30,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 47 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:01:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 15:01:30,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2025-02-05 15:01:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:01:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-02-05 15:01:30,376 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 8 [2025-02-05 15:01:30,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:30,377 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-02-05 15:01:30,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:01:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-02-05 15:01:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-05 15:01:30,377 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:30,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:30,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:01:30,582 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-05 15:01:30,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:30,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:30,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1996373859, now seen corresponding path program 1 times [2025-02-05 15:01:30,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:30,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311551210] [2025-02-05 15:01:30,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:30,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:30,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-05 15:01:30,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-05 15:01:30,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:30,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:30,653 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-05 15:01:30,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:30,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311551210] [2025-02-05 15:01:30,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311551210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:01:30,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:01:30,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:01:30,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849760199] [2025-02-05 15:01:30,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:01:30,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:01:30,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:30,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:01:30,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:01:30,655 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:01:30,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:30,665 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2025-02-05 15:01:30,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:01:30,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-05 15:01:30,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:30,667 INFO L225 Difference]: With dead ends: 31 [2025-02-05 15:01:30,667 INFO L226 Difference]: Without dead ends: 23 [2025-02-05 15:01:30,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:01:30,667 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 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-05 15:01:30,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:01:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-05 15:01:30,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-05 15:01:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:01:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-02-05 15:01:30,673 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 9 [2025-02-05 15:01:30,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:30,673 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-02-05 15:01:30,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:01:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-02-05 15:01:30,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 15:01:30,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:30,674 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:30,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:01:30,674 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:30,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:30,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1260892537, now seen corresponding path program 1 times [2025-02-05 15:01:30,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:30,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457249247] [2025-02-05 15:01:30,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:30,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:30,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 15:01:30,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 15:01:30,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:30,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:01:30,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [736490375] [2025-02-05 15:01:30,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:30,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:30,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:30,711 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-05 15:01:30,712 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-05 15:01:30,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 15:01:30,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 15:01:30,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:30,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:30,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:01:30,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:30,833 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:01:30,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:30,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457249247] [2025-02-05 15:01:30,833 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:01:30,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736490375] [2025-02-05 15:01:30,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736490375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:01:30,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:01:30,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:01:30,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076335935] [2025-02-05 15:01:30,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:01:30,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:01:30,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:30,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:01:30,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:01:30,834 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:01:30,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:30,887 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-02-05 15:01:30,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:01:30,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-05 15:01:30,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:30,888 INFO L225 Difference]: With dead ends: 33 [2025-02-05 15:01:30,888 INFO L226 Difference]: Without dead ends: 25 [2025-02-05 15:01:30,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:01:30,889 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:30,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:01:30,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-05 15:01:30,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-02-05 15:01:30,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:01:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-02-05 15:01:30,892 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2025-02-05 15:01:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:30,892 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-02-05 15:01:30,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:01:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-02-05 15:01:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 15:01:30,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:30,892 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:30,898 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-05 15:01:31,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:31,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:31,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:31,094 INFO L85 PathProgramCache]: Analyzing trace with hash -578761182, now seen corresponding path program 1 times [2025-02-05 15:01:31,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:31,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064533674] [2025-02-05 15:01:31,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:31,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:31,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 15:01:31,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 15:01:31,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:31,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:01:31,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [504351199] [2025-02-05 15:01:31,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:31,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:31,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:31,126 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-05 15:01:31,128 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-05 15:01:31,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 15:01:31,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 15:01:31,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:31,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:31,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 15:01:31,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:31,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:31,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:01:31,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:31,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064533674] [2025-02-05 15:01:31,444 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:01:31,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504351199] [2025-02-05 15:01:31,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504351199] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:31,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:01:31,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2025-02-05 15:01:31,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558242418] [2025-02-05 15:01:31,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:31,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:01:31,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:31,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:01:31,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:01:31,445 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:01:31,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:31,568 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2025-02-05 15:01:31,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 15:01:31,569 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-02-05 15:01:31,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:31,569 INFO L225 Difference]: With dead ends: 41 [2025-02-05 15:01:31,569 INFO L226 Difference]: Without dead ends: 37 [2025-02-05 15:01:31,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:01:31,570 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:31,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 81 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:01:31,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-05 15:01:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2025-02-05 15:01:31,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:01:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-02-05 15:01:31,575 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2025-02-05 15:01:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:31,575 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-02-05 15:01:31,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:01:31,576 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-02-05 15:01:31,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 15:01:31,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:31,576 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:31,584 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-05 15:01:31,776 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-05 15:01:31,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:31,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash -812459557, now seen corresponding path program 1 times [2025-02-05 15:01:31,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:31,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179014618] [2025-02-05 15:01:31,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:31,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:31,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:01:31,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:01:31,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:31,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:31,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:31,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179014618] [2025-02-05 15:01:31,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179014618] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:01:31,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977323500] [2025-02-05 15:01:31,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:31,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:31,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:31,866 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-05 15:01:31,867 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-05 15:01:31,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:01:31,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:01:31,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:31,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:31,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 15:01:31,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:31,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:31,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977323500] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:31,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:01:31,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-02-05 15:01:31,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344059688] [2025-02-05 15:01:31,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:31,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:01:31,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:31,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:01:31,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:01:31,944 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:01:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:31,989 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2025-02-05 15:01:31,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:01:31,990 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2025-02-05 15:01:31,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:31,991 INFO L225 Difference]: With dead ends: 68 [2025-02-05 15:01:31,991 INFO L226 Difference]: Without dead ends: 62 [2025-02-05 15:01:31,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:01:31,991 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:31,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 92 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:01:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-05 15:01:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2025-02-05 15:01:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 15:01:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-02-05 15:01:31,999 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 19 [2025-02-05 15:01:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:31,999 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-02-05 15:01:31,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:01:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-02-05 15:01:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 15:01:32,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:32,000 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:32,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:01:32,200 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-05 15:01:32,201 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:32,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:32,201 INFO L85 PathProgramCache]: Analyzing trace with hash 810324465, now seen corresponding path program 1 times [2025-02-05 15:01:32,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:32,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645463768] [2025-02-05 15:01:32,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:32,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:32,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:01:32,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:01:32,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:32,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:01:32,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293847063] [2025-02-05 15:01:32,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:32,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:32,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:32,255 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-05 15:01:32,256 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-05 15:01:32,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:01:32,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:01:32,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:32,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:32,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 15:01:32,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:01:32,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:01:32,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:32,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645463768] [2025-02-05 15:01:32,491 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:01:32,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293847063] [2025-02-05 15:01:32,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293847063] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:32,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:01:32,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2025-02-05 15:01:32,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841717111] [2025-02-05 15:01:32,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:32,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:01:32,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:32,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:01:32,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:01:32,492 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:01:32,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:32,626 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2025-02-05 15:01:32,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 15:01:32,626 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2025-02-05 15:01:32,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:32,627 INFO L225 Difference]: With dead ends: 79 [2025-02-05 15:01:32,627 INFO L226 Difference]: Without dead ends: 73 [2025-02-05 15:01:32,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:01:32,628 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:32,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 106 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:01:32,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-05 15:01:32,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2025-02-05 15:01:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 15:01:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2025-02-05 15:01:32,644 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 25 [2025-02-05 15:01:32,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:32,645 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2025-02-05 15:01:32,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:01:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2025-02-05 15:01:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 15:01:32,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:32,646 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:32,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:01:32,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:32,850 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:32,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:32,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1977091022, now seen corresponding path program 1 times [2025-02-05 15:01:32,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:32,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783363815] [2025-02-05 15:01:32,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:32,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:32,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:01:32,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:01:32,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:32,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:01:32,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619252658] [2025-02-05 15:01:32,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:32,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:32,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:32,882 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-05 15:01:32,883 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-05 15:01:32,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:01:32,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:01:32,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:32,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:32,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-05 15:01:32,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:01:33,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:01:33,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:33,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783363815] [2025-02-05 15:01:33,419 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:01:33,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619252658] [2025-02-05 15:01:33,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619252658] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:33,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:01:33,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2025-02-05 15:01:33,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783569351] [2025-02-05 15:01:33,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:33,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 15:01:33,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:33,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 15:01:33,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:01:33,420 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 15:01:33,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:33,847 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2025-02-05 15:01:33,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 15:01:33,848 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2025-02-05 15:01:33,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:33,848 INFO L225 Difference]: With dead ends: 89 [2025-02-05 15:01:33,848 INFO L226 Difference]: Without dead ends: 81 [2025-02-05 15:01:33,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2025-02-05 15:01:33,850 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:33,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 135 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:01:33,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-05 15:01:33,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2025-02-05 15:01:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 15:01:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2025-02-05 15:01:33,878 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 25 [2025-02-05 15:01:33,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:33,880 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2025-02-05 15:01:33,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 15:01:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2025-02-05 15:01:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 15:01:33,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:33,881 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:33,888 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-05 15:01:34,086 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,SelfDestructingSolverStorable7 [2025-02-05 15:01:34,086 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:34,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:34,087 INFO L85 PathProgramCache]: Analyzing trace with hash 233143778, now seen corresponding path program 1 times [2025-02-05 15:01:34,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:34,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865336915] [2025-02-05 15:01:34,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:34,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:34,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 15:01:34,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 15:01:34,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:34,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:34,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:34,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865336915] [2025-02-05 15:01:34,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865336915] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:01:34,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482137665] [2025-02-05 15:01:34,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:34,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:34,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:34,277 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:34,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:01:34,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 15:01:34,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 15:01:34,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:34,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:34,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:01:34,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:34,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:34,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482137665] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:34,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:01:34,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-02-05 15:01:34,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295735030] [2025-02-05 15:01:34,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:34,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 15:01:34,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:34,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 15:01:34,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-02-05 15:01:34,700 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 15:01:34,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:34,842 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2025-02-05 15:01:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:01:34,842 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 45 [2025-02-05 15:01:34,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:34,844 INFO L225 Difference]: With dead ends: 105 [2025-02-05 15:01:34,844 INFO L226 Difference]: Without dead ends: 99 [2025-02-05 15:01:34,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:01:34,844 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:34,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 118 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:01:34,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-05 15:01:34,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 85. [2025-02-05 15:01:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 70 states have internal predecessors, (82), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 15:01:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2025-02-05 15:01:34,864 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 45 [2025-02-05 15:01:34,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:34,865 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2025-02-05 15:01:34,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 15:01:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2025-02-05 15:01:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 15:01:34,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:34,867 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:34,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 15:01:35,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:35,068 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:35,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:35,068 INFO L85 PathProgramCache]: Analyzing trace with hash -259133278, now seen corresponding path program 2 times [2025-02-05 15:01:35,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:35,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663836166] [2025-02-05 15:01:35,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:01:35,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:35,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-05 15:01:35,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 15:01:35,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:01:35,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:35,149 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:35,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:35,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663836166] [2025-02-05 15:01:35,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663836166] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:01:35,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514420284] [2025-02-05 15:01:35,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:01:35,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:35,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:35,153 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:35,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 15:01:35,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-05 15:01:35,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 15:01:35,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:01:35,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:35,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 15:01:35,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 15:01:35,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:35,269 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:35,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514420284] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:35,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:01:35,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-02-05 15:01:35,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860082087] [2025-02-05 15:01:35,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:35,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:01:35,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:35,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:01:35,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:01:35,271 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-05 15:01:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:35,327 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2025-02-05 15:01:35,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:01:35,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2025-02-05 15:01:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:35,329 INFO L225 Difference]: With dead ends: 120 [2025-02-05 15:01:35,329 INFO L226 Difference]: Without dead ends: 96 [2025-02-05 15:01:35,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:01:35,329 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:35,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 88 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:01:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-05 15:01:35,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2025-02-05 15:01:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 77 states have internal predecessors, (90), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 15:01:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2025-02-05 15:01:35,366 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 45 [2025-02-05 15:01:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:35,367 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2025-02-05 15:01:35,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-05 15:01:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2025-02-05 15:01:35,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 15:01:35,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:35,369 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:35,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 15:01:35,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:35,570 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:35,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1958624675, now seen corresponding path program 3 times [2025-02-05 15:01:35,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:35,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045871268] [2025-02-05 15:01:35,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:01:35,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:35,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 4 equivalence classes. [2025-02-05 15:01:35,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 15:01:35,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 15:01:35,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:35,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:35,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045871268] [2025-02-05 15:01:35,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045871268] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:01:35,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957672670] [2025-02-05 15:01:35,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:01:35,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:35,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:35,828 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:35,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 15:01:35,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 4 equivalence classes. [2025-02-05 15:01:35,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 45 statements. [2025-02-05 15:01:35,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:01:35,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:35,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-05 15:01:35,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:36,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:36,560 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 15:01:36,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957672670] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:36,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:01:36,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 29 [2025-02-05 15:01:36,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575450398] [2025-02-05 15:01:36,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:36,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 15:01:36,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:36,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 15:01:36,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2025-02-05 15:01:36,562 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 29 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-05 15:01:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:38,456 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2025-02-05 15:01:38,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-05 15:01:38,456 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 45 [2025-02-05 15:01:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:38,457 INFO L225 Difference]: With dead ends: 111 [2025-02-05 15:01:38,459 INFO L226 Difference]: Without dead ends: 101 [2025-02-05 15:01:38,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=367, Invalid=2083, Unknown=0, NotChecked=0, Total=2450 [2025-02-05 15:01:38,461 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 31 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:38,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 326 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 15:01:38,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-05 15:01:38,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 74. [2025-02-05 15:01:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 60 states have internal predecessors, (67), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 15:01:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2025-02-05 15:01:38,495 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 45 [2025-02-05 15:01:38,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:38,495 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2025-02-05 15:01:38,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-05 15:01:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2025-02-05 15:01:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 15:01:38,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:38,496 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:38,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 15:01:38,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:38,696 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:38,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:38,697 INFO L85 PathProgramCache]: Analyzing trace with hash 50488643, now seen corresponding path program 2 times [2025-02-05 15:01:38,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:38,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370275004] [2025-02-05 15:01:38,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:01:38,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:38,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-05 15:01:38,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 15:01:38,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:01:38,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:38,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:38,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370275004] [2025-02-05 15:01:38,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370275004] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:01:38,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060329917] [2025-02-05 15:01:38,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:01:38,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:38,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:38,838 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:38,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 15:01:38,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-05 15:01:38,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 15:01:38,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:01:38,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:38,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:01:38,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:38,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:01:38,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060329917] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:38,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:01:38,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 17 [2025-02-05 15:01:38,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790401584] [2025-02-05 15:01:38,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:39,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 15:01:39,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:39,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 15:01:39,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:01:39,001 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-05 15:01:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:39,127 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2025-02-05 15:01:39,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 15:01:39,128 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 49 [2025-02-05 15:01:39,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:39,129 INFO L225 Difference]: With dead ends: 140 [2025-02-05 15:01:39,129 INFO L226 Difference]: Without dead ends: 134 [2025-02-05 15:01:39,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=215, Invalid=385, Unknown=0, NotChecked=0, Total=600 [2025-02-05 15:01:39,130 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:39,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 148 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:01:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-05 15:01:39,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-02-05 15:01:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 108 states have (on average 1.1203703703703705) internal successors, (121), 108 states have internal predecessors, (121), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-05 15:01:39,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2025-02-05 15:01:39,152 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 49 [2025-02-05 15:01:39,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:39,152 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2025-02-05 15:01:39,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-05 15:01:39,152 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2025-02-05 15:01:39,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:01:39,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:39,154 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:39,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 15:01:39,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 15:01:39,358 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:39,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:39,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1772336621, now seen corresponding path program 3 times [2025-02-05 15:01:39,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:39,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116203987] [2025-02-05 15:01:39,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:01:39,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:39,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 11 equivalence classes. [2025-02-05 15:01:39,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:01:39,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-05 15:01:39,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:40,009 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 15:01:40,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:40,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116203987] [2025-02-05 15:01:40,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116203987] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:01:40,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565564204] [2025-02-05 15:01:40,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:01:40,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:40,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:40,012 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:40,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 15:01:40,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 11 equivalence classes. [2025-02-05 15:01:40,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 109 statements. [2025-02-05 15:01:40,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:01:40,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:40,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 15:01:40,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:40,448 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 102 proven. 1 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2025-02-05 15:01:40,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 46 proven. 57 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2025-02-05 15:01:44,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565564204] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:44,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:01:44,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 41 [2025-02-05 15:01:44,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744512569] [2025-02-05 15:01:44,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:44,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-05 15:01:44,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:44,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-05 15:01:44,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1499, Unknown=0, NotChecked=0, Total=1640 [2025-02-05 15:01:44,436 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand has 41 states, 37 states have (on average 2.4054054054054053) internal successors, (89), 38 states have internal predecessors, (89), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-05 15:01:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:49,031 INFO L93 Difference]: Finished difference Result 260 states and 287 transitions. [2025-02-05 15:01:49,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2025-02-05 15:01:49,032 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 2.4054054054054053) internal successors, (89), 38 states have internal predecessors, (89), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 109 [2025-02-05 15:01:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:49,034 INFO L225 Difference]: With dead ends: 260 [2025-02-05 15:01:49,034 INFO L226 Difference]: Without dead ends: 250 [2025-02-05 15:01:49,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 205 SyntacticMatches, 3 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8656 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=3294, Invalid=22788, Unknown=0, NotChecked=0, Total=26082 [2025-02-05 15:01:49,039 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 531 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:49,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 159 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:01:49,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-05 15:01:49,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2025-02-05 15:01:49,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 191 states have (on average 1.1204188481675392) internal successors, (214), 191 states have internal predecessors, (214), 25 states have call successors, (25), 22 states have call predecessors, (25), 21 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 15:01:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 263 transitions. [2025-02-05 15:01:49,073 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 263 transitions. Word has length 109 [2025-02-05 15:01:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:49,073 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 263 transitions. [2025-02-05 15:01:49,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 2.4054054054054053) internal successors, (89), 38 states have internal predecessors, (89), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-05 15:01:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 263 transitions. [2025-02-05 15:01:49,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:01:49,075 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:49,076 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:49,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 15:01:49,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 15:01:49,276 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:49,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:49,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1309952116, now seen corresponding path program 1 times [2025-02-05 15:01:49,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:49,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844697724] [2025-02-05 15:01:49,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:49,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:49,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:01:49,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:01:49,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:49,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 352 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-05 15:01:49,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:01:49,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844697724] [2025-02-05 15:01:49,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844697724] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:01:49,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220301745] [2025-02-05 15:01:49,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:01:49,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:49,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:49,600 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:49,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 15:01:49,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:01:49,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:01:49,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:49,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:01:49,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 15:01:49,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:01:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:01:49,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:01:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 352 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-05 15:01:50,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220301745] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:01:50,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:01:50,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 26 [2025-02-05 15:01:50,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534086573] [2025-02-05 15:01:50,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:01:50,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 15:01:50,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:01:50,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 15:01:50,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2025-02-05 15:01:50,014 INFO L87 Difference]: Start difference. First operand 238 states and 263 transitions. Second operand has 26 states, 26 states have (on average 5.6923076923076925) internal successors, (148), 26 states have internal predecessors, (148), 20 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (30), 19 states have call predecessors, (30), 19 states have call successors, (30) [2025-02-05 15:01:50,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:01:50,374 INFO L93 Difference]: Finished difference Result 427 states and 478 transitions. [2025-02-05 15:01:50,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-02-05 15:01:50,375 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.6923076923076925) internal successors, (148), 26 states have internal predecessors, (148), 20 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (30), 19 states have call predecessors, (30), 19 states have call successors, (30) Word has length 119 [2025-02-05 15:01:50,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:01:50,377 INFO L225 Difference]: With dead ends: 427 [2025-02-05 15:01:50,377 INFO L226 Difference]: Without dead ends: 421 [2025-02-05 15:01:50,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 224 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=688, Invalid=1204, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 15:01:50,378 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 86 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:01:50,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 225 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:01:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-02-05 15:01:50,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 418. [2025-02-05 15:01:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 335 states have (on average 1.1223880597014926) internal successors, (376), 335 states have internal predecessors, (376), 43 states have call successors, (43), 40 states have call predecessors, (43), 39 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 15:01:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 461 transitions. [2025-02-05 15:01:50,437 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 461 transitions. Word has length 119 [2025-02-05 15:01:50,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:01:50,438 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 461 transitions. [2025-02-05 15:01:50,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.6923076923076925) internal successors, (148), 26 states have internal predecessors, (148), 20 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (30), 19 states have call predecessors, (30), 19 states have call successors, (30) [2025-02-05 15:01:50,438 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 461 transitions. [2025-02-05 15:01:50,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-05 15:01:50,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:01:50,439 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:50,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-05 15:01:50,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:50,640 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:01:50,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:01:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash 733326276, now seen corresponding path program 2 times [2025-02-05 15:01:50,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:01:50,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416764850] [2025-02-05 15:01:50,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:01:50,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:01:50,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 209 statements into 2 equivalence classes. [2025-02-05 15:01:50,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 15:01:50,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:01:50,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:01:50,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [232732767] [2025-02-05 15:01:50,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:01:50,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:50,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:01:50,706 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:01:50,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 15:01:50,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 209 statements into 2 equivalence classes. [2025-02-05 15:01:50,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 15:01:50,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:01:50,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:01:50,822 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:01:50,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-05 15:01:50,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 15:01:50,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:01:50,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:01:50,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:01:50,924 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:01:50,924 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:01:50,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-05 15:01:51,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:01:51,129 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:01:51,183 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:01:51,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:01:51 BoogieIcfgContainer [2025-02-05 15:01:51,185 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:01:51,185 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:01:51,185 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:01:51,186 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:01:51,186 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:01:29" (3/4) ... [2025-02-05 15:01:51,187 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:01:51,245 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 145. [2025-02-05 15:01:51,309 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:01:51,309 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:01:51,309 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:01:51,310 INFO L158 Benchmark]: Toolchain (without parser) took 21774.86ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 134.3MB in the beginning and 216.8MB in the end (delta: -82.5MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2025-02-05 15:01:51,310 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:01:51,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.11ms. Allocated memory is still 167.8MB. Free memory was 134.3MB in the beginning and 122.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:01:51,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.19ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 121.9MB in the end (delta: 933.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:01:51,311 INFO L158 Benchmark]: Boogie Preprocessor took 25.33ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 120.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:01:51,311 INFO L158 Benchmark]: IcfgBuilder took 206.05ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 108.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:01:51,311 INFO L158 Benchmark]: TraceAbstraction took 21231.74ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 108.4MB in the beginning and 233.6MB in the end (delta: -125.1MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2025-02-05 15:01:51,311 INFO L158 Benchmark]: Witness Printer took 124.09ms. Allocated memory is still 293.6MB. Free memory was 233.6MB in the beginning and 216.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:01:51,312 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.17ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.11ms. Allocated memory is still 167.8MB. Free memory was 134.3MB in the beginning and 122.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.19ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 121.9MB in the end (delta: 933.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.33ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 120.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 206.05ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 108.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 21231.74ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 108.4MB in the beginning and 233.6MB in the end (delta: -125.1MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Witness Printer took 124.09ms. Allocated memory is still 293.6MB. Free memory was 233.6MB in the beginning and 216.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [X=39, Y=1, counter=0, v=-37, x=0, y=0] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=1, v=-37, x=0, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=1, v=-37, x=0, xy=0, y=0, yx=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=1, v=-37, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=1, v=-37, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=1, v=-35, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=39, Y=1, counter=1, v=-35, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=2, v=-35, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=2, v=-35, x=1, xy=0, y=0, yx=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=2, v=-35, x=1, xy=0, y=0, yx=1] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=2, v=-35, x=1, xy=0, y=0, yx=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=2, v=-33, x=1, xy=0, y=0, yx=1] [L45] x++ VAL [X=39, Y=1, counter=2, v=-33, x=2, xy=0, y=0, yx=1] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=3, v=-33, x=2, xy=0, y=0, yx=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=3, v=-33, x=2, xy=0, y=0, yx=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=3, v=-33, x=2, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=3, v=-33, x=2, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=3, v=-31, x=2, xy=0, y=0, yx=2] [L45] x++ VAL [X=39, Y=1, counter=3, v=-31, x=3, xy=0, y=0, yx=2] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=4, v=-31, x=3, xy=0, y=0, yx=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=4, v=-31, x=3, xy=0, y=0, yx=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=4, v=-31, x=3, xy=0, y=0, yx=3] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=4, v=-31, x=3, xy=0, y=0, yx=3] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=4, v=-29, x=3, xy=0, y=0, yx=3] [L45] x++ VAL [X=39, Y=1, counter=4, v=-29, x=4, xy=0, y=0, yx=3] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=5, v=-29, x=4, xy=0, y=0, yx=3] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=5, v=-29, x=4, xy=0, y=0, yx=4] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=5, v=-29, x=4, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=5, v=-29, x=4, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=5, v=-27, x=4, xy=0, y=0, yx=4] [L45] x++ VAL [X=39, Y=1, counter=5, v=-27, x=5, xy=0, y=0, yx=4] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=6, v=-27, x=5, xy=0, y=0, yx=4] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=6, v=-27, x=5, xy=0, y=0, yx=5] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=6, v=-27, x=5, xy=0, y=0, yx=5] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=6, v=-27, x=5, xy=0, y=0, yx=5] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=6, v=-25, x=5, xy=0, y=0, yx=5] [L45] x++ VAL [X=39, Y=1, counter=6, v=-25, x=6, xy=0, y=0, yx=5] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=7, v=-25, x=6, xy=0, y=0, yx=5] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=7, v=-25, x=6, xy=0, y=0, yx=6] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=7, v=-25, x=6, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=7, v=-25, x=6, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=7, v=-23, x=6, xy=0, y=0, yx=6] [L45] x++ VAL [X=39, Y=1, counter=7, v=-23, x=7, xy=0, y=0, yx=6] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=8, v=-23, x=7, xy=0, y=0, yx=6] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=8, v=-23, x=7, xy=0, y=0, yx=7] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=8, v=-23, x=7, xy=0, y=0, yx=7] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=8, v=-23, x=7, xy=0, y=0, yx=7] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=8, v=-21, x=7, xy=0, y=0, yx=7] [L45] x++ VAL [X=39, Y=1, counter=8, v=-21, x=8, xy=0, y=0, yx=7] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=9, v=-21, x=8, xy=0, y=0, yx=7] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=9, v=-21, x=8, xy=0, y=0, yx=8] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=9, v=-21, x=8, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=9, v=-21, x=8, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=9, v=-19, x=8, xy=0, y=0, yx=8] [L45] x++ VAL [X=39, Y=1, counter=9, v=-19, x=9, xy=0, y=0, yx=8] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=10, v=-19, x=9, xy=0, y=0, yx=8] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=10, v=-19, x=9, xy=0, y=0, yx=9] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=10, v=-19, x=9, xy=0, y=0, yx=9] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=10, v=-19, x=9, xy=0, y=0, yx=9] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=10, v=-17, x=9, xy=0, y=0, yx=9] [L45] x++ VAL [X=39, Y=1, counter=10, v=-17, x=10, xy=0, y=0, yx=9] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=11, v=-17, x=10, xy=0, y=0, yx=9] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=11, v=-17, x=10, xy=0, y=0, yx=10] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=11, v=-17, x=10, xy=0, y=0, yx=10] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=11, v=-17, x=10, xy=0, y=0, yx=10] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=11, v=-15, x=10, xy=0, y=0, yx=10] [L45] x++ VAL [X=39, Y=1, counter=11, v=-15, x=11, xy=0, y=0, yx=10] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=12, v=-15, x=11, xy=0, y=0, yx=10] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=12, v=-15, x=11, xy=0, y=0, yx=11] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=12, v=-15, x=11, xy=0, y=0, yx=11] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=12, v=-15, x=11, xy=0, y=0, yx=11] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=12, v=-13, x=11, xy=0, y=0, yx=11] [L45] x++ VAL [X=39, Y=1, counter=12, v=-13, x=12, xy=0, y=0, yx=11] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=13, v=-13, x=12, xy=0, y=0, yx=11] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=13, v=-13, x=12, xy=0, y=0, yx=12] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=13, v=-13, x=12, xy=0, y=0, yx=12] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=13, v=-13, x=12, xy=0, y=0, yx=12] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=13, v=-11, x=12, xy=0, y=0, yx=12] [L45] x++ VAL [X=39, Y=1, counter=13, v=-11, x=13, xy=0, y=0, yx=12] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=14, v=-11, x=13, xy=0, y=0, yx=12] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=14, v=-11, x=13, xy=0, y=0, yx=13] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=14, v=-11, x=13, xy=0, y=0, yx=13] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=14, v=-11, x=13, xy=0, y=0, yx=13] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=14, v=-9, x=13, xy=0, y=0, yx=13] [L45] x++ VAL [X=39, Y=1, counter=14, v=-9, x=14, xy=0, y=0, yx=13] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=15, v=-9, x=14, xy=0, y=0, yx=13] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=15, v=-9, x=14, xy=0, y=0, yx=14] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=15, v=-9, x=14, xy=0, y=0, yx=14] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=15, v=-9, x=14, xy=0, y=0, yx=14] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=15, v=-7, x=14, xy=0, y=0, yx=14] [L45] x++ VAL [X=39, Y=1, counter=15, v=-7, x=15, xy=0, y=0, yx=14] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=16, v=-7, x=15, xy=0, y=0, yx=14] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=16, v=-7, x=15, xy=0, y=0, yx=15] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=16, v=-7, x=15, xy=0, y=0, yx=15] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=16, v=-7, x=15, xy=0, y=0, yx=15] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=16, v=-5, x=15, xy=0, y=0, yx=15] [L45] x++ VAL [X=39, Y=1, counter=16, v=-5, x=16, xy=0, y=0, yx=15] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=17, v=-5, x=16, xy=0, y=0, yx=15] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=17, v=-5, x=16, xy=0, y=0, yx=16] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=17, v=-5, x=16, xy=0, y=0, yx=16] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=17, v=-5, x=16, xy=0, y=0, yx=16] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=17, v=-3, x=16, xy=0, y=0, yx=16] [L45] x++ VAL [X=39, Y=1, counter=17, v=-3, x=17, xy=0, y=0, yx=16] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=18, v=-3, x=17, xy=0, y=0, yx=16] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=18, v=-3, x=17, xy=0, y=0, yx=17] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=18, v=-3, x=17, xy=0, y=0, yx=17] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=18, v=-3, x=17, xy=0, y=0, yx=17] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=18, v=-1, x=17, xy=0, y=0, yx=17] [L45] x++ VAL [X=39, Y=1, counter=18, v=-1, x=18, xy=0, y=0, yx=17] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=19, v=-1, x=18, xy=0, y=0, yx=17] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=19, v=-1, x=18, xy=0, y=0, yx=18] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=19, v=-1, x=18, xy=0, y=0, yx=18] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=19, v=-1, x=18, xy=0, y=0, yx=18] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=39, Y=1, counter=19, v=1, x=18, xy=0, y=0, yx=18] [L45] x++ VAL [X=39, Y=1, counter=19, v=1, x=19, xy=0, y=0, yx=18] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=20, v=1, x=19, xy=0, y=0, yx=18] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=39, Y=1, counter=20, v=1, x=19, xy=0, y=0, yx=19] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=39, Y=1, counter=20, v=1, x=19, xy=0, y=0, yx=19] [L35] COND FALSE !(!(x <= X)) VAL [X=39, Y=1, counter=20, v=1, x=19, xy=0, y=0, yx=19] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=39, Y=1, counter=20, v=-75, x=19, xy=0, y=1, yx=19] [L45] x++ VAL [X=39, Y=1, counter=20, v=-75, x=20, xy=0, y=1, yx=19] [L31] COND TRUE counter++<20 [L31] EXPR counter++ VAL [X=39, Y=1, counter=21, v=-75, x=20, xy=0, y=1, yx=19] [L31] COND FALSE !(counter++<20) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=39, Y=1, counter=21, v=-75, xy=20, y=1, yx=20] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=21] [L14] COND TRUE !(cond) VAL [\old(cond)=0, counter=21] [L16] reach_error() VAL [\old(cond)=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.1s, OverallIterations: 15, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 801 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 798 mSDsluCounter, 1642 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1429 mSDsCounter, 306 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2118 IncrementalHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 306 mSolverCounterUnsat, 213 mSDtfsCounter, 2118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1286 GetRequests, 890 SyntacticMatches, 17 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9847 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=418occurred in iteration=14, InterpolantAutomatonStates: 323, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 91 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 1479 NumberOfCodeBlocks, 1369 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1438 ConstructedInterpolants, 6 QuantifiedInterpolants, 5770 SizeOfPredicates, 50 NumberOfNonLiveVariables, 1352 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 31 InterpolantComputations, 4 PerfectInterpolantSequences, 2139/4110 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 RESULT: Ultimate proved your program to be incorrect! [2025-02-05 15:01:51,360 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE