./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-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 820aaba80b9c7e4ca2ad4a6a908bac2e6f59545dc6a131cb9fae6306b993a9eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:10:31,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:10:32,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:10:32,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:10:32,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:10:32,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:10:32,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:10:32,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:10:32,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:10:32,052 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:10:32,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:10:32,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:10:32,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:10:32,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:10:32,052 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:10:32,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:10:32,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:10:32,053 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:10:32,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:10:32,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:10:32,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:10:32,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:10:32,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:10:32,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:10:32,054 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:10:32,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:10:32,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:10:32,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:10:32,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:10:32,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:10:32,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:10:32,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:10:32,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:10:32,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:10:32,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:10:32,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:10:32,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:10:32,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:10:32,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:10:32,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:10:32,056 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:10:32,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:10:32,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:10:32,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:10:32,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:10:32,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:10:32,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:10:32,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:10:32,056 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 -> 820aaba80b9c7e4ca2ad4a6a908bac2e6f59545dc6a131cb9fae6306b993a9eb [2025-01-09 03:10:32,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:10:32,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:10:32,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:10:32,282 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:10:32,283 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:10:32,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2025-01-09 03:10:33,396 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7df96a46d/95945733e7794d6180832bdf7d14ba55/FLAGb8fbf2812 [2025-01-09 03:10:33,621 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:10:33,621 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2025-01-09 03:10:33,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7df96a46d/95945733e7794d6180832bdf7d14ba55/FLAGb8fbf2812 [2025-01-09 03:10:33,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7df96a46d/95945733e7794d6180832bdf7d14ba55 [2025-01-09 03:10:33,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:10:33,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:10:33,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:10:33,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:10:33,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:10:33,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:10:33" (1/1) ... [2025-01-09 03:10:33,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d4d0871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:33, skipping insertion in model container [2025-01-09 03:10:33,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:10:33" (1/1) ... [2025-01-09 03:10:33,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:10:34,078 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/cohencu-ll_unwindbound20.c[588,601] [2025-01-09 03:10:34,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:10:34,104 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:10:34,113 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/cohencu-ll_unwindbound20.c[588,601] [2025-01-09 03:10:34,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:10:34,133 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:10:34,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:34 WrapperNode [2025-01-09 03:10:34,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:10:34,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:10:34,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:10:34,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:10:34,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:34" (1/1) ... [2025-01-09 03:10:34,150 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:34" (1/1) ... [2025-01-09 03:10:34,160 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2025-01-09 03:10:34,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:10:34,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:10:34,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:10:34,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:10:34,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:34" (1/1) ... [2025-01-09 03:10:34,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:34" (1/1) ... [2025-01-09 03:10:34,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:34" (1/1) ... [2025-01-09 03:10:34,174 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 03:10:34,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:34" (1/1) ... [2025-01-09 03:10:34,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:34" (1/1) ... [2025-01-09 03:10:34,177 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:34" (1/1) ... [2025-01-09 03:10:34,177 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:34" (1/1) ... [2025-01-09 03:10:34,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:34" (1/1) ... [2025-01-09 03:10:34,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:34" (1/1) ... [2025-01-09 03:10:34,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:34" (1/1) ... [2025-01-09 03:10:34,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:10:34,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:10:34,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:10:34,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:10:34,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:34" (1/1) ... [2025-01-09 03:10:34,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:10:34,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:34,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:10:34,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:10:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:10:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:10:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:10:34,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:10:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 03:10:34,226 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 03:10:34,261 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:10:34,262 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:10:34,355 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-01-09 03:10:34,356 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:10:34,362 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:10:34,362 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:10:34,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:34 BoogieIcfgContainer [2025-01-09 03:10:34,362 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:10:34,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:10:34,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:10:34,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:10:34,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:10:33" (1/3) ... [2025-01-09 03:10:34,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588201f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:10:34, skipping insertion in model container [2025-01-09 03:10:34,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:34" (2/3) ... [2025-01-09 03:10:34,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588201f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:10:34, skipping insertion in model container [2025-01-09 03:10:34,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:34" (3/3) ... [2025-01-09 03:10:34,368 INFO L128 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound20.c [2025-01-09 03:10:34,377 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:10:34,378 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohencu-ll_unwindbound20.c that has 2 procedures, 26 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:10:34,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:10:34,418 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;@7383dc97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:10:34,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:10:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 03:10:34,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 03:10:34,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:34,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:34,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:34,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:34,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1823967074, now seen corresponding path program 1 times [2025-01-09 03:10:34,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:34,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77871029] [2025-01-09 03:10:34,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:34,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:34,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 03:10:34,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 03:10:34,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:34,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:10:34,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:34,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77871029] [2025-01-09 03:10:34,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77871029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:10:34,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:10:34,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 03:10:34,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495951199] [2025-01-09 03:10:34,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:10:34,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:10:34,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:34,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:10:34,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:10:34,534 INFO L87 Difference]: Start difference. First operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-01-09 03:10:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:34,547 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2025-01-09 03:10:34,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:10:34,548 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2025-01-09 03:10:34,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:34,552 INFO L225 Difference]: With dead ends: 50 [2025-01-09 03:10:34,552 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 03:10:34,554 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-01-09 03:10:34,556 INFO L435 NwaCegarLoop]: 37 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, 37 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-01-09 03:10:34,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:10:34,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 03:10:34,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-09 03:10:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 03:10:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2025-01-09 03:10:34,577 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 7 [2025-01-09 03:10:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:34,578 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2025-01-09 03:10:34,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-01-09 03:10:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2025-01-09 03:10:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 03:10:34,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:34,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:34,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:10:34,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:34,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:34,581 INFO L85 PathProgramCache]: Analyzing trace with hash 149075517, now seen corresponding path program 1 times [2025-01-09 03:10:34,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:34,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393378855] [2025-01-09 03:10:34,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:34,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:34,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 03:10:34,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 03:10:34,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:34,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:10:34,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:34,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393378855] [2025-01-09 03:10:34,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393378855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:10:34,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:10:34,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:10:34,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578972638] [2025-01-09 03:10:34,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:10:34,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:10:34,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:34,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:10:34,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:10:34,758 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-01-09 03:10:34,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:34,826 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2025-01-09 03:10:34,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:10:34,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-01-09 03:10:34,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:34,828 INFO L225 Difference]: With dead ends: 28 [2025-01-09 03:10:34,828 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 03:10:34,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:10:34,829 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:34,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 85 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:10:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 03:10:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-09 03:10:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 03:10:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2025-01-09 03:10:34,842 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 8 [2025-01-09 03:10:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:34,842 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2025-01-09 03:10:34,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-01-09 03:10:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2025-01-09 03:10:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 03:10:34,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:34,843 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:34,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:10:34,844 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:34,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:34,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1111049640, now seen corresponding path program 1 times [2025-01-09 03:10:34,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:34,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001268190] [2025-01-09 03:10:34,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:34,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:34,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 03:10:34,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 03:10:34,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:34,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:34,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1587039093] [2025-01-09 03:10:34,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:34,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:34,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:34,865 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:34,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:10:34,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 03:10:34,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 03:10:34,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:34,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:34,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 03:10:34,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:10:34,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:10:34,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001268190] [2025-01-09 03:10:34,979 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:34,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587039093] [2025-01-09 03:10:34,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587039093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:10:34,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:10:34,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:10:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56715812] [2025-01-09 03:10:34,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:10:34,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:10:34,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:34,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:10:34,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:10:34,980 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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-01-09 03:10:35,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:35,040 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2025-01-09 03:10:35,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:10:35,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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 13 [2025-01-09 03:10:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:35,042 INFO L225 Difference]: With dead ends: 46 [2025-01-09 03:10:35,042 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 03:10:35,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:10:35,042 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:35,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 108 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:10:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 03:10:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2025-01-09 03:10:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 03:10:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2025-01-09 03:10:35,053 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 13 [2025-01-09 03:10:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:35,054 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2025-01-09 03:10:35,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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-01-09 03:10:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2025-01-09 03:10:35,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 03:10:35,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:35,054 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:35,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:10:35,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:35,256 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:35,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:35,257 INFO L85 PathProgramCache]: Analyzing trace with hash -167119696, now seen corresponding path program 1 times [2025-01-09 03:10:35,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:35,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845774053] [2025-01-09 03:10:35,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:35,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:35,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 03:10:35,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 03:10:35,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:35,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:10:35,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:35,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845774053] [2025-01-09 03:10:35,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845774053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:10:35,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:10:35,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:10:35,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870958203] [2025-01-09 03:10:35,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:10:35,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:10:35,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:35,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:10:35,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:10:35,291 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 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-01-09 03:10:35,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:35,305 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2025-01-09 03:10:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:10:35,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 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 13 [2025-01-09 03:10:35,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:35,307 INFO L225 Difference]: With dead ends: 50 [2025-01-09 03:10:35,307 INFO L226 Difference]: Without dead ends: 34 [2025-01-09 03:10:35,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-01-09 03:10:35,308 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:35,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:10:35,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-09 03:10:35,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-01-09 03:10:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 03:10:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-01-09 03:10:35,315 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 13 [2025-01-09 03:10:35,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:35,315 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-01-09 03:10:35,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 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-01-09 03:10:35,315 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-01-09 03:10:35,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 03:10:35,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:35,315 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:35,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:10:35,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:35,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:35,316 INFO L85 PathProgramCache]: Analyzing trace with hash 710392029, now seen corresponding path program 1 times [2025-01-09 03:10:35,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:35,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588616911] [2025-01-09 03:10:35,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:35,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:35,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 03:10:35,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 03:10:35,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:35,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:35,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1622403155] [2025-01-09 03:10:35,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:35,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:35,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:35,338 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:35,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:10:35,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 03:10:35,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 03:10:35,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:35,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:35,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 03:10:35,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:10:35,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:10:35,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:35,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588616911] [2025-01-09 03:10:35,410 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:35,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622403155] [2025-01-09 03:10:35,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622403155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:10:35,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:10:35,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:10:35,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476802767] [2025-01-09 03:10:35,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:10:35,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:10:35,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:35,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:10:35,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:10:35,411 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 03:10:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:35,459 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2025-01-09 03:10:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:10:35,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-01-09 03:10:35,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:35,460 INFO L225 Difference]: With dead ends: 50 [2025-01-09 03:10:35,460 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 03:10:35,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:10:35,461 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:35,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 123 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:10:35,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 03:10:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-01-09 03:10:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 03:10:35,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2025-01-09 03:10:35,470 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 18 [2025-01-09 03:10:35,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:35,470 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2025-01-09 03:10:35,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 03:10:35,473 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2025-01-09 03:10:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 03:10:35,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:35,473 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:35,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:10:35,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:35,674 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:35,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:35,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1020728968, now seen corresponding path program 1 times [2025-01-09 03:10:35,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:35,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913125381] [2025-01-09 03:10:35,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:35,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:35,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 03:10:35,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 03:10:35,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:35,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:35,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316716559] [2025-01-09 03:10:35,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:35,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:35,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:35,686 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:35,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:10:35,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 03:10:35,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 03:10:35,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:35,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:35,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 03:10:35,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:10:35,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:10:35,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:35,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913125381] [2025-01-09 03:10:35,814 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:35,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316716559] [2025-01-09 03:10:35,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316716559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:10:35,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:10:35,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:10:35,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870309028] [2025-01-09 03:10:35,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:10:35,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:10:35,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:35,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:10:35,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:10:35,816 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 03:10:35,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:35,886 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2025-01-09 03:10:35,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:10:35,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-01-09 03:10:35,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:35,887 INFO L225 Difference]: With dead ends: 58 [2025-01-09 03:10:35,887 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 03:10:35,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:10:35,888 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:35,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 127 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:10:35,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 03:10:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-09 03:10:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 03:10:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2025-01-09 03:10:35,902 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 23 [2025-01-09 03:10:35,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:35,902 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-01-09 03:10:35,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 03:10:35,902 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2025-01-09 03:10:35,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 03:10:35,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:35,903 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:35,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:10:36,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:36,104 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:36,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:36,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2025621168, now seen corresponding path program 1 times [2025-01-09 03:10:36,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:36,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540061383] [2025-01-09 03:10:36,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:36,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:36,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 03:10:36,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 03:10:36,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:36,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:36,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1133393298] [2025-01-09 03:10:36,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:36,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:36,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:36,124 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:36,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:10:36,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 03:10:36,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 03:10:36,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:36,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:36,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 03:10:36,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 03:10:36,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 03:10:36,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:36,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540061383] [2025-01-09 03:10:36,437 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:36,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133393298] [2025-01-09 03:10:36,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133393298] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:36,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:10:36,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-01-09 03:10:36,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603596207] [2025-01-09 03:10:36,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:36,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 03:10:36,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:36,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 03:10:36,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:10:36,438 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 03:10:36,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:36,669 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2025-01-09 03:10:36,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:10:36,670 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 41 [2025-01-09 03:10:36,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:36,671 INFO L225 Difference]: With dead ends: 70 [2025-01-09 03:10:36,671 INFO L226 Difference]: Without dead ends: 68 [2025-01-09 03:10:36,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-01-09 03:10:36,672 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:36,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 164 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:10:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-09 03:10:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2025-01-09 03:10:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 03:10:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-01-09 03:10:36,689 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 41 [2025-01-09 03:10:36,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:36,689 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-01-09 03:10:36,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 03:10:36,690 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-01-09 03:10:36,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 03:10:36,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:36,691 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:36,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:10:36,891 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,SelfDestructingSolverStorable6 [2025-01-09 03:10:36,891 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:36,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:36,892 INFO L85 PathProgramCache]: Analyzing trace with hash 747451832, now seen corresponding path program 1 times [2025-01-09 03:10:36,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:36,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670299844] [2025-01-09 03:10:36,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:36,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:36,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 03:10:36,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 03:10:36,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:36,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 03:10:36,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:36,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670299844] [2025-01-09 03:10:36,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670299844] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:10:36,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295751758] [2025-01-09 03:10:36,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:36,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:36,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:36,982 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:36,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:10:37,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 03:10:37,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 03:10:37,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:37,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:37,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 03:10:37,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 03:10:37,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 03:10:37,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295751758] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:37,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:10:37,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2025-01-09 03:10:37,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273958570] [2025-01-09 03:10:37,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:37,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:10:37,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:37,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:10:37,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:10:37,148 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:10:37,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:37,307 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2025-01-09 03:10:37,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:10:37,308 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 41 [2025-01-09 03:10:37,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:37,309 INFO L225 Difference]: With dead ends: 136 [2025-01-09 03:10:37,309 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 03:10:37,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:10:37,310 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 57 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:37,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 111 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:10:37,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 03:10:37,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2025-01-09 03:10:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 59 states have (on average 1.11864406779661) internal successors, (66), 62 states have internal predecessors, (66), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 03:10:37,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2025-01-09 03:10:37,346 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 41 [2025-01-09 03:10:37,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:37,347 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2025-01-09 03:10:37,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:10:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2025-01-09 03:10:37,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 03:10:37,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:37,347 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:37,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:10:37,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:37,548 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:37,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:37,549 INFO L85 PathProgramCache]: Analyzing trace with hash -2040800043, now seen corresponding path program 2 times [2025-01-09 03:10:37,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:37,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791458763] [2025-01-09 03:10:37,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:10:37,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:37,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-01-09 03:10:37,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 03:10:37,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:10:37,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:37,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [88221523] [2025-01-09 03:10:37,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:10:37,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:37,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:37,576 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:37,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:10:37,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-01-09 03:10:37,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 03:10:37,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:10:37,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:37,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 03:10:37,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 03:10:37,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 03:10:37,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:37,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791458763] [2025-01-09 03:10:37,908 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:37,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88221523] [2025-01-09 03:10:37,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88221523] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:37,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:10:37,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2025-01-09 03:10:37,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698331931] [2025-01-09 03:10:37,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:37,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 03:10:37,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:37,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 03:10:37,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:10:37,909 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 03:10:38,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:38,174 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2025-01-09 03:10:38,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:10:38,174 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 46 [2025-01-09 03:10:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:38,175 INFO L225 Difference]: With dead ends: 127 [2025-01-09 03:10:38,175 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 03:10:38,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-01-09 03:10:38,176 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:38,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 190 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:10:38,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 03:10:38,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-01-09 03:10:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 71 states have internal predecessors, (75), 35 states have call successors, (35), 17 states have call predecessors, (35), 17 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 03:10:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2025-01-09 03:10:38,202 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 46 [2025-01-09 03:10:38,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:38,202 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2025-01-09 03:10:38,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 03:10:38,202 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2025-01-09 03:10:38,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 03:10:38,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:38,203 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:38,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 03:10:38,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 03:10:38,405 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:38,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:38,406 INFO L85 PathProgramCache]: Analyzing trace with hash -344792345, now seen corresponding path program 1 times [2025-01-09 03:10:38,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:38,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926591448] [2025-01-09 03:10:38,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:38,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:38,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 03:10:38,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 03:10:38,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:38,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:38,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [258829743] [2025-01-09 03:10:38,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:38,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:38,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:38,433 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-01-09 03:10:38,435 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-01-09 03:10:38,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 03:10:38,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 03:10:38,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:38,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:38,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 03:10:38,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 03:10:38,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 03:10:38,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:38,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926591448] [2025-01-09 03:10:38,767 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:38,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258829743] [2025-01-09 03:10:38,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258829743] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:38,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:10:38,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-01-09 03:10:38,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043630054] [2025-01-09 03:10:38,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:38,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 03:10:38,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:38,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 03:10:38,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:10:38,769 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-01-09 03:10:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:38,992 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2025-01-09 03:10:38,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:10:38,993 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 67 [2025-01-09 03:10:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:38,994 INFO L225 Difference]: With dead ends: 135 [2025-01-09 03:10:38,994 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 03:10:38,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-09 03:10:38,995 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:38,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 206 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:10:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 03:10:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-01-09 03:10:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 78 states have internal predecessors, (82), 35 states have call successors, (35), 20 states have call predecessors, (35), 19 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 03:10:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2025-01-09 03:10:39,028 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 67 [2025-01-09 03:10:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:39,028 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2025-01-09 03:10:39,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-01-09 03:10:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2025-01-09 03:10:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 03:10:39,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:39,030 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:39,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 03:10:39,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:39,234 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:39,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:39,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1314192962, now seen corresponding path program 1 times [2025-01-09 03:10:39,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:39,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209308818] [2025-01-09 03:10:39,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:39,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:39,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 03:10:39,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 03:10:39,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:39,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:39,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [356470299] [2025-01-09 03:10:39,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:39,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:39,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:39,264 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-01-09 03:10:39,266 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-01-09 03:10:39,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 03:10:39,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 03:10:39,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:39,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:39,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 03:10:39,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 03:10:39,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:39,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:39,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209308818] [2025-01-09 03:10:39,523 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:39,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356470299] [2025-01-09 03:10:39,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356470299] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:10:39,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:10:39,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-01-09 03:10:39,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490614579] [2025-01-09 03:10:39,523 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:39,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:10:39,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:39,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:10:39,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:10:39,524 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:10:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:39,678 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2025-01-09 03:10:39,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:10:39,679 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 72 [2025-01-09 03:10:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:39,680 INFO L225 Difference]: With dead ends: 137 [2025-01-09 03:10:39,680 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 03:10:39,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:10:39,680 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:39,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 152 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:10:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 03:10:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-01-09 03:10:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 74 states have (on average 1.0675675675675675) internal successors, (79), 76 states have internal predecessors, (79), 32 states have call successors, (32), 19 states have call predecessors, (32), 19 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 03:10:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2025-01-09 03:10:39,716 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 72 [2025-01-09 03:10:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:39,716 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2025-01-09 03:10:39,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:10:39,716 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2025-01-09 03:10:39,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 03:10:39,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:39,719 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-01-09 03:10:39,725 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-01-09 03:10:39,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:39,923 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:39,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:39,923 INFO L85 PathProgramCache]: Analyzing trace with hash -415962984, now seen corresponding path program 3 times [2025-01-09 03:10:39,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:39,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449159663] [2025-01-09 03:10:39,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:10:39,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:39,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 7 equivalence classes. [2025-01-09 03:10:39,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 03:10:39,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-09 03:10:39,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:39,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1575508820] [2025-01-09 03:10:39,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:10:39,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:39,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:39,958 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-01-09 03:10:39,960 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-01-09 03:10:39,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 7 equivalence classes. [2025-01-09 03:10:40,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 79 statements. [2025-01-09 03:10:40,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 03:10:40,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:40,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 03:10:40,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 55 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-09 03:10:40,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 55 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-09 03:10:40,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:40,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449159663] [2025-01-09 03:10:40,489 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:40,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575508820] [2025-01-09 03:10:40,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575508820] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:40,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:10:40,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2025-01-09 03:10:40,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889663451] [2025-01-09 03:10:40,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:40,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 03:10:40,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:40,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 03:10:40,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-01-09 03:10:40,491 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2025-01-09 03:10:40,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:40,996 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2025-01-09 03:10:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:10:40,997 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) Word has length 79 [2025-01-09 03:10:40,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:40,997 INFO L225 Difference]: With dead ends: 138 [2025-01-09 03:10:40,998 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 03:10:40,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-01-09 03:10:40,998 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:40,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 207 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:10:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 03:10:41,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2025-01-09 03:10:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 80 states have internal predecessors, (83), 27 states have call successors, (27), 21 states have call predecessors, (27), 20 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 03:10:41,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2025-01-09 03:10:41,015 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 79 [2025-01-09 03:10:41,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:41,015 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2025-01-09 03:10:41,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2025-01-09 03:10:41,015 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2025-01-09 03:10:41,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 03:10:41,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:41,016 INFO L218 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:41,023 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-01-09 03:10:41,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:41,221 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:41,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:41,221 INFO L85 PathProgramCache]: Analyzing trace with hash -200705098, now seen corresponding path program 2 times [2025-01-09 03:10:41,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:41,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721476715] [2025-01-09 03:10:41,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:10:41,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:41,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-01-09 03:10:41,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:10:41,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:10:41,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:41,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1224425479] [2025-01-09 03:10:41,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:10:41,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:41,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:41,250 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-01-09 03:10:41,250 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-01-09 03:10:41,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-01-09 03:10:41,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:10:41,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:10:41,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:41,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 03:10:41,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:41,564 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 63 proven. 43 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 03:10:41,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 63 proven. 35 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-01-09 03:10:41,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:41,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721476715] [2025-01-09 03:10:41,937 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:41,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224425479] [2025-01-09 03:10:41,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224425479] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:41,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:10:41,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2025-01-09 03:10:41,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993854339] [2025-01-09 03:10:41,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:41,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 03:10:41,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:41,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 03:10:41,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-09 03:10:41,939 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 7 states have call predecessors, (29), 9 states have call successors, (29) [2025-01-09 03:10:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:42,240 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2025-01-09 03:10:42,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 03:10:42,241 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 7 states have call predecessors, (29), 9 states have call successors, (29) Word has length 100 [2025-01-09 03:10:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:42,242 INFO L225 Difference]: With dead ends: 137 [2025-01-09 03:10:42,242 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 03:10:42,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2025-01-09 03:10:42,245 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:42,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 208 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:10:42,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 03:10:42,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2025-01-09 03:10:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 79 states have internal predecessors, (80), 27 states have call successors, (27), 20 states have call predecessors, (27), 20 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 03:10:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2025-01-09 03:10:42,280 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 100 [2025-01-09 03:10:42,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:42,281 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2025-01-09 03:10:42,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 7 states have call predecessors, (29), 9 states have call successors, (29) [2025-01-09 03:10:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2025-01-09 03:10:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:10:42,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:42,283 INFO L218 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:42,290 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-01-09 03:10:42,483 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,SelfDestructingSolverStorable12 [2025-01-09 03:10:42,484 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:42,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:42,484 INFO L85 PathProgramCache]: Analyzing trace with hash -940974857, now seen corresponding path program 2 times [2025-01-09 03:10:42,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:42,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411353441] [2025-01-09 03:10:42,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:10:42,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:42,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-01-09 03:10:42,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:10:42,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:10:42,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:42,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1282494822] [2025-01-09 03:10:42,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:10:42,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:42,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:42,522 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-01-09 03:10:42,524 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-01-09 03:10:42,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-01-09 03:10:42,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:10:42,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:10:42,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:42,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 03:10:42,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:42,713 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 86 proven. 64 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 03:10:42,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:42,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:42,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411353441] [2025-01-09 03:10:42,746 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:42,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282494822] [2025-01-09 03:10:42,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282494822] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:10:42,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:10:42,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-01-09 03:10:42,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859099760] [2025-01-09 03:10:42,746 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:42,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:10:42,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:42,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:10:42,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:10:42,747 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-01-09 03:10:42,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:42,982 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2025-01-09 03:10:42,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:10:42,983 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 123 [2025-01-09 03:10:42,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:42,984 INFO L225 Difference]: With dead ends: 145 [2025-01-09 03:10:42,984 INFO L226 Difference]: Without dead ends: 143 [2025-01-09 03:10:42,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-01-09 03:10:42,985 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:42,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 298 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:10:42,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-09 03:10:43,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2025-01-09 03:10:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 87 states have internal predecessors, (88), 34 states have call successors, (34), 22 states have call predecessors, (34), 22 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 03:10:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2025-01-09 03:10:43,025 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 123 [2025-01-09 03:10:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:43,025 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2025-01-09 03:10:43,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-01-09 03:10:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2025-01-09 03:10:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:10:43,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:43,027 INFO L218 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:43,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 03:10:43,227 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,SelfDestructingSolverStorable13 [2025-01-09 03:10:43,228 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:43,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:43,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2125779152, now seen corresponding path program 2 times [2025-01-09 03:10:43,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:43,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631324932] [2025-01-09 03:10:43,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:10:43,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:43,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-01-09 03:10:43,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:10:43,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:10:43,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 03:10:43,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:43,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631324932] [2025-01-09 03:10:43,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631324932] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:10:43,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587276080] [2025-01-09 03:10:43,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:10:43,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:43,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:43,423 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-01-09 03:10:43,424 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-01-09 03:10:43,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-01-09 03:10:43,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:10:43,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:10:43,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:43,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 03:10:43,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 03:10:43,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 03:10:43,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587276080] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:43,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:10:43,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2025-01-09 03:10:43,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97115875] [2025-01-09 03:10:43,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:43,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 03:10:43,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:43,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 03:10:43,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:10:43,702 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (62), 9 states have call predecessors, (62), 9 states have call successors, (62) [2025-01-09 03:10:44,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:44,080 INFO L93 Difference]: Finished difference Result 371 states and 403 transitions. [2025-01-09 03:10:44,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 03:10:44,081 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (62), 9 states have call predecessors, (62), 9 states have call successors, (62) Word has length 125 [2025-01-09 03:10:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:44,082 INFO L225 Difference]: With dead ends: 371 [2025-01-09 03:10:44,082 INFO L226 Difference]: Without dead ends: 355 [2025-01-09 03:10:44,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:10:44,083 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 137 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:44,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 138 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:10:44,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-09 03:10:44,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 299. [2025-01-09 03:10:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 181 states have (on average 1.0552486187845305) internal successors, (191), 188 states have internal predecessors, (191), 69 states have call successors, (69), 49 states have call predecessors, (69), 48 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 03:10:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 326 transitions. [2025-01-09 03:10:44,129 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 326 transitions. Word has length 125 [2025-01-09 03:10:44,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:44,129 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 326 transitions. [2025-01-09 03:10:44,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (62), 9 states have call predecessors, (62), 9 states have call successors, (62) [2025-01-09 03:10:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 326 transitions. [2025-01-09 03:10:44,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 03:10:44,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:44,131 INFO L218 NwaCegarLoop]: trace histogram [24, 23, 23, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:44,142 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-01-09 03:10:44,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:44,335 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:44,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:44,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1801040105, now seen corresponding path program 1 times [2025-01-09 03:10:44,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:44,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986080749] [2025-01-09 03:10:44,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:44,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:44,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 03:10:44,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 03:10:44,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:44,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:44,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1951495778] [2025-01-09 03:10:44,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:44,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:44,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:44,367 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-01-09 03:10:44,369 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-01-09 03:10:44,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 03:10:44,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 03:10:44,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:44,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:44,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 03:10:44,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1106 backedges. 45 proven. 115 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 03:10:44,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1106 backedges. 45 proven. 115 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 03:10:46,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:46,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986080749] [2025-01-09 03:10:46,526 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:46,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951495778] [2025-01-09 03:10:46,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951495778] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:46,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:10:46,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2025-01-09 03:10:46,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138897577] [2025-01-09 03:10:46,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:46,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 03:10:46,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:46,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 03:10:46,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-09 03:10:46,527 INFO L87 Difference]: Start difference. First operand 299 states and 326 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 15 states have internal predecessors, (40), 9 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 8 states have call predecessors, (46), 9 states have call successors, (46) [2025-01-09 03:10:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:47,742 INFO L93 Difference]: Finished difference Result 337 states and 356 transitions. [2025-01-09 03:10:47,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:10:47,742 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 15 states have internal predecessors, (40), 9 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 8 states have call predecessors, (46), 9 states have call successors, (46) Word has length 133 [2025-01-09 03:10:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:47,744 INFO L225 Difference]: With dead ends: 337 [2025-01-09 03:10:47,744 INFO L226 Difference]: Without dead ends: 299 [2025-01-09 03:10:47,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-01-09 03:10:47,745 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:47,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 373 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 03:10:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-01-09 03:10:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-01-09 03:10:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 187 states have (on average 1.0427807486631016) internal successors, (195), 193 states have internal predecessors, (195), 61 states have call successors, (61), 51 states have call predecessors, (61), 50 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 03:10:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 314 transitions. [2025-01-09 03:10:47,816 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 314 transitions. Word has length 133 [2025-01-09 03:10:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:47,816 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 314 transitions. [2025-01-09 03:10:47,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 15 states have internal predecessors, (40), 9 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 8 states have call predecessors, (46), 9 states have call successors, (46) [2025-01-09 03:10:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 314 transitions. [2025-01-09 03:10:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 03:10:47,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:47,817 INFO L218 NwaCegarLoop]: trace histogram [27, 26, 26, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:47,825 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-01-09 03:10:48,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:48,018 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:48,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1080537089, now seen corresponding path program 3 times [2025-01-09 03:10:48,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:48,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511418718] [2025-01-09 03:10:48,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:10:48,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:48,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 151 statements into 13 equivalence classes. [2025-01-09 03:10:48,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 03:10:48,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-01-09 03:10:48,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:48,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [333712418] [2025-01-09 03:10:48,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:10:48,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:48,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:48,092 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:48,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 03:10:48,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 151 statements into 13 equivalence classes. [2025-01-09 03:10:48,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 40 of 151 statements. [2025-01-09 03:10:48,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 03:10:48,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:48,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 03:10:48,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 158 proven. 1 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2025-01-09 03:10:48,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 158 proven. 1 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2025-01-09 03:10:48,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:48,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511418718] [2025-01-09 03:10:48,288 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:48,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333712418] [2025-01-09 03:10:48,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333712418] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:48,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:10:48,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2025-01-09 03:10:48,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258470287] [2025-01-09 03:10:48,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:48,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:10:48,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:48,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:10:48,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:10:48,289 INFO L87 Difference]: Start difference. First operand 299 states and 314 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:10:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:48,470 INFO L93 Difference]: Finished difference Result 305 states and 319 transitions. [2025-01-09 03:10:48,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:10:48,470 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 151 [2025-01-09 03:10:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:48,471 INFO L225 Difference]: With dead ends: 305 [2025-01-09 03:10:48,472 INFO L226 Difference]: Without dead ends: 289 [2025-01-09 03:10:48,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 289 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:10:48,472 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:48,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 158 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:10:48,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-01-09 03:10:48,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-01-09 03:10:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 185 states have (on average 1.0108108108108107) internal successors, (187), 186 states have internal predecessors, (187), 53 states have call successors, (53), 50 states have call predecessors, (53), 50 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 03:10:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 292 transitions. [2025-01-09 03:10:48,528 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 292 transitions. Word has length 151 [2025-01-09 03:10:48,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:48,529 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 292 transitions. [2025-01-09 03:10:48,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:10:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 292 transitions. [2025-01-09 03:10:48,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-01-09 03:10:48,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:48,531 INFO L218 NwaCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:48,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-09 03:10:48,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 03:10:48,732 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:48,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:48,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1732357376, now seen corresponding path program 3 times [2025-01-09 03:10:48,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:48,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995585797] [2025-01-09 03:10:48,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:10:48,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:48,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 293 statements into 35 equivalence classes. [2025-01-09 03:10:48,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) and asserted 248 of 293 statements. [2025-01-09 03:10:48,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2025-01-09 03:10:48,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 03:10:49,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:49,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995585797] [2025-01-09 03:10:49,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995585797] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:10:49,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336770708] [2025-01-09 03:10:49,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:10:49,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:49,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:49,353 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:49,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 03:10:49,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 293 statements into 35 equivalence classes. [2025-01-09 03:10:49,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) and asserted 248 of 293 statements. [2025-01-09 03:10:49,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2025-01-09 03:10:49,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:49,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 03:10:49,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-01-09 03:10:49,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 03:10:49,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336770708] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:49,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:10:49,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 24 [2025-01-09 03:10:49,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204989916] [2025-01-09 03:10:49,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:49,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 03:10:49,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:49,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 03:10:49,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2025-01-09 03:10:49,959 INFO L87 Difference]: Start difference. First operand 289 states and 292 transitions. Second operand has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 20 states have call successors, (148), 12 states have call predecessors, (148), 12 states have return successors, (147), 20 states have call predecessors, (147), 20 states have call successors, (147) [2025-01-09 03:10:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:50,541 INFO L93 Difference]: Finished difference Result 582 states and 595 transitions. [2025-01-09 03:10:50,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-09 03:10:50,542 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 20 states have call successors, (148), 12 states have call predecessors, (148), 12 states have return successors, (147), 20 states have call predecessors, (147), 20 states have call successors, (147) Word has length 293 [2025-01-09 03:10:50,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:50,545 INFO L225 Difference]: With dead ends: 582 [2025-01-09 03:10:50,546 INFO L226 Difference]: Without dead ends: 569 [2025-01-09 03:10:50,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 574 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 03:10:50,546 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 102 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:50,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 174 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:10:50,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-01-09 03:10:50,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2025-01-09 03:10:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 365 states have (on average 1.0054794520547945) internal successors, (367), 366 states have internal predecessors, (367), 103 states have call successors, (103), 100 states have call predecessors, (103), 100 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 03:10:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 572 transitions. [2025-01-09 03:10:50,663 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 572 transitions. Word has length 293 [2025-01-09 03:10:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:50,664 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 572 transitions. [2025-01-09 03:10:50,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 20 states have call successors, (148), 12 states have call predecessors, (148), 12 states have return successors, (147), 20 states have call predecessors, (147), 20 states have call successors, (147) [2025-01-09 03:10:50,666 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 572 transitions. [2025-01-09 03:10:50,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-01-09 03:10:50,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:50,672 INFO L218 NwaCegarLoop]: trace histogram [102, 101, 101, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:50,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-09 03:10:50,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 03:10:50,873 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:50,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:50,873 INFO L85 PathProgramCache]: Analyzing trace with hash -395919024, now seen corresponding path program 4 times [2025-01-09 03:10:50,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:50,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199491391] [2025-01-09 03:10:50,874 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 03:10:50,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:50,886 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 573 statements into 2 equivalence classes. [2025-01-09 03:10:51,035 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 573 of 573 statements. [2025-01-09 03:10:51,035 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 03:10:51,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:51,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2033044494] [2025-01-09 03:10:51,039 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 03:10:51,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:51,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:51,040 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:51,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-09 03:10:51,092 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 573 statements into 2 equivalence classes. [2025-01-09 03:10:51,316 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 573 of 573 statements. [2025-01-09 03:10:51,316 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 03:10:51,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:10:51,317 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 03:10:51,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-01-09 03:10:51,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-01-09 03:10:51,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:51,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:10:51,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 03:10:51,520 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 03:10:51,520 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 03:10:51,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-09 03:10:51,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:51,724 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:51,815 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 03:10:51,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:10:51 BoogieIcfgContainer [2025-01-09 03:10:51,817 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 03:10:51,817 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 03:10:51,817 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 03:10:51,817 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 03:10:51,818 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:34" (3/4) ... [2025-01-09 03:10:51,818 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 03:10:51,917 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 347. [2025-01-09 03:10:52,016 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 03:10:52,017 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 03:10:52,017 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 03:10:52,017 INFO L158 Benchmark]: Toolchain (without parser) took 18048.05ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 155.2MB in the beginning and 233.2MB in the end (delta: -78.0MB). Peak memory consumption was 164.9MB. Max. memory is 16.1GB. [2025-01-09 03:10:52,017 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:10:52,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.96ms. Allocated memory is still 201.3MB. Free memory was 155.2MB in the beginning and 143.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:10:52,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.10ms. Allocated memory is still 201.3MB. Free memory was 143.6MB in the beginning and 142.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:10:52,018 INFO L158 Benchmark]: Boogie Preprocessor took 24.92ms. Allocated memory is still 201.3MB. Free memory was 142.5MB in the beginning and 141.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:10:52,018 INFO L158 Benchmark]: RCFGBuilder took 176.29ms. Allocated memory is still 201.3MB. Free memory was 140.9MB in the beginning and 128.8MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:10:52,018 INFO L158 Benchmark]: TraceAbstraction took 17452.86ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 128.1MB in the beginning and 93.4MB in the end (delta: 34.7MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. [2025-01-09 03:10:52,018 INFO L158 Benchmark]: Witness Printer took 199.63ms. Allocated memory is still 293.6MB. Free memory was 93.4MB in the beginning and 233.2MB in the end (delta: -139.8MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2025-01-09 03:10:52,019 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.88ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 164.96ms. Allocated memory is still 201.3MB. Free memory was 155.2MB in the beginning and 143.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.10ms. Allocated memory is still 201.3MB. Free memory was 143.6MB in the beginning and 142.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.92ms. Allocated memory is still 201.3MB. Free memory was 142.5MB in the beginning and 141.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 176.29ms. Allocated memory is still 201.3MB. Free memory was 140.9MB in the beginning and 128.8MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17452.86ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 128.1MB in the beginning and 93.4MB in the end (delta: 34.7MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. * Witness Printer took 199.63ms. Allocated memory is still 293.6MB. Free memory was 93.4MB in the beginning and 233.2MB in the end (delta: -139.8MB). Peak memory consumption was 11.2MB. 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: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [a=20, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=11, n=11, x=1331, y=397, z=72] [L33] EXPR counter++ VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=12, n=12, x=1728, y=469, z=78] [L33] EXPR counter++ VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=13, n=13, x=2197, y=547, z=84] [L33] EXPR counter++ VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=14, n=14, x=2744, y=631, z=90] [L33] EXPR counter++ VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=15, n=15, x=3375, y=721, z=96] [L33] EXPR counter++ VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=16, n=16, x=4096, y=817, z=102] [L33] EXPR counter++ VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=17, n=17, x=4913, y=919, z=108] [L33] EXPR counter++ VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=18, n=18, x=5832, y=1027, z=114] [L33] EXPR counter++ VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=19, n=19, x=6859, y=1141, z=120] [L33] EXPR counter++ VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=20, n=20, x=8000, y=1261, z=126] [L33] EXPR counter++ VAL [a=20, counter=21, n=20, x=8000, y=1261, z=126] [L33] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=20, counter=21, n=20, x=8000, y=1261, z=126] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, counter=21] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=21] [L17] reach_error() VAL [\old(cond)=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 19, TraceHistogramMax: 102, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 458 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 404 mSDsluCounter, 2948 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2391 mSDsCounter, 452 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2771 IncrementalHoareTripleChecker+Invalid, 3223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 452 mSolverCounterUnsat, 557 mSDtfsCounter, 2771 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2485 GetRequests, 2258 SyntacticMatches, 5 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=569occurred in iteration=18, InterpolantAutomatonStates: 192, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 94 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 3824 NumberOfCodeBlocks, 3583 NumberOfCodeBlocksAsserted, 127 NumberOfCheckSat, 2857 ConstructedInterpolants, 0 QuantifiedInterpolants, 9366 SizeOfPredicates, 40 NumberOfNonLiveVariables, 2783 ConjunctsInSsa, 308 ConjunctsInUnsatCore, 31 InterpolantComputations, 6 PerfectInterpolantSequences, 21970/28892 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-01-09 03:10:52,049 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