./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-2.i --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/bitvector/byte_add_2-2.i -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 de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:46:38,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:46:38,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:46:38,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:46:38,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:46:38,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:46:38,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:46:38,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:46:38,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:46:38,455 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:46:38,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:46:38,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:46:38,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:46:38,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:46:38,456 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:46:38,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:46:38,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:46:38,456 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:46:38,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:46:38,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:46:38,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:46:38,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:46:38,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:46:38,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:46:38,457 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:46:38,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:46:38,457 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:46:38,457 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:46:38,457 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:46:38,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:46:38,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:46:38,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:46:38,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:46:38,458 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:46:38,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:46:38,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:46:38,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:46:38,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:46:38,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:46:38,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:46:38,459 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:46:38,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:46:38,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:46:38,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:46:38,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:46:38,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:46:38,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:46:38,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:46:38,459 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 -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2025-01-08 22:46:38,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:46:38,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:46:38,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:46:38,687 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:46:38,687 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:46:38,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2025-01-08 22:46:39,811 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c08cc183/5bbd7b2acb6348b5964e1c6dccdbba22/FLAG5b7fb0186 [2025-01-08 22:46:40,034 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:46:40,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2025-01-08 22:46:40,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c08cc183/5bbd7b2acb6348b5964e1c6dccdbba22/FLAG5b7fb0186 [2025-01-08 22:46:40,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c08cc183/5bbd7b2acb6348b5964e1c6dccdbba22 [2025-01-08 22:46:40,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:46:40,055 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:46:40,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:46:40,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:46:40,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:46:40,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:46:40" (1/1) ... [2025-01-08 22:46:40,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1831b2c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:40, skipping insertion in model container [2025-01-08 22:46:40,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:46:40" (1/1) ... [2025-01-08 22:46:40,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:46:40,177 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/bitvector/byte_add_2-2.i[1168,1181] [2025-01-08 22:46:40,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:46:40,209 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:46:40,216 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/bitvector/byte_add_2-2.i[1168,1181] [2025-01-08 22:46:40,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:46:40,241 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:46:40,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:40 WrapperNode [2025-01-08 22:46:40,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:46:40,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:46:40,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:46:40,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:46:40,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:40" (1/1) ... [2025-01-08 22:46:40,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:40" (1/1) ... [2025-01-08 22:46:40,269 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 141 [2025-01-08 22:46:40,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:46:40,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:46:40,270 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:46:40,270 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:46:40,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:40" (1/1) ... [2025-01-08 22:46:40,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:40" (1/1) ... [2025-01-08 22:46:40,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:40" (1/1) ... [2025-01-08 22:46:40,289 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-08 22:46:40,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:40" (1/1) ... [2025-01-08 22:46:40,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:40" (1/1) ... [2025-01-08 22:46:40,293 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:40" (1/1) ... [2025-01-08 22:46:40,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:40" (1/1) ... [2025-01-08 22:46:40,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:40" (1/1) ... [2025-01-08 22:46:40,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:40" (1/1) ... [2025-01-08 22:46:40,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:40" (1/1) ... [2025-01-08 22:46:40,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:46:40,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:46:40,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:46:40,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:46:40,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:40" (1/1) ... [2025-01-08 22:46:40,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:46:40,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:40,336 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-08 22:46:40,339 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-08 22:46:40,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:46:40,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:46:40,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:46:40,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:46:40,408 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:46:40,409 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:46:40,626 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-01-08 22:46:40,626 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:46:40,633 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:46:40,634 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:46:40,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:46:40 BoogieIcfgContainer [2025-01-08 22:46:40,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:46:40,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:46:40,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:46:40,639 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:46:40,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:46:40" (1/3) ... [2025-01-08 22:46:40,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4fc62f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:46:40, skipping insertion in model container [2025-01-08 22:46:40,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:46:40" (2/3) ... [2025-01-08 22:46:40,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4fc62f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:46:40, skipping insertion in model container [2025-01-08 22:46:40,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:46:40" (3/3) ... [2025-01-08 22:46:40,641 INFO L128 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2025-01-08 22:46:40,651 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:46:40,653 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG byte_add_2-2.i that has 1 procedures, 51 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-08 22:46:40,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:46:40,695 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;@1e73ac9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:46:40,695 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:46:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-08 22:46:40,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:40,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:40,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:40,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:40,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1570190741, now seen corresponding path program 1 times [2025-01-08 22:46:40,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:40,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809805754] [2025-01-08 22:46:40,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:40,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:40,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-08 22:46:40,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-08 22:46:40,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:40,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:40,945 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-08 22:46:40,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:40,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809805754] [2025-01-08 22:46:40,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809805754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:40,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:46:40,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:46:40,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360297459] [2025-01-08 22:46:40,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:40,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:46:40,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:40,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:46:40,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:46:40,969 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:41,116 INFO L93 Difference]: Finished difference Result 115 states and 196 transitions. [2025-01-08 22:46:41,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:46:41,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-08 22:46:41,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:41,123 INFO L225 Difference]: With dead ends: 115 [2025-01-08 22:46:41,123 INFO L226 Difference]: Without dead ends: 70 [2025-01-08 22:46:41,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:46:41,127 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 24 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:41,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 96 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:46:41,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-08 22:46:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-01-08 22:46:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 67 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2025-01-08 22:46:41,163 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 15 [2025-01-08 22:46:41,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:41,164 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2025-01-08 22:46:41,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2025-01-08 22:46:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 22:46:41,164 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:41,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:41,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:46:41,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:41,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:41,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2007922496, now seen corresponding path program 1 times [2025-01-08 22:46:41,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:41,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978251532] [2025-01-08 22:46:41,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:41,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:41,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 22:46:41,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:46:41,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:41,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:41,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:46:41,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:41,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978251532] [2025-01-08 22:46:41,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978251532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:41,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:46:41,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:46:41,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568486474] [2025-01-08 22:46:41,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:41,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:46:41,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:41,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:46:41,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:46:41,298 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:41,495 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2025-01-08 22:46:41,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:46:41,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-08 22:46:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:41,496 INFO L225 Difference]: With dead ends: 164 [2025-01-08 22:46:41,496 INFO L226 Difference]: Without dead ends: 127 [2025-01-08 22:46:41,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:46:41,497 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 92 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:41,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 116 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:46:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-08 22:46:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2025-01-08 22:46:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 90 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 139 transitions. [2025-01-08 22:46:41,506 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 139 transitions. Word has length 21 [2025-01-08 22:46:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:41,507 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 139 transitions. [2025-01-08 22:46:41,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2025-01-08 22:46:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 22:46:41,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:41,507 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:41,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:46:41,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:41,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:41,508 INFO L85 PathProgramCache]: Analyzing trace with hash -50508049, now seen corresponding path program 1 times [2025-01-08 22:46:41,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:41,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041862345] [2025-01-08 22:46:41,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:41,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:41,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-08 22:46:41,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:46:41,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:41,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:46:41,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:41,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041862345] [2025-01-08 22:46:41,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041862345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:41,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:46:41,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:46:41,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379792821] [2025-01-08 22:46:41,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:41,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:46:41,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:41,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:46:41,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:46:41,663 INFO L87 Difference]: Start difference. First operand 91 states and 139 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:41,776 INFO L93 Difference]: Finished difference Result 234 states and 354 transitions. [2025-01-08 22:46:41,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:46:41,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-08 22:46:41,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:41,778 INFO L225 Difference]: With dead ends: 234 [2025-01-08 22:46:41,780 INFO L226 Difference]: Without dead ends: 156 [2025-01-08 22:46:41,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:46:41,781 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 70 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:41,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 180 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:46:41,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-08 22:46:41,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 99. [2025-01-08 22:46:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.510204081632653) internal successors, (148), 98 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 148 transitions. [2025-01-08 22:46:41,793 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 148 transitions. Word has length 27 [2025-01-08 22:46:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:41,793 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 148 transitions. [2025-01-08 22:46:41,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 148 transitions. [2025-01-08 22:46:41,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:46:41,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:41,794 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:41,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:46:41,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:41,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:41,795 INFO L85 PathProgramCache]: Analyzing trace with hash -446870146, now seen corresponding path program 1 times [2025-01-08 22:46:41,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:41,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187865212] [2025-01-08 22:46:41,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:41,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:41,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:46:41,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:46:41,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:41,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:41,926 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:46:41,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:41,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187865212] [2025-01-08 22:46:41,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187865212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:41,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:46:41,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:46:41,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700780592] [2025-01-08 22:46:41,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:41,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:46:41,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:41,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:46:41,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:46:41,927 INFO L87 Difference]: Start difference. First operand 99 states and 148 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:42,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:42,044 INFO L93 Difference]: Finished difference Result 255 states and 380 transitions. [2025-01-08 22:46:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:46:42,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-08 22:46:42,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:42,045 INFO L225 Difference]: With dead ends: 255 [2025-01-08 22:46:42,045 INFO L226 Difference]: Without dead ends: 176 [2025-01-08 22:46:42,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:46:42,047 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 74 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:42,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 188 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:46:42,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-08 22:46:42,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 109. [2025-01-08 22:46:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 108 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2025-01-08 22:46:42,059 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 28 [2025-01-08 22:46:42,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:42,059 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2025-01-08 22:46:42,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:42,059 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2025-01-08 22:46:42,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:46:42,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:42,060 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:42,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:46:42,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:42,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:42,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1153653824, now seen corresponding path program 1 times [2025-01-08 22:46:42,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:42,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902833938] [2025-01-08 22:46:42,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:42,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:42,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:46:42,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:46:42,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:42,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:46:42,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:42,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902833938] [2025-01-08 22:46:42,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902833938] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:42,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618878870] [2025-01-08 22:46:42,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:42,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:42,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:42,152 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-08 22:46:42,153 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-08 22:46:42,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:46:42,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:46:42,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:42,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:42,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:46:42,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-08 22:46:42,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:46:42,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618878870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:42,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:46:42,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-08 22:46:42,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371207403] [2025-01-08 22:46:42,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:42,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:46:42,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:42,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:46:42,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:46:42,269 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:42,481 INFO L93 Difference]: Finished difference Result 377 states and 583 transitions. [2025-01-08 22:46:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:46:42,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-08 22:46:42,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:42,483 INFO L225 Difference]: With dead ends: 377 [2025-01-08 22:46:42,483 INFO L226 Difference]: Without dead ends: 284 [2025-01-08 22:46:42,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:46:42,484 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 129 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:42,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 339 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:46:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-01-08 22:46:42,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 189. [2025-01-08 22:46:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.4734042553191489) internal successors, (277), 188 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 277 transitions. [2025-01-08 22:46:42,503 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 277 transitions. Word has length 29 [2025-01-08 22:46:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:42,503 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 277 transitions. [2025-01-08 22:46:42,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 277 transitions. [2025-01-08 22:46:42,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 22:46:42,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:42,504 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:42,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:46:42,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:42,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:42,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:42,705 INFO L85 PathProgramCache]: Analyzing trace with hash 549907113, now seen corresponding path program 1 times [2025-01-08 22:46:42,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:42,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853441785] [2025-01-08 22:46:42,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:42,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:42,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:46:42,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:46:42,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:42,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:46:42,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:42,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853441785] [2025-01-08 22:46:42,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853441785] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:42,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956255389] [2025-01-08 22:46:42,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:42,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:42,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:42,789 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-08 22:46:42,791 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-08 22:46:42,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:46:42,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:46:42,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:42,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:42,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 22:46:42,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:46:42,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:46:42,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956255389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:42,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:46:42,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-01-08 22:46:42,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402216899] [2025-01-08 22:46:42,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:42,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:46:42,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:42,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:46:42,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:46:42,869 INFO L87 Difference]: Start difference. First operand 189 states and 277 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:43,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:43,024 INFO L93 Difference]: Finished difference Result 426 states and 662 transitions. [2025-01-08 22:46:43,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:46:43,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-08 22:46:43,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:43,026 INFO L225 Difference]: With dead ends: 426 [2025-01-08 22:46:43,026 INFO L226 Difference]: Without dead ends: 264 [2025-01-08 22:46:43,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:46:43,028 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 37 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:43,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 151 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:46:43,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-01-08 22:46:43,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 235. [2025-01-08 22:46:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.3974358974358974) internal successors, (327), 234 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:43,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 327 transitions. [2025-01-08 22:46:43,041 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 327 transitions. Word has length 30 [2025-01-08 22:46:43,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:43,041 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 327 transitions. [2025-01-08 22:46:43,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:43,041 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 327 transitions. [2025-01-08 22:46:43,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-08 22:46:43,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:43,044 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:43,050 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-08 22:46:43,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:43,248 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:43,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:43,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2025567444, now seen corresponding path program 1 times [2025-01-08 22:46:43,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:43,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114380332] [2025-01-08 22:46:43,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:43,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:43,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-08 22:46:43,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-08 22:46:43,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:43,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:46:43,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:43,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114380332] [2025-01-08 22:46:43,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114380332] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:43,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022692803] [2025-01-08 22:46:43,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:43,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:43,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:43,374 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-08 22:46:43,375 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-08 22:46:43,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-08 22:46:43,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-08 22:46:43,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:43,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:43,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 22:46:43,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:46:43,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:46:43,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022692803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:43,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:46:43,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-08 22:46:43,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068631380] [2025-01-08 22:46:43,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:43,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:46:43,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:43,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:46:43,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:46:43,462 INFO L87 Difference]: Start difference. First operand 235 states and 327 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:43,599 INFO L93 Difference]: Finished difference Result 518 states and 750 transitions. [2025-01-08 22:46:43,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:46:43,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-08 22:46:43,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:43,601 INFO L225 Difference]: With dead ends: 518 [2025-01-08 22:46:43,601 INFO L226 Difference]: Without dead ends: 322 [2025-01-08 22:46:43,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:46:43,602 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:43,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 151 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:46:43,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-01-08 22:46:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 275. [2025-01-08 22:46:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 1.3686131386861313) internal successors, (375), 274 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 375 transitions. [2025-01-08 22:46:43,616 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 375 transitions. Word has length 36 [2025-01-08 22:46:43,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:43,617 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 375 transitions. [2025-01-08 22:46:43,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 375 transitions. [2025-01-08 22:46:43,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-08 22:46:43,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:43,618 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:43,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:46:43,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:43,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:43,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:43,820 INFO L85 PathProgramCache]: Analyzing trace with hash -665618941, now seen corresponding path program 1 times [2025-01-08 22:46:43,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:43,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145621458] [2025-01-08 22:46:43,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:43,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:43,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-08 22:46:43,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-08 22:46:43,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:43,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-08 22:46:43,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:43,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145621458] [2025-01-08 22:46:43,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145621458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:43,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:46:43,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:46:43,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693559855] [2025-01-08 22:46:43,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:43,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:46:43,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:43,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:46:43,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:46:43,929 INFO L87 Difference]: Start difference. First operand 275 states and 375 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:44,125 INFO L93 Difference]: Finished difference Result 947 states and 1293 transitions. [2025-01-08 22:46:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:46:44,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-01-08 22:46:44,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:44,128 INFO L225 Difference]: With dead ends: 947 [2025-01-08 22:46:44,128 INFO L226 Difference]: Without dead ends: 709 [2025-01-08 22:46:44,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:46:44,129 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 141 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:44,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 272 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:46:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-01-08 22:46:44,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 275. [2025-01-08 22:46:44,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 1.3686131386861313) internal successors, (375), 274 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 375 transitions. [2025-01-08 22:46:44,138 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 375 transitions. Word has length 42 [2025-01-08 22:46:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:44,138 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 375 transitions. [2025-01-08 22:46:44,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 375 transitions. [2025-01-08 22:46:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-08 22:46:44,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:44,139 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:44,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:46:44,139 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:44,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash -76867883, now seen corresponding path program 1 times [2025-01-08 22:46:44,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:44,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965592002] [2025-01-08 22:46:44,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:44,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:44,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-08 22:46:44,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:46:44,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:44,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-08 22:46:44,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:44,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965592002] [2025-01-08 22:46:44,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965592002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:44,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:46:44,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:46:44,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904357418] [2025-01-08 22:46:44,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:44,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:46:44,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:44,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:46:44,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:46:44,229 INFO L87 Difference]: Start difference. First operand 275 states and 375 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:44,524 INFO L93 Difference]: Finished difference Result 1172 states and 1596 transitions. [2025-01-08 22:46:44,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:46:44,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-01-08 22:46:44,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:44,527 INFO L225 Difference]: With dead ends: 1172 [2025-01-08 22:46:44,527 INFO L226 Difference]: Without dead ends: 934 [2025-01-08 22:46:44,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:46:44,528 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 212 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:44,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 405 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:46:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-01-08 22:46:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 275. [2025-01-08 22:46:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 1.3686131386861313) internal successors, (375), 274 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 375 transitions. [2025-01-08 22:46:44,539 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 375 transitions. Word has length 43 [2025-01-08 22:46:44,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:44,539 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 375 transitions. [2025-01-08 22:46:44,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:44,540 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 375 transitions. [2025-01-08 22:46:44,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-08 22:46:44,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:44,540 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:44,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:46:44,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:44,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:44,541 INFO L85 PathProgramCache]: Analyzing trace with hash 767137619, now seen corresponding path program 1 times [2025-01-08 22:46:44,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:44,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286762359] [2025-01-08 22:46:44,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:44,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:44,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-08 22:46:44,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:46:44,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:44,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-08 22:46:44,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:44,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286762359] [2025-01-08 22:46:44,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286762359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:44,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:46:44,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:46:44,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532251662] [2025-01-08 22:46:44,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:44,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:46:44,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:44,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:46:44,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:46:44,662 INFO L87 Difference]: Start difference. First operand 275 states and 375 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:44,675 INFO L93 Difference]: Finished difference Result 527 states and 716 transitions. [2025-01-08 22:46:44,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:46:44,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-01-08 22:46:44,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:44,676 INFO L225 Difference]: With dead ends: 527 [2025-01-08 22:46:44,676 INFO L226 Difference]: Without dead ends: 261 [2025-01-08 22:46:44,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:46:44,677 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 65 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:44,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 75 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:46:44,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-01-08 22:46:44,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2025-01-08 22:46:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.3576923076923078) internal successors, (353), 260 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:44,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 353 transitions. [2025-01-08 22:46:44,689 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 353 transitions. Word has length 43 [2025-01-08 22:46:44,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:44,689 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 353 transitions. [2025-01-08 22:46:44,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 353 transitions. [2025-01-08 22:46:44,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-08 22:46:44,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:44,690 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:44,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:46:44,690 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:44,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:44,691 INFO L85 PathProgramCache]: Analyzing trace with hash 423342123, now seen corresponding path program 1 times [2025-01-08 22:46:44,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:44,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134724977] [2025-01-08 22:46:44,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:44,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:44,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-08 22:46:44,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-08 22:46:44,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:44,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:44,753 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:46:44,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:44,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134724977] [2025-01-08 22:46:44,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134724977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:44,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:46:44,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:46:44,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261552889] [2025-01-08 22:46:44,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:44,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:46:44,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:44,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:46:44,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:46:44,755 INFO L87 Difference]: Start difference. First operand 261 states and 353 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:44,773 INFO L93 Difference]: Finished difference Result 373 states and 495 transitions. [2025-01-08 22:46:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:46:44,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-08 22:46:44,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:44,776 INFO L225 Difference]: With dead ends: 373 [2025-01-08 22:46:44,776 INFO L226 Difference]: Without dead ends: 326 [2025-01-08 22:46:44,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:46:44,777 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:44,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 142 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:46:44,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-01-08 22:46:44,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 320. [2025-01-08 22:46:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 1.322884012539185) internal successors, (422), 319 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:44,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 422 transitions. [2025-01-08 22:46:44,795 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 422 transitions. Word has length 48 [2025-01-08 22:46:44,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:44,795 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 422 transitions. [2025-01-08 22:46:44,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 422 transitions. [2025-01-08 22:46:44,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-08 22:46:44,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:44,796 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:44,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:46:44,796 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:44,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:44,797 INFO L85 PathProgramCache]: Analyzing trace with hash 350955565, now seen corresponding path program 1 times [2025-01-08 22:46:44,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:44,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159369587] [2025-01-08 22:46:44,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:44,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:44,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-08 22:46:44,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-08 22:46:44,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:44,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:46:44,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:44,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159369587] [2025-01-08 22:46:44,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159369587] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:44,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479238500] [2025-01-08 22:46:44,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:44,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:44,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:44,952 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-08 22:46:44,953 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-08 22:46:44,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-08 22:46:44,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-08 22:46:44,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:44,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:44,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-08 22:46:45,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:46:45,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:46:45,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479238500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:45,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:46:45,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2025-01-08 22:46:45,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515480119] [2025-01-08 22:46:45,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:45,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:46:45,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:45,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:46:45,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:46:45,030 INFO L87 Difference]: Start difference. First operand 320 states and 422 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:45,092 INFO L93 Difference]: Finished difference Result 684 states and 906 transitions. [2025-01-08 22:46:45,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:46:45,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-08 22:46:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:45,094 INFO L225 Difference]: With dead ends: 684 [2025-01-08 22:46:45,094 INFO L226 Difference]: Without dead ends: 339 [2025-01-08 22:46:45,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:46:45,095 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 26 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:45,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 114 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:46:45,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-01-08 22:46:45,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 264. [2025-01-08 22:46:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.3041825095057034) internal successors, (343), 263 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 343 transitions. [2025-01-08 22:46:45,106 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 343 transitions. Word has length 48 [2025-01-08 22:46:45,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:45,106 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 343 transitions. [2025-01-08 22:46:45,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 343 transitions. [2025-01-08 22:46:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-08 22:46:45,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:45,107 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:45,113 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-08 22:46:45,307 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,SelfDestructingSolverStorable11 [2025-01-08 22:46:45,308 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:45,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:45,308 INFO L85 PathProgramCache]: Analyzing trace with hash -793904116, now seen corresponding path program 1 times [2025-01-08 22:46:45,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:45,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572339230] [2025-01-08 22:46:45,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:45,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:45,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-08 22:46:45,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-08 22:46:45,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:45,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-08 22:46:45,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:45,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572339230] [2025-01-08 22:46:45,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572339230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:45,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:46:45,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:46:45,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064772483] [2025-01-08 22:46:45,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:45,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:46:45,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:45,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:46:45,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:46:45,490 INFO L87 Difference]: Start difference. First operand 264 states and 343 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:45,575 INFO L93 Difference]: Finished difference Result 850 states and 1088 transitions. [2025-01-08 22:46:45,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:46:45,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-08 22:46:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:45,577 INFO L225 Difference]: With dead ends: 850 [2025-01-08 22:46:45,577 INFO L226 Difference]: Without dead ends: 603 [2025-01-08 22:46:45,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:46:45,579 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 143 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:45,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 239 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:46:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-01-08 22:46:45,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 394. [2025-01-08 22:46:45,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 1.3002544529262086) internal successors, (511), 393 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 511 transitions. [2025-01-08 22:46:45,592 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 511 transitions. Word has length 69 [2025-01-08 22:46:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:45,592 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 511 transitions. [2025-01-08 22:46:45,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 511 transitions. [2025-01-08 22:46:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-08 22:46:45,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:45,594 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:45,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:46:45,595 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:45,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:45,595 INFO L85 PathProgramCache]: Analyzing trace with hash -3711478, now seen corresponding path program 1 times [2025-01-08 22:46:45,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:45,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065534409] [2025-01-08 22:46:45,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:45,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-08 22:46:45,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-08 22:46:45,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:45,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-08 22:46:45,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:45,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065534409] [2025-01-08 22:46:45,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065534409] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:45,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831977873] [2025-01-08 22:46:45,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:45,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:45,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:45,832 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-08 22:46:45,833 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-08 22:46:45,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-08 22:46:45,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-08 22:46:45,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:45,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:45,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-08 22:46:45,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-08 22:46:46,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:46:46,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831977873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:46,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:46:46,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-01-08 22:46:46,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569714181] [2025-01-08 22:46:46,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:46,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:46:46,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:46,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:46:46,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-08 22:46:46,027 INFO L87 Difference]: Start difference. First operand 394 states and 511 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:46,338 INFO L93 Difference]: Finished difference Result 1193 states and 1534 transitions. [2025-01-08 22:46:46,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-08 22:46:46,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-08 22:46:46,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:46,341 INFO L225 Difference]: With dead ends: 1193 [2025-01-08 22:46:46,341 INFO L226 Difference]: Without dead ends: 768 [2025-01-08 22:46:46,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:46:46,342 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 233 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:46,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 491 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:46:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-01-08 22:46:46,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 372. [2025-01-08 22:46:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 1.266846361185984) internal successors, (470), 371 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 470 transitions. [2025-01-08 22:46:46,354 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 470 transitions. Word has length 69 [2025-01-08 22:46:46,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:46,354 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 470 transitions. [2025-01-08 22:46:46,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:46,354 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 470 transitions. [2025-01-08 22:46:46,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-08 22:46:46,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:46,355 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:46,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-08 22:46:46,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-08 22:46:46,555 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:46,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:46,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1274383912, now seen corresponding path program 1 times [2025-01-08 22:46:46,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:46,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767870857] [2025-01-08 22:46:46,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:46,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:46,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-08 22:46:46,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:46:46,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:46,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:46:46,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:46,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767870857] [2025-01-08 22:46:46,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767870857] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:46,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311102080] [2025-01-08 22:46:46,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:46,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:46,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:46,770 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-08 22:46:46,772 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-08 22:46:46,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-08 22:46:47,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:46:47,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:47,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:47,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-08 22:46:47,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:46:47,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:46:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:46:47,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311102080] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:46:47,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:46:47,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-08 22:46:47,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671009428] [2025-01-08 22:46:47,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:46:47,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-08 22:46:47,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:47,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-08 22:46:47,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:46:47,659 INFO L87 Difference]: Start difference. First operand 372 states and 470 transitions. Second operand has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:47,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:47,877 INFO L93 Difference]: Finished difference Result 923 states and 1153 transitions. [2025-01-08 22:46:47,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-08 22:46:47,878 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-08 22:46:47,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:47,879 INFO L225 Difference]: With dead ends: 923 [2025-01-08 22:46:47,879 INFO L226 Difference]: Without dead ends: 568 [2025-01-08 22:46:47,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2025-01-08 22:46:47,881 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 327 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:47,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 611 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:46:47,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-01-08 22:46:47,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 344. [2025-01-08 22:46:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 1.2565597667638484) internal successors, (431), 343 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 431 transitions. [2025-01-08 22:46:47,892 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 431 transitions. Word has length 73 [2025-01-08 22:46:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:47,893 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 431 transitions. [2025-01-08 22:46:47,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 431 transitions. [2025-01-08 22:46:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-08 22:46:47,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:47,894 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:47,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-08 22:46:48,094 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,SelfDestructingSolverStorable14 [2025-01-08 22:46:48,094 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:48,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:48,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1360210280, now seen corresponding path program 2 times [2025-01-08 22:46:48,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:48,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121053648] [2025-01-08 22:46:48,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:46:48,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:48,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-01-08 22:46:48,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:46:48,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:46:48,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:48,386 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 5 proven. 73 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:46:48,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:48,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121053648] [2025-01-08 22:46:48,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121053648] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:48,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466305730] [2025-01-08 22:46:48,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:46:48,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:48,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:48,389 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-08 22:46:48,389 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-08 22:46:48,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-01-08 22:46:48,475 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:46:48,475 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:46:48,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:48,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-08 22:46:48,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:48,666 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:46:48,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:46:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:46:49,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466305730] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:46:49,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:46:49,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2025-01-08 22:46:49,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929028659] [2025-01-08 22:46:49,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:46:49,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-08 22:46:49,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:49,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-08 22:46:49,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-01-08 22:46:49,060 INFO L87 Difference]: Start difference. First operand 344 states and 431 transitions. Second operand has 21 states, 21 states have (on average 7.809523809523809) internal successors, (164), 21 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:50,780 INFO L93 Difference]: Finished difference Result 2459 states and 3005 transitions. [2025-01-08 22:46:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-08 22:46:50,780 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.809523809523809) internal successors, (164), 21 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-08 22:46:50,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:50,787 INFO L225 Difference]: With dead ends: 2459 [2025-01-08 22:46:50,787 INFO L226 Difference]: Without dead ends: 2448 [2025-01-08 22:46:50,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=713, Invalid=3069, Unknown=0, NotChecked=0, Total=3782 [2025-01-08 22:46:50,790 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 396 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:50,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1790 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:46:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2025-01-08 22:46:50,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 642. [2025-01-08 22:46:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 1.2636505460218408) internal successors, (810), 641 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 810 transitions. [2025-01-08 22:46:50,823 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 810 transitions. Word has length 73 [2025-01-08 22:46:50,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:50,824 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 810 transitions. [2025-01-08 22:46:50,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.809523809523809) internal successors, (164), 21 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 810 transitions. [2025-01-08 22:46:50,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-08 22:46:50,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:50,825 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:50,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-08 22:46:51,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:51,026 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:51,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:51,027 INFO L85 PathProgramCache]: Analyzing trace with hash -484191274, now seen corresponding path program 1 times [2025-01-08 22:46:51,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:51,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508842152] [2025-01-08 22:46:51,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:51,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:51,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-08 22:46:51,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:46:51,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:51,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 59 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:46:51,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:51,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508842152] [2025-01-08 22:46:51,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508842152] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:51,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967302405] [2025-01-08 22:46:51,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:51,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:51,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:51,299 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-08 22:46:51,300 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-08 22:46:51,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-08 22:46:51,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:46:51,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:51,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:51,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-08 22:46:51,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 57 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:46:51,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:46:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:46:51,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967302405] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:46:51,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:46:51,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 9] total 24 [2025-01-08 22:46:51,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005678217] [2025-01-08 22:46:51,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:46:51,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-08 22:46:51,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:51,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-08 22:46:51,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2025-01-08 22:46:51,988 INFO L87 Difference]: Start difference. First operand 642 states and 810 transitions. Second operand has 24 states, 24 states have (on average 8.625) internal successors, (207), 24 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:53,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:53,662 INFO L93 Difference]: Finished difference Result 4092 states and 5083 transitions. [2025-01-08 22:46:53,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-01-08 22:46:53,662 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.625) internal successors, (207), 24 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-08 22:46:53,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:53,673 INFO L225 Difference]: With dead ends: 4092 [2025-01-08 22:46:53,673 INFO L226 Difference]: Without dead ends: 4084 [2025-01-08 22:46:53,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2339 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1349, Invalid=6133, Unknown=0, NotChecked=0, Total=7482 [2025-01-08 22:46:53,677 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 759 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:53,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1497 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:46:53,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4084 states. [2025-01-08 22:46:53,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4084 to 1355. [2025-01-08 22:46:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1354 states have (on average 1.310192023633678) internal successors, (1774), 1354 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1774 transitions. [2025-01-08 22:46:53,739 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1774 transitions. Word has length 73 [2025-01-08 22:46:53,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:53,739 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 1774 transitions. [2025-01-08 22:46:53,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.625) internal successors, (207), 24 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1774 transitions. [2025-01-08 22:46:53,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-08 22:46:53,740 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:53,741 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:53,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-08 22:46:53,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-08 22:46:53,945 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:53,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:53,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1439011061, now seen corresponding path program 1 times [2025-01-08 22:46:53,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:53,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054657422] [2025-01-08 22:46:53,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:53,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:53,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-08 22:46:53,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-08 22:46:53,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:53,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 59 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:46:54,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:54,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054657422] [2025-01-08 22:46:54,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054657422] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:54,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338509351] [2025-01-08 22:46:54,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:54,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:54,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:54,335 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-08 22:46:54,336 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-08 22:46:54,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-08 22:46:54,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-08 22:46:54,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:54,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:54,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:46:54,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-08 22:46:54,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:46:54,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338509351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:46:54,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:46:54,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-01-08 22:46:54,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823968883] [2025-01-08 22:46:54,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:46:54,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:46:54,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:54,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:46:54,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:46:54,974 INFO L87 Difference]: Start difference. First operand 1355 states and 1774 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:55,042 INFO L93 Difference]: Finished difference Result 1371 states and 1795 transitions. [2025-01-08 22:46:55,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:46:55,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-01-08 22:46:55,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:55,046 INFO L225 Difference]: With dead ends: 1371 [2025-01-08 22:46:55,047 INFO L226 Difference]: Without dead ends: 1366 [2025-01-08 22:46:55,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:46:55,048 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:55,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 219 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:46:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-01-08 22:46:55,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1363. [2025-01-08 22:46:55,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1362 states have (on average 1.3113069016152716) internal successors, (1786), 1362 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1786 transitions. [2025-01-08 22:46:55,113 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1786 transitions. Word has length 75 [2025-01-08 22:46:55,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:55,113 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1786 transitions. [2025-01-08 22:46:55,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:55,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1786 transitions. [2025-01-08 22:46:55,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-08 22:46:55,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:55,114 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:55,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-08 22:46:55,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-08 22:46:55,315 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:55,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:55,316 INFO L85 PathProgramCache]: Analyzing trace with hash 233932441, now seen corresponding path program 1 times [2025-01-08 22:46:55,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:55,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575304257] [2025-01-08 22:46:55,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:55,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:55,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-08 22:46:55,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-08 22:46:55,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:55,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:46:55,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:55,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575304257] [2025-01-08 22:46:55,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575304257] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:55,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097619364] [2025-01-08 22:46:55,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:55,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:55,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:55,583 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-08 22:46:55,585 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-08 22:46:55,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-08 22:46:55,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-08 22:46:55,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:55,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:55,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-08 22:46:55,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:46:55,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:46:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:46:56,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097619364] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:46:56,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:46:56,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2025-01-08 22:46:56,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848227176] [2025-01-08 22:46:56,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:46:56,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-08 22:46:56,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:56,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-08 22:46:56,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-01-08 22:46:56,118 INFO L87 Difference]: Start difference. First operand 1363 states and 1786 transitions. Second operand has 22 states, 22 states have (on average 7.954545454545454) internal successors, (175), 22 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:57,133 INFO L93 Difference]: Finished difference Result 3816 states and 4871 transitions. [2025-01-08 22:46:57,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-08 22:46:57,133 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.954545454545454) internal successors, (175), 22 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-01-08 22:46:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:57,143 INFO L225 Difference]: With dead ends: 3816 [2025-01-08 22:46:57,143 INFO L226 Difference]: Without dead ends: 3799 [2025-01-08 22:46:57,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=547, Invalid=2423, Unknown=0, NotChecked=0, Total=2970 [2025-01-08 22:46:57,145 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 343 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:57,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1606 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:46:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3799 states. [2025-01-08 22:46:57,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3799 to 1354. [2025-01-08 22:46:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1353 states have (on average 1.312638580931264) internal successors, (1776), 1353 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1776 transitions. [2025-01-08 22:46:57,218 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1776 transitions. Word has length 75 [2025-01-08 22:46:57,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:57,218 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1776 transitions. [2025-01-08 22:46:57,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.954545454545454) internal successors, (175), 22 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1776 transitions. [2025-01-08 22:46:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-08 22:46:57,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:57,220 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:57,227 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-08 22:46:57,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:57,421 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:57,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1712248313, now seen corresponding path program 1 times [2025-01-08 22:46:57,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:57,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87423411] [2025-01-08 22:46:57,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:57,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:57,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-08 22:46:57,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-08 22:46:57,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:57,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 39 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:46:57,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:46:57,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87423411] [2025-01-08 22:46:57,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87423411] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:46:57,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080218098] [2025-01-08 22:46:57,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:57,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:57,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:46:57,569 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-08 22:46:57,571 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-08 22:46:57,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-08 22:46:58,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-08 22:46:58,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:58,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:46:58,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-08 22:46:58,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:46:58,216 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 39 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:46:58,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:46:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:46:58,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080218098] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:46:58,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:46:58,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-08 22:46:58,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973895935] [2025-01-08 22:46:58,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:46:58,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:46:58,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:46:58,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:46:58,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:46:58,335 INFO L87 Difference]: Start difference. First operand 1354 states and 1776 transitions. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:46:58,636 INFO L93 Difference]: Finished difference Result 3182 states and 4079 transitions. [2025-01-08 22:46:58,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-08 22:46:58,636 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-08 22:46:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:46:58,642 INFO L225 Difference]: With dead ends: 3182 [2025-01-08 22:46:58,642 INFO L226 Difference]: Without dead ends: 3177 [2025-01-08 22:46:58,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-01-08 22:46:58,643 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 394 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:46:58,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 511 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:46:58,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2025-01-08 22:46:58,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 1720. [2025-01-08 22:46:58,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1719 states have (on average 1.3443862710878418) internal successors, (2311), 1719 states have internal predecessors, (2311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2311 transitions. [2025-01-08 22:46:58,703 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2311 transitions. Word has length 76 [2025-01-08 22:46:58,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:46:58,703 INFO L471 AbstractCegarLoop]: Abstraction has 1720 states and 2311 transitions. [2025-01-08 22:46:58,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:46:58,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2311 transitions. [2025-01-08 22:46:58,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-08 22:46:58,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:46:58,704 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:58,710 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-08 22:46:58,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:46:58,909 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:46:58,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:46:58,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1595439096, now seen corresponding path program 1 times [2025-01-08 22:46:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:46:58,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066843995] [2025-01-08 22:46:58,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:46:58,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:46:58,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-08 22:46:58,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-08 22:46:58,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:58,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 22:46:58,933 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-08 22:46:58,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-08 22:46:58,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-08 22:46:58,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:46:58,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 22:46:58,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-08 22:46:58,987 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-08 22:46:58,988 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:46:58,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 22:46:58,991 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:46:59,034 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:46:59,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:46:59 BoogieIcfgContainer [2025-01-08 22:46:59,036 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:46:59,036 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:46:59,036 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:46:59,036 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:46:59,037 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:46:40" (3/4) ... [2025-01-08 22:46:59,041 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-08 22:46:59,041 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:46:59,042 INFO L158 Benchmark]: Toolchain (without parser) took 18987.04ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 105.0MB in the beginning and 271.9MB in the end (delta: -166.9MB). Peak memory consumption was 165.1MB. Max. memory is 16.1GB. [2025-01-08 22:46:59,042 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:46:59,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.39ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 91.1MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 22:46:59,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.32ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 89.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:46:59,042 INFO L158 Benchmark]: Boogie Preprocessor took 34.53ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:46:59,042 INFO L158 Benchmark]: RCFGBuilder took 329.58ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 65.0MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 22:46:59,042 INFO L158 Benchmark]: TraceAbstraction took 18399.92ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 65.0MB in the beginning and 272.1MB in the end (delta: -207.1MB). Peak memory consumption was 114.8MB. Max. memory is 16.1GB. [2025-01-08 22:46:59,042 INFO L158 Benchmark]: Witness Printer took 4.93ms. Allocated memory is still 469.8MB. Free memory was 272.1MB in the beginning and 271.9MB in the end (delta: 147.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:46:59,043 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.18ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.39ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 91.1MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.32ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 89.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.53ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 329.58ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 65.0MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18399.92ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 65.0MB in the beginning and 272.1MB in the end (delta: -207.1MB). Peak memory consumption was 114.8MB. Max. memory is 16.1GB. * Witness Printer took 4.93ms. Allocated memory is still 469.8MB. Free memory was 272.1MB in the beginning and 271.9MB in the end (delta: 147.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 116, overapproximation of bitwiseOr at line 116. Possible FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND TRUE a3 == (unsigned char)0 [L60] na = na - 1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=3] [L61] COND TRUE a2 == (unsigned char)0 [L62] na = na - 1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=2] [L63] COND TRUE a1 == (unsigned char)0 [L64] na = na - 1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=1] [L68] nb = (unsigned char)4 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L89] COND TRUE i < nb VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L104] i = i + (unsigned char)1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L83] COND FALSE !(i < na) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L89] COND TRUE i < nb VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L91] COND TRUE i == (unsigned char)1 [L91] partial_sum = partial_sum + b1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0, r1=82] [L104] i = i + (unsigned char)1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=82, r0=0, r1=82] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L83] COND FALSE !(i < na) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L89] COND TRUE i < nb VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L92] COND TRUE i == (unsigned char)2 [L92] partial_sum = partial_sum + b2 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=254, r0=0, r1=82, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L83] COND FALSE !(i < na) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L89] COND TRUE i < nb VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L93] COND TRUE i == (unsigned char)3 [L93] partial_sum = partial_sum + b3 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, r0=0, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, r0=0, r1=82, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, i=4, r0=0, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\result=218103808, a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13] [L129] RET, EXPR mp_add(a, b) [L129] r = mp_add(a, b) [L131] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.3s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3507 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3507 mSDsluCounter, 9193 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7296 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5668 IncrementalHoareTripleChecker+Invalid, 5922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 1897 mSDtfsCounter, 5668 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1336 GetRequests, 1014 SyntacticMatches, 6 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4170 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1720occurred in iteration=20, InterpolantAutomatonStates: 262, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 10776 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1727 NumberOfCodeBlocks, 1727 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1984 ConstructedInterpolants, 0 QuantifiedInterpolants, 11731 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1884 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 36 InterpolantComputations, 15 PerfectInterpolantSequences, 1103/1917 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 could not prove your program: unable to determine feasibility of some traces [2025-01-08 22:46:59,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/byte_add_2-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:47:00,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:47:01,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-08 22:47:01,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:47:01,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:47:01,053 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:47:01,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:47:01,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:47:01,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:47:01,054 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:47:01,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:47:01,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:47:01,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:47:01,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:47:01,054 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:47:01,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:47:01,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:47:01,054 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:47:01,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:47:01,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:47:01,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:47:01,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:47:01,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:47:01,055 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-08 22:47:01,055 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-08 22:47:01,055 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-08 22:47:01,055 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:47:01,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:47:01,055 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:47:01,055 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:47:01,055 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:47:01,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:47:01,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:47:01,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:47:01,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:47:01,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:47:01,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:47:01,058 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:47:01,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:47:01,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:47:01,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:47:01,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:47:01,058 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:47:01,058 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:47:01,058 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-08 22:47:01,058 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-08 22:47:01,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:47:01,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:47:01,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:47:01,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:47:01,059 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 -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2025-01-08 22:47:01,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:47:01,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:47:01,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:47:01,324 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:47:01,324 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:47:01,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2025-01-08 22:47:02,491 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c63dcbb3f/ffab61f4f94044e8a3b4451a57ed3882/FLAGb0b52f3d6 [2025-01-08 22:47:02,630 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:47:02,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2025-01-08 22:47:02,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c63dcbb3f/ffab61f4f94044e8a3b4451a57ed3882/FLAGb0b52f3d6 [2025-01-08 22:47:02,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c63dcbb3f/ffab61f4f94044e8a3b4451a57ed3882 [2025-01-08 22:47:02,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:47:02,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:47:02,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:47:02,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:47:02,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:47:02,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:47:02" (1/1) ... [2025-01-08 22:47:02,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13974079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:02, skipping insertion in model container [2025-01-08 22:47:02,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:47:02" (1/1) ... [2025-01-08 22:47:02,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:47:02,780 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/bitvector/byte_add_2-2.i[1168,1181] [2025-01-08 22:47:02,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:47:02,829 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:47:02,839 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/bitvector/byte_add_2-2.i[1168,1181] [2025-01-08 22:47:02,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:47:02,879 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:47:02,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:02 WrapperNode [2025-01-08 22:47:02,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:47:02,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:47:02,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:47:02,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:47:02,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:02" (1/1) ... [2025-01-08 22:47:02,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:02" (1/1) ... [2025-01-08 22:47:02,911 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2025-01-08 22:47:02,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:47:02,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:47:02,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:47:02,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:47:02,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:02" (1/1) ... [2025-01-08 22:47:02,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:02" (1/1) ... [2025-01-08 22:47:02,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:02" (1/1) ... [2025-01-08 22:47:02,931 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-08 22:47:02,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:02" (1/1) ... [2025-01-08 22:47:02,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:02" (1/1) ... [2025-01-08 22:47:02,936 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:02" (1/1) ... [2025-01-08 22:47:02,941 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:02" (1/1) ... [2025-01-08 22:47:02,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:02" (1/1) ... [2025-01-08 22:47:02,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:02" (1/1) ... [2025-01-08 22:47:02,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:02" (1/1) ... [2025-01-08 22:47:02,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:47:02,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:47:02,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:47:02,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:47:02,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:02" (1/1) ... [2025-01-08 22:47:02,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:47:02,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:02,969 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-08 22:47:02,972 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-08 22:47:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:47:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-08 22:47:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:47:02,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:47:03,034 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:47:03,035 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:47:03,226 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-08 22:47:03,227 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:47:03,235 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:47:03,235 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:47:03,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:47:03 BoogieIcfgContainer [2025-01-08 22:47:03,235 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:47:03,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:47:03,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:47:03,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:47:03,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:47:02" (1/3) ... [2025-01-08 22:47:03,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4b4a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:47:03, skipping insertion in model container [2025-01-08 22:47:03,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:02" (2/3) ... [2025-01-08 22:47:03,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4b4a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:47:03, skipping insertion in model container [2025-01-08 22:47:03,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:47:03" (3/3) ... [2025-01-08 22:47:03,244 INFO L128 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2025-01-08 22:47:03,254 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:47:03,256 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG byte_add_2-2.i that has 1 procedures, 41 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-08 22:47:03,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:47:03,308 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;@1743dc2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:47:03,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:47:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-08 22:47:03,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:03,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:03,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:03,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1659265626, now seen corresponding path program 1 times [2025-01-08 22:47:03,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:03,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [351853416] [2025-01-08 22:47:03,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:03,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:03,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:03,355 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-08 22:47:03,357 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-08 22:47:03,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-08 22:47:03,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-08 22:47:03,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:03,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:03,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:47:03,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:03,463 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-08 22:47:03,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:03,464 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:03,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351853416] [2025-01-08 22:47:03,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351853416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:03,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:03,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:47:03,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829398368] [2025-01-08 22:47:03,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:03,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:47:03,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:03,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:47:03,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:47:03,488 INFO L87 Difference]: Start difference. First operand has 41 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:03,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:03,614 INFO L93 Difference]: Finished difference Result 95 states and 164 transitions. [2025-01-08 22:47:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:47:03,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-08 22:47:03,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:03,622 INFO L225 Difference]: With dead ends: 95 [2025-01-08 22:47:03,622 INFO L226 Difference]: Without dead ends: 60 [2025-01-08 22:47:03,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:47:03,626 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:03,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 64 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-08 22:47:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-01-08 22:47:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.543859649122807) internal successors, (88), 57 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions. [2025-01-08 22:47:03,652 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 88 transitions. Word has length 11 [2025-01-08 22:47:03,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:03,653 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 88 transitions. [2025-01-08 22:47:03,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 88 transitions. [2025-01-08 22:47:03,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-08 22:47:03,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:03,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:03,659 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-08 22:47:03,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:03,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:03,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:03,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1808952529, now seen corresponding path program 1 times [2025-01-08 22:47:03,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:03,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [412085173] [2025-01-08 22:47:03,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:03,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:03,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:03,857 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-08 22:47:03,858 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-08 22:47:03,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-08 22:47:03,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-08 22:47:03,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:03,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:03,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:47:03,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:03,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:03,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:03,932 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:03,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412085173] [2025-01-08 22:47:03,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412085173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:03,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:03,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:47:03,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668744301] [2025-01-08 22:47:03,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:03,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:47:03,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:03,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:47:03,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:47:03,933 INFO L87 Difference]: Start difference. First operand 58 states and 88 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:04,051 INFO L93 Difference]: Finished difference Result 157 states and 245 transitions. [2025-01-08 22:47:04,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:47:04,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-08 22:47:04,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:04,052 INFO L225 Difference]: With dead ends: 157 [2025-01-08 22:47:04,052 INFO L226 Difference]: Without dead ends: 108 [2025-01-08 22:47:04,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:47:04,052 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 55 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:04,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 147 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:04,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-08 22:47:04,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2025-01-08 22:47:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.5242718446601942) internal successors, (157), 103 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 157 transitions. [2025-01-08 22:47:04,060 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 157 transitions. Word has length 17 [2025-01-08 22:47:04,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:04,060 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 157 transitions. [2025-01-08 22:47:04,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 157 transitions. [2025-01-08 22:47:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-08 22:47:04,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:04,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:04,067 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-08 22:47:04,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:04,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:04,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:04,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1386085553, now seen corresponding path program 1 times [2025-01-08 22:47:04,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:04,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1582895769] [2025-01-08 22:47:04,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:04,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:04,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:04,267 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-08 22:47:04,273 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-08 22:47:04,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-08 22:47:04,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-08 22:47:04,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:04,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:04,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:47:04,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:04,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:04,333 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:04,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582895769] [2025-01-08 22:47:04,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582895769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:04,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:04,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:47:04,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880498136] [2025-01-08 22:47:04,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:04,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:47:04,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:04,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:47:04,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:47:04,334 INFO L87 Difference]: Start difference. First operand 104 states and 157 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:04,459 INFO L93 Difference]: Finished difference Result 285 states and 434 transitions. [2025-01-08 22:47:04,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:47:04,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-08 22:47:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:04,460 INFO L225 Difference]: With dead ends: 285 [2025-01-08 22:47:04,460 INFO L226 Difference]: Without dead ends: 198 [2025-01-08 22:47:04,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:47:04,461 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 41 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:04,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 145 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-08 22:47:04,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 181. [2025-01-08 22:47:04,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.511111111111111) internal successors, (272), 180 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 272 transitions. [2025-01-08 22:47:04,475 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 272 transitions. Word has length 18 [2025-01-08 22:47:04,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:04,475 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 272 transitions. [2025-01-08 22:47:04,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 272 transitions. [2025-01-08 22:47:04,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-08 22:47:04,475 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:04,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:04,483 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-08 22:47:04,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:04,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:04,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:04,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1894204574, now seen corresponding path program 1 times [2025-01-08 22:47:04,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:04,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1811306918] [2025-01-08 22:47:04,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:04,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:04,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:04,678 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-08 22:47:04,680 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-08 22:47:04,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:47:04,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:47:04,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:04,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:04,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 22:47:04,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:47:04,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:04,729 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:04,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811306918] [2025-01-08 22:47:04,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811306918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:04,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:04,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:47:04,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081775608] [2025-01-08 22:47:04,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:04,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:47:04,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:04,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:47:04,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:47:04,730 INFO L87 Difference]: Start difference. First operand 181 states and 272 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:04,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:04,736 INFO L93 Difference]: Finished difference Result 186 states and 276 transitions. [2025-01-08 22:47:04,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:47:04,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-08 22:47:04,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:04,737 INFO L225 Difference]: With dead ends: 186 [2025-01-08 22:47:04,737 INFO L226 Difference]: Without dead ends: 91 [2025-01-08 22:47:04,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:47:04,738 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 40 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:04,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:47:04,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-08 22:47:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-08 22:47:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 90 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2025-01-08 22:47:04,744 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 19 [2025-01-08 22:47:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:04,744 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2025-01-08 22:47:04,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2025-01-08 22:47:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:47:04,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:04,744 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:04,757 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-08 22:47:04,948 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 [2025-01-08 22:47:04,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:04,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1777837642, now seen corresponding path program 1 times [2025-01-08 22:47:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:04,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1858960895] [2025-01-08 22:47:04,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:04,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:04,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:04,951 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-08 22:47:04,952 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-08 22:47:04,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:47:04,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:47:04,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:04,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:04,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:47:04,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:05,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:05,005 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:05,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858960895] [2025-01-08 22:47:05,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858960895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:05,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:05,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:47:05,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788853891] [2025-01-08 22:47:05,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:05,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:47:05,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:05,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:47:05,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:47:05,006 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:05,019 INFO L93 Difference]: Finished difference Result 118 states and 167 transitions. [2025-01-08 22:47:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:47:05,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-08 22:47:05,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:05,020 INFO L225 Difference]: With dead ends: 118 [2025-01-08 22:47:05,020 INFO L226 Difference]: Without dead ends: 113 [2025-01-08 22:47:05,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:47:05,021 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:05,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:47:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-08 22:47:05,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-08 22:47:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.4375) internal successors, (161), 112 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-01-08 22:47:05,034 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 25 [2025-01-08 22:47:05,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:05,035 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-01-08 22:47:05,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:05,035 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-01-08 22:47:05,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:47:05,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:05,035 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:05,041 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-08 22:47:05,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:05,240 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:05,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:05,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1816065076, now seen corresponding path program 1 times [2025-01-08 22:47:05,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:05,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [420087211] [2025-01-08 22:47:05,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:05,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:05,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:05,242 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-08 22:47:05,244 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-08 22:47:05,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:47:05,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:47:05,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:05,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:05,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:47:05,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:05,312 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:05,312 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:05,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420087211] [2025-01-08 22:47:05,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420087211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:05,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:05,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:47:05,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825290213] [2025-01-08 22:47:05,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:05,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:47:05,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:05,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:47:05,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:47:05,313 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:05,399 INFO L93 Difference]: Finished difference Result 218 states and 310 transitions. [2025-01-08 22:47:05,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:47:05,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-08 22:47:05,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:05,400 INFO L225 Difference]: With dead ends: 218 [2025-01-08 22:47:05,400 INFO L226 Difference]: Without dead ends: 170 [2025-01-08 22:47:05,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:47:05,401 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 101 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:05,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 204 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-08 22:47:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 118. [2025-01-08 22:47:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.4188034188034189) internal successors, (166), 117 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2025-01-08 22:47:05,406 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 25 [2025-01-08 22:47:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:05,406 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2025-01-08 22:47:05,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2025-01-08 22:47:05,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:47:05,407 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:05,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:05,413 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-08 22:47:05,607 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 [2025-01-08 22:47:05,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:05,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:05,608 INFO L85 PathProgramCache]: Analyzing trace with hash 93730485, now seen corresponding path program 1 times [2025-01-08 22:47:05,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:05,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521665689] [2025-01-08 22:47:05,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:05,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:05,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:05,610 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-08 22:47:05,611 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-08 22:47:05,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:47:05,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:47:05,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:05,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:05,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:47:05,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:05,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:05,687 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:05,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521665689] [2025-01-08 22:47:05,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521665689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:05,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:05,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-08 22:47:05,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028822963] [2025-01-08 22:47:05,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:05,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:47:05,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:05,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:47:05,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:47:05,689 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:05,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:05,893 INFO L93 Difference]: Finished difference Result 264 states and 375 transitions. [2025-01-08 22:47:05,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:47:05,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-08 22:47:05,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:05,894 INFO L225 Difference]: With dead ends: 264 [2025-01-08 22:47:05,894 INFO L226 Difference]: Without dead ends: 216 [2025-01-08 22:47:05,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:47:05,895 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 146 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:05,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 496 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:47:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-08 22:47:05,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 163. [2025-01-08 22:47:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4135802469135803) internal successors, (229), 162 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 229 transitions. [2025-01-08 22:47:05,907 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 229 transitions. Word has length 26 [2025-01-08 22:47:05,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:05,907 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 229 transitions. [2025-01-08 22:47:05,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 229 transitions. [2025-01-08 22:47:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:47:05,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:05,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:05,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-08 22:47:06,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:06,109 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:06,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:06,109 INFO L85 PathProgramCache]: Analyzing trace with hash 312585203, now seen corresponding path program 1 times [2025-01-08 22:47:06,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:06,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543872421] [2025-01-08 22:47:06,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:06,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:06,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:06,111 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-08 22:47:06,112 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-08 22:47:06,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:47:06,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:47:06,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:06,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:06,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 22:47:06,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:06,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:06,184 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:06,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543872421] [2025-01-08 22:47:06,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543872421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:06,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:06,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:47:06,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969618436] [2025-01-08 22:47:06,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:06,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:47:06,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:06,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:47:06,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:47:06,185 INFO L87 Difference]: Start difference. First operand 163 states and 229 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:06,328 INFO L93 Difference]: Finished difference Result 263 states and 372 transitions. [2025-01-08 22:47:06,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:47:06,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-08 22:47:06,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:06,329 INFO L225 Difference]: With dead ends: 263 [2025-01-08 22:47:06,329 INFO L226 Difference]: Without dead ends: 215 [2025-01-08 22:47:06,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:47:06,329 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 118 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:06,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 297 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:06,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-01-08 22:47:06,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 158. [2025-01-08 22:47:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4203821656050954) internal successors, (223), 157 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions. [2025-01-08 22:47:06,334 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 26 [2025-01-08 22:47:06,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:06,335 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 223 transitions. [2025-01-08 22:47:06,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions. [2025-01-08 22:47:06,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:47:06,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:06,335 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:06,341 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-08 22:47:06,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:06,540 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:06,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:06,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1997773630, now seen corresponding path program 1 times [2025-01-08 22:47:06,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:06,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293041631] [2025-01-08 22:47:06,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:06,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:06,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:06,542 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-08 22:47:06,543 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-08 22:47:06,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:47:06,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:47:06,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:06,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:06,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:47:06,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:06,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:06,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:06,657 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293041631] [2025-01-08 22:47:06,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293041631] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:06,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:06,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-01-08 22:47:06,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776383266] [2025-01-08 22:47:06,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:06,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:47:06,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:06,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:47:06,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:47:06,658 INFO L87 Difference]: Start difference. First operand 158 states and 223 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:06,815 INFO L93 Difference]: Finished difference Result 602 states and 909 transitions. [2025-01-08 22:47:06,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:47:06,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-08 22:47:06,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:06,817 INFO L225 Difference]: With dead ends: 602 [2025-01-08 22:47:06,817 INFO L226 Difference]: Without dead ends: 444 [2025-01-08 22:47:06,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:47:06,817 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 114 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:06,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 60 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:06,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-01-08 22:47:06,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 334. [2025-01-08 22:47:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.4804804804804805) internal successors, (493), 333 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 493 transitions. [2025-01-08 22:47:06,827 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 493 transitions. Word has length 28 [2025-01-08 22:47:06,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:06,828 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 493 transitions. [2025-01-08 22:47:06,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 493 transitions. [2025-01-08 22:47:06,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-08 22:47:06,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:06,829 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:06,835 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-08 22:47:07,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:07,030 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:07,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:07,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1262820800, now seen corresponding path program 1 times [2025-01-08 22:47:07,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:07,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1173323069] [2025-01-08 22:47:07,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:07,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:07,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:07,034 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-08 22:47:07,035 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-08 22:47:07,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-08 22:47:07,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-08 22:47:07,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:07,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:07,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:47:07,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:47:07,110 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:07,110 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:07,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173323069] [2025-01-08 22:47:07,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173323069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:07,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:07,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:47:07,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201101123] [2025-01-08 22:47:07,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:07,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:47:07,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:07,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:47:07,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:47:07,111 INFO L87 Difference]: Start difference. First operand 334 states and 493 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:07,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:07,177 INFO L93 Difference]: Finished difference Result 904 states and 1335 transitions. [2025-01-08 22:47:07,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:47:07,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-08 22:47:07,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:07,179 INFO L225 Difference]: With dead ends: 904 [2025-01-08 22:47:07,179 INFO L226 Difference]: Without dead ends: 592 [2025-01-08 22:47:07,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 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-08 22:47:07,180 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 25 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:07,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 144 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:47:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-01-08 22:47:07,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 474. [2025-01-08 22:47:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 1.5052854122621564) internal successors, (712), 473 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 712 transitions. [2025-01-08 22:47:07,209 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 712 transitions. Word has length 64 [2025-01-08 22:47:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:07,210 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 712 transitions. [2025-01-08 22:47:07,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 712 transitions. [2025-01-08 22:47:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-08 22:47:07,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:07,211 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:07,217 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-08 22:47:07,411 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 [2025-01-08 22:47:07,411 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:07,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1396834306, now seen corresponding path program 2 times [2025-01-08 22:47:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:07,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [509805653] [2025-01-08 22:47:07,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:47:07,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:07,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:07,414 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-08 22:47:07,414 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-08 22:47:07,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-01-08 22:47:07,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-01-08 22:47:07,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:47:07,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:07,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:47:07,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:07,614 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:47:07,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 22 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:07,811 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:07,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509805653] [2025-01-08 22:47:07,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509805653] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:07,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:07,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2025-01-08 22:47:07,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975323271] [2025-01-08 22:47:07,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:07,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-08 22:47:07,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:07,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-08 22:47:07,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:47:07,812 INFO L87 Difference]: Start difference. First operand 474 states and 712 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:08,026 INFO L93 Difference]: Finished difference Result 1053 states and 1613 transitions. [2025-01-08 22:47:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-08 22:47:08,026 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-08 22:47:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:08,028 INFO L225 Difference]: With dead ends: 1053 [2025-01-08 22:47:08,028 INFO L226 Difference]: Without dead ends: 592 [2025-01-08 22:47:08,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:47:08,029 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 181 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:08,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 88 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:08,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-01-08 22:47:08,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 519. [2025-01-08 22:47:08,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 1.4015444015444016) internal successors, (726), 518 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 726 transitions. [2025-01-08 22:47:08,047 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 726 transitions. Word has length 64 [2025-01-08 22:47:08,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:08,047 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 726 transitions. [2025-01-08 22:47:08,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 726 transitions. [2025-01-08 22:47:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-08 22:47:08,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:08,048 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:08,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-08 22:47:08,251 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 [2025-01-08 22:47:08,251 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:08,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:08,251 INFO L85 PathProgramCache]: Analyzing trace with hash -566037006, now seen corresponding path program 1 times [2025-01-08 22:47:08,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:08,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1350324744] [2025-01-08 22:47:08,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:08,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:08,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:08,253 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-08 22:47:08,254 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-08 22:47:08,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-08 22:47:08,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-08 22:47:08,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:08,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:08,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:47:08,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-08 22:47:08,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-08 22:47:08,408 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:08,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350324744] [2025-01-08 22:47:08,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350324744] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:08,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:08,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-01-08 22:47:08,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222331068] [2025-01-08 22:47:08,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:08,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 22:47:08,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:08,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 22:47:08,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:47:08,409 INFO L87 Difference]: Start difference. First operand 519 states and 726 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:08,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:08,740 INFO L93 Difference]: Finished difference Result 1391 states and 1974 transitions. [2025-01-08 22:47:08,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-08 22:47:08,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-08 22:47:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:08,743 INFO L225 Difference]: With dead ends: 1391 [2025-01-08 22:47:08,743 INFO L226 Difference]: Without dead ends: 884 [2025-01-08 22:47:08,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:47:08,744 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 236 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:08,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 139 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:47:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-01-08 22:47:08,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 831. [2025-01-08 22:47:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 830 states have (on average 1.3240963855421686) internal successors, (1099), 830 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1099 transitions. [2025-01-08 22:47:08,769 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1099 transitions. Word has length 68 [2025-01-08 22:47:08,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:08,769 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1099 transitions. [2025-01-08 22:47:08,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1099 transitions. [2025-01-08 22:47:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-08 22:47:08,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:08,770 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:08,776 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-08 22:47:08,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:08,976 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:08,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:08,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1413254295, now seen corresponding path program 1 times [2025-01-08 22:47:08,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:08,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [916794534] [2025-01-08 22:47:08,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:08,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:08,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:08,979 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-08 22:47:08,980 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-08 22:47:09,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-08 22:47:09,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-08 22:47:09,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:09,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:09,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:47:09,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:47:09,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:47:09,166 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:09,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916794534] [2025-01-08 22:47:09,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916794534] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:09,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:09,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-08 22:47:09,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109523454] [2025-01-08 22:47:09,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:09,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:47:09,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:09,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:47:09,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:47:09,167 INFO L87 Difference]: Start difference. First operand 831 states and 1099 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:09,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:09,367 INFO L93 Difference]: Finished difference Result 1225 states and 1572 transitions. [2025-01-08 22:47:09,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-08 22:47:09,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-08 22:47:09,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:09,372 INFO L225 Difference]: With dead ends: 1225 [2025-01-08 22:47:09,372 INFO L226 Difference]: Without dead ends: 1067 [2025-01-08 22:47:09,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:47:09,372 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 180 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:09,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 233 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:09,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2025-01-08 22:47:09,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 831. [2025-01-08 22:47:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 830 states have (on average 1.3228915662650602) internal successors, (1098), 830 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1098 transitions. [2025-01-08 22:47:09,416 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1098 transitions. Word has length 69 [2025-01-08 22:47:09,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:09,416 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1098 transitions. [2025-01-08 22:47:09,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:09,416 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1098 transitions. [2025-01-08 22:47:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-08 22:47:09,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:09,418 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:09,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-08 22:47:09,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:09,618 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:09,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:09,619 INFO L85 PathProgramCache]: Analyzing trace with hash -753722773, now seen corresponding path program 2 times [2025-01-08 22:47:09,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:09,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1159795438] [2025-01-08 22:47:09,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:47:09,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:09,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:09,622 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-08 22:47:09,623 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-08 22:47:09,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-01-08 22:47:09,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-01-08 22:47:09,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:47:09,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:09,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:47:09,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:47:09,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:47:09,829 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:09,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159795438] [2025-01-08 22:47:09,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159795438] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:09,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:09,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2025-01-08 22:47:09,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023098583] [2025-01-08 22:47:09,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:09,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-08 22:47:09,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:09,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-08 22:47:09,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:47:09,831 INFO L87 Difference]: Start difference. First operand 831 states and 1098 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:10,044 INFO L93 Difference]: Finished difference Result 1805 states and 2323 transitions. [2025-01-08 22:47:10,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-08 22:47:10,044 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-08 22:47:10,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:10,047 INFO L225 Difference]: With dead ends: 1805 [2025-01-08 22:47:10,047 INFO L226 Difference]: Without dead ends: 1002 [2025-01-08 22:47:10,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:47:10,049 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 162 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:10,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 267 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:10,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-01-08 22:47:10,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 689. [2025-01-08 22:47:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.2906976744186047) internal successors, (888), 688 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 888 transitions. [2025-01-08 22:47:10,073 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 888 transitions. Word has length 69 [2025-01-08 22:47:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:10,074 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 888 transitions. [2025-01-08 22:47:10,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 888 transitions. [2025-01-08 22:47:10,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-08 22:47:10,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:10,075 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:10,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-08 22:47:10,275 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 [2025-01-08 22:47:10,276 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:10,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:10,276 INFO L85 PathProgramCache]: Analyzing trace with hash -887736279, now seen corresponding path program 3 times [2025-01-08 22:47:10,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:10,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1473712532] [2025-01-08 22:47:10,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:47:10,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:10,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:10,278 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-08 22:47:10,280 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-08 22:47:10,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 5 equivalence classes. [2025-01-08 22:47:10,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 69 of 69 statements. [2025-01-08 22:47:10,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-08 22:47:10,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:10,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-08 22:47:10,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:12,701 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:12,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:14,380 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:14,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473712532] [2025-01-08 22:47:14,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473712532] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:14,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:14,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2025-01-08 22:47:14,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391621807] [2025-01-08 22:47:14,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:14,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-08 22:47:14,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:14,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-08 22:47:14,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1832, Unknown=0, NotChecked=0, Total=1980 [2025-01-08 22:47:14,382 INFO L87 Difference]: Start difference. First operand 689 states and 888 transitions. Second operand has 45 states, 45 states have (on average 3.022222222222222) internal successors, (136), 45 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:22,550 INFO L93 Difference]: Finished difference Result 1228 states and 1541 transitions. [2025-01-08 22:47:22,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-01-08 22:47:22,551 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.022222222222222) internal successors, (136), 45 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-08 22:47:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:22,553 INFO L225 Difference]: With dead ends: 1228 [2025-01-08 22:47:22,554 INFO L226 Difference]: Without dead ends: 1115 [2025-01-08 22:47:22,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2212 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1937, Invalid=10495, Unknown=0, NotChecked=0, Total=12432 [2025-01-08 22:47:22,556 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 1358 mSDsluCounter, 5498 mSDsCounter, 0 mSdLazyCounter, 3578 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 5758 SdHoareTripleChecker+Invalid, 3659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 3578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:22,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 5758 Invalid, 3659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 3578 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 22:47:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-01-08 22:47:22,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 837. [2025-01-08 22:47:22,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2751196172248804) internal successors, (1066), 836 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1066 transitions. [2025-01-08 22:47:22,604 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1066 transitions. Word has length 69 [2025-01-08 22:47:22,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:22,605 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1066 transitions. [2025-01-08 22:47:22,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.022222222222222) internal successors, (136), 45 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:22,605 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1066 transitions. [2025-01-08 22:47:22,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-08 22:47:22,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:22,606 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:22,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-08 22:47:22,808 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 [2025-01-08 22:47:22,808 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:22,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:22,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1302025497, now seen corresponding path program 1 times [2025-01-08 22:47:22,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:22,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [602789643] [2025-01-08 22:47:22,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:22,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:22,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:22,811 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-08 22:47:22,812 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-08 22:47:22,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-08 22:47:22,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:47:22,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:22,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:22,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-08 22:47:22,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:25,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:27,229 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:27,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602789643] [2025-01-08 22:47:27,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602789643] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:27,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:27,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2025-01-08 22:47:27,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346312558] [2025-01-08 22:47:27,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:27,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-01-08 22:47:27,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:27,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-01-08 22:47:27,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2006, Unknown=0, NotChecked=0, Total=2162 [2025-01-08 22:47:27,231 INFO L87 Difference]: Start difference. First operand 837 states and 1066 transitions. Second operand has 47 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:59,648 INFO L93 Difference]: Finished difference Result 2825 states and 3507 transitions. [2025-01-08 22:47:59,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2025-01-08 22:47:59,649 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-08 22:47:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:59,654 INFO L225 Difference]: With dead ends: 2825 [2025-01-08 22:47:59,654 INFO L226 Difference]: Without dead ends: 2615 [2025-01-08 22:47:59,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18228 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=7334, Invalid=51472, Unknown=0, NotChecked=0, Total=58806 [2025-01-08 22:47:59,662 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 2012 mSDsluCounter, 10718 mSDsCounter, 0 mSdLazyCounter, 6834 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 11271 SdHoareTripleChecker+Invalid, 7186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 6834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:59,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2012 Valid, 11271 Invalid, 7186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 6834 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-08 22:47:59,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2615 states. [2025-01-08 22:47:59,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2615 to 1667. [2025-01-08 22:47:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1666 states have (on average 1.265906362545018) internal successors, (2109), 1666 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2109 transitions. [2025-01-08 22:47:59,741 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2109 transitions. Word has length 73 [2025-01-08 22:47:59,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:59,741 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2109 transitions. [2025-01-08 22:47:59,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:47:59,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2109 transitions. [2025-01-08 22:47:59,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-08 22:47:59,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:59,742 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:59,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-08 22:47:59,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:59,943 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:59,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:59,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1457391271, now seen corresponding path program 1 times [2025-01-08 22:47:59,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:59,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [741413186] [2025-01-08 22:47:59,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:59,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:59,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:59,946 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:59,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-08 22:47:59,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-08 22:47:59,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-08 22:47:59,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:59,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:59,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-08 22:47:59,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:02,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:03,942 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:03,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741413186] [2025-01-08 22:48:03,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741413186] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:03,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:03,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2025-01-08 22:48:03,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251173654] [2025-01-08 22:48:03,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:03,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-01-08 22:48:03,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:03,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-01-08 22:48:03,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2017, Unknown=0, NotChecked=0, Total=2162 [2025-01-08 22:48:03,943 INFO L87 Difference]: Start difference. First operand 1667 states and 2109 transitions. Second operand has 47 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)