./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-programs/partial_mod_count_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-programs/partial_mod_count_2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d98532a5d518c1ba99a39e0965faf5a69d8ad5bf82f7713684141895d3e8815 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:10:34,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:10:34,481 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:10:34,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:10:34,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:10:34,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:10:34,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:10:34,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:10:34,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:10:34,506 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:10:34,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:10:34,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:10:34,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:10:34,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:10:34,507 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:10:34,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:10:34,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:10:34,507 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:10:34,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:10:34,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:10:34,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:10:34,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:10:34,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:10:34,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:10:34,508 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:10:34,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:10:34,508 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:10:34,508 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:10:34,508 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:10:34,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:10:34,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:10:34,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:10:34,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:10:34,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:10:34,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:10:34,508 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:10:34,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:10:34,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:10:34,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:10:34,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:10:34,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:10:34,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:10:34,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:10:34,509 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 -> 5d98532a5d518c1ba99a39e0965faf5a69d8ad5bf82f7713684141895d3e8815 [2025-02-05 10:10:34,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:10:34,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:10:34,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:10:34,733 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:10:34,733 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:10:34,734 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-programs/partial_mod_count_2.c [2025-02-05 10:10:35,847 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8b4adcef/54f17aba8de44a54bd9ed087c3167baf/FLAG867086b79 [2025-02-05 10:10:36,090 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:10:36,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-programs/partial_mod_count_2.c [2025-02-05 10:10:36,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8b4adcef/54f17aba8de44a54bd9ed087c3167baf/FLAG867086b79 [2025-02-05 10:10:36,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8b4adcef/54f17aba8de44a54bd9ed087c3167baf [2025-02-05 10:10:36,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:10:36,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:10:36,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:10:36,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:10:36,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:10:36,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:10:36" (1/1) ... [2025-02-05 10:10:36,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c5f70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:10:36, skipping insertion in model container [2025-02-05 10:10:36,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:10:36" (1/1) ... [2025-02-05 10:10:36,124 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:10:36,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/array-programs/partial_mod_count_2.c[323,336] [2025-02-05 10:10:36,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:10:36,231 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:10:36,237 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/array-programs/partial_mod_count_2.c[323,336] [2025-02-05 10:10:36,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:10:36,249 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:10:36,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:10:36 WrapperNode [2025-02-05 10:10:36,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:10:36,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:10:36,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:10:36,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:10:36,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:10:36" (1/1) ... [2025-02-05 10:10:36,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:10:36" (1/1) ... [2025-02-05 10:10:36,272 INFO L138 Inliner]: procedures = 13, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 45 [2025-02-05 10:10:36,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:10:36,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:10:36,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:10:36,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:10:36,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:10:36" (1/1) ... [2025-02-05 10:10:36,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:10:36" (1/1) ... [2025-02-05 10:10:36,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:10:36" (1/1) ... [2025-02-05 10:10:36,290 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-05 10:10:36,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:10:36" (1/1) ... [2025-02-05 10:10:36,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:10:36" (1/1) ... [2025-02-05 10:10:36,292 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:10:36" (1/1) ... [2025-02-05 10:10:36,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:10:36" (1/1) ... [2025-02-05 10:10:36,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:10:36" (1/1) ... [2025-02-05 10:10:36,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:10:36" (1/1) ... [2025-02-05 10:10:36,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:10:36,298 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:10:36,299 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:10:36,299 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:10:36,299 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:10:36" (1/1) ... [2025-02-05 10:10:36,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:10:36,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:10:36,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:10:36,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:10:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:10:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:10:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:10:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:10:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:10:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:10:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:10:36,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:10:36,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:10:36,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:10:36,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:10:36,397 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:10:36,398 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:10:36,492 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-02-05 10:10:36,499 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-05 10:10:36,499 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:10:36,505 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:10:36,505 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:10:36,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:10:36 BoogieIcfgContainer [2025-02-05 10:10:36,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:10:36,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:10:36,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:10:36,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:10:36,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:10:36" (1/3) ... [2025-02-05 10:10:36,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80ffb67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:10:36, skipping insertion in model container [2025-02-05 10:10:36,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:10:36" (2/3) ... [2025-02-05 10:10:36,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80ffb67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:10:36, skipping insertion in model container [2025-02-05 10:10:36,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:10:36" (3/3) ... [2025-02-05 10:10:36,511 INFO L128 eAbstractionObserver]: Analyzing ICFG partial_mod_count_2.c [2025-02-05 10:10:36,521 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:10:36,522 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG partial_mod_count_2.c that has 1 procedures, 15 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 10:10:36,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:10:36,569 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;@5c8b94e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:10:36,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:10:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 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-02-05 10:10:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 10:10:36,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:10:36,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:10:36,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:10:36,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:10:36,582 INFO L85 PathProgramCache]: Analyzing trace with hash 419935901, now seen corresponding path program 1 times [2025-02-05 10:10:36,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:10:36,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649897748] [2025-02-05 10:10:36,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:10:36,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:10:36,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 10:10:36,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 10:10:36,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:10:36,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:10:36,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:10:36,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:10:36,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649897748] [2025-02-05 10:10:36,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649897748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:10:36,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:10:36,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:10:36,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461336033] [2025-02-05 10:10:36,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:10:36,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:10:36,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:10:36,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:10:36,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:10:36,807 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 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) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:10:36,872 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2025-02-05 10:10:36,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:10:36,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-02-05 10:10:36,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:10:36,878 INFO L225 Difference]: With dead ends: 38 [2025-02-05 10:10:36,879 INFO L226 Difference]: Without dead ends: 22 [2025-02-05 10:10:36,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:10:36,882 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:10:36,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 14 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:10:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-05 10:10:36,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2025-02-05 10:10:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2025-02-05 10:10:36,903 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 8 [2025-02-05 10:10:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:10:36,903 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-02-05 10:10:36,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2025-02-05 10:10:36,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 10:10:36,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:10:36,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:10:36,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:10:36,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:10:36,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:10:36,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1813573396, now seen corresponding path program 1 times [2025-02-05 10:10:36,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:10:36,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018792166] [2025-02-05 10:10:36,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:10:36,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:10:36,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 10:10:36,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 10:10:36,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:10:36,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:10:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:10:37,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:10:37,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018792166] [2025-02-05 10:10:37,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018792166] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:10:37,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484078805] [2025-02-05 10:10:37,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:10:37,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:10:37,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:10:37,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:10:37,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 10:10:37,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 10:10:37,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 10:10:37,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:10:37,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:10:37,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:10:37,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:10:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:10:37,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:10:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:10:37,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484078805] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:10:37,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:10:37,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-05 10:10:37,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403167002] [2025-02-05 10:10:37,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:10:37,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 10:10:37,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:10:37,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 10:10:37,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:10:37,192 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:10:37,295 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2025-02-05 10:10:37,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:10:37,296 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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-02-05 10:10:37,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:10:37,296 INFO L225 Difference]: With dead ends: 54 [2025-02-05 10:10:37,296 INFO L226 Difference]: Without dead ends: 44 [2025-02-05 10:10:37,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:10:37,297 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 105 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:10:37,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 31 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:10:37,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-05 10:10:37,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 22. [2025-02-05 10:10:37,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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-02-05 10:10:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-02-05 10:10:37,311 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 11 [2025-02-05 10:10:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:10:37,311 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-02-05 10:10:37,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-02-05 10:10:37,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 10:10:37,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:10:37,312 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:10:37,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 10:10:37,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:10:37,521 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:10:37,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:10:37,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1506026750, now seen corresponding path program 1 times [2025-02-05 10:10:37,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:10:37,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983021491] [2025-02-05 10:10:37,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:10:37,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:10:37,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 10:10:37,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:10:37,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:10:37,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:10:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 10:10:37,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:10:37,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983021491] [2025-02-05 10:10:37,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983021491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:10:37,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:10:37,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:10:37,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550575003] [2025-02-05 10:10:37,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:10:37,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:10:37,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:10:37,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:10:37,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:10:37,779 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:10:37,845 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-02-05 10:10:37,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:10:37,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-05 10:10:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:10:37,846 INFO L225 Difference]: With dead ends: 34 [2025-02-05 10:10:37,846 INFO L226 Difference]: Without dead ends: 32 [2025-02-05 10:10:37,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:10:37,847 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:10:37,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 18 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:10:37,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-05 10:10:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-05 10:10:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-02-05 10:10:37,855 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 20 [2025-02-05 10:10:37,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:10:37,855 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-02-05 10:10:37,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:37,856 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-02-05 10:10:37,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 10:10:37,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:10:37,856 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:10:37,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:10:37,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:10:37,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:10:37,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1925946415, now seen corresponding path program 1 times [2025-02-05 10:10:37,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:10:37,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424736885] [2025-02-05 10:10:37,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:10:37,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:10:37,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 10:10:37,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:10:37,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:10:37,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:10:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:10:38,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:10:38,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424736885] [2025-02-05 10:10:38,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424736885] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:10:38,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991055804] [2025-02-05 10:10:38,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:10:38,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:10:38,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:10:38,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:10:38,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 10:10:38,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 10:10:38,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:10:38,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:10:38,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:10:38,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 10:10:38,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:10:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:10:38,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:10:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:10:38,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991055804] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:10:38,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:10:38,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2025-02-05 10:10:38,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507133351] [2025-02-05 10:10:38,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:10:38,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 10:10:38,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:10:38,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 10:10:38,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2025-02-05 10:10:38,379 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:10:38,563 INFO L93 Difference]: Finished difference Result 219 states and 264 transitions. [2025-02-05 10:10:38,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 10:10:38,563 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 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-02-05 10:10:38,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:10:38,565 INFO L225 Difference]: With dead ends: 219 [2025-02-05 10:10:38,566 INFO L226 Difference]: Without dead ends: 197 [2025-02-05 10:10:38,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=315, Unknown=0, NotChecked=0, Total=506 [2025-02-05 10:10:38,567 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 269 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:10:38,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 61 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:10:38,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-05 10:10:38,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 50. [2025-02-05 10:10:38,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-02-05 10:10:38,578 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 25 [2025-02-05 10:10:38,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:10:38,578 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-02-05 10:10:38,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-02-05 10:10:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 10:10:38,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:10:38,579 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 6, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:10:38,588 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-02-05 10:10:38,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:10:38,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:10:38,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:10:38,780 INFO L85 PathProgramCache]: Analyzing trace with hash -703059696, now seen corresponding path program 2 times [2025-02-05 10:10:38,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:10:38,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768980391] [2025-02-05 10:10:38,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:10:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:10:38,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-02-05 10:10:38,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 10:10:38,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:10:38,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:10:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-05 10:10:39,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:10:39,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768980391] [2025-02-05 10:10:39,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768980391] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:10:39,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472607530] [2025-02-05 10:10:39,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:10:39,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:10:39,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:10:39,196 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:10:39,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 10:10:39,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-02-05 10:10:39,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 10:10:39,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:10:39,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:10:39,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 10:10:39,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:10:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:10:39,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:10:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:10:39,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472607530] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:10:39,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:10:39,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 13] total 29 [2025-02-05 10:10:39,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47588759] [2025-02-05 10:10:39,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:10:39,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 10:10:39,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:10:39,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 10:10:39,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=550, Unknown=0, NotChecked=0, Total=870 [2025-02-05 10:10:39,738 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 29 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-02-05 10:10:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:10:42,965 INFO L93 Difference]: Finished difference Result 574 states and 713 transitions. [2025-02-05 10:10:42,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2025-02-05 10:10:42,966 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 29 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) Word has length 43 [2025-02-05 10:10:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:10:42,968 INFO L225 Difference]: With dead ends: 574 [2025-02-05 10:10:42,968 INFO L226 Difference]: Without dead ends: 543 [2025-02-05 10:10:42,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13191 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=8379, Invalid=20691, Unknown=0, NotChecked=0, Total=29070 [2025-02-05 10:10:42,977 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 755 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:10:42,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 179 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:10:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-02-05 10:10:42,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 91. [2025-02-05 10:10:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 90 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2025-02-05 10:10:43,003 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 43 [2025-02-05 10:10:43,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:10:43,004 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2025-02-05 10:10:43,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 29 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-02-05 10:10:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2025-02-05 10:10:43,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 10:10:43,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:10:43,007 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 12, 10, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-02-05 10:10:43,013 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-02-05 10:10:43,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:10:43,211 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:10:43,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:10:43,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1130247741, now seen corresponding path program 3 times [2025-02-05 10:10:43,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:10:43,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813256872] [2025-02-05 10:10:43,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:10:43,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:10:43,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 84 statements into 23 equivalence classes. [2025-02-05 10:10:43,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 84 statements. [2025-02-05 10:10:43,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:10:43,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:10:43,470 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-02-05 10:10:43,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:10:43,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813256872] [2025-02-05 10:10:43,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813256872] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:10:43,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947641288] [2025-02-05 10:10:43,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:10:43,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:10:43,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:10:43,474 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:10:43,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 10:10:43,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 84 statements into 23 equivalence classes. [2025-02-05 10:10:43,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 84 statements. [2025-02-05 10:10:43,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:10:43,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:10:43,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 10:10:43,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:10:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-02-05 10:10:43,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:10:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-02-05 10:10:44,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947641288] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:10:44,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:10:44,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-02-05 10:10:44,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341800767] [2025-02-05 10:10:44,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:10:44,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 10:10:44,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:10:44,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 10:10:44,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:10:44,694 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 18 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:10:44,902 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2025-02-05 10:10:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 10:10:44,903 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 18 states have internal predecessors, (63), 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 84 [2025-02-05 10:10:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:10:44,904 INFO L225 Difference]: With dead ends: 118 [2025-02-05 10:10:44,904 INFO L226 Difference]: Without dead ends: 116 [2025-02-05 10:10:44,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=348, Invalid=644, Unknown=0, NotChecked=0, Total=992 [2025-02-05 10:10:44,905 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 107 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:10:44,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 46 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:10:44,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-05 10:10:44,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-05 10:10:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.191304347826087) internal successors, (137), 115 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 137 transitions. [2025-02-05 10:10:44,924 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 137 transitions. Word has length 84 [2025-02-05 10:10:44,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:10:44,924 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 137 transitions. [2025-02-05 10:10:44,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 18 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 137 transitions. [2025-02-05 10:10:44,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 10:10:44,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:10:44,927 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 12, 10, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1] [2025-02-05 10:10:44,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 10:10:45,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-05 10:10:45,128 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:10:45,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:10:45,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1772911984, now seen corresponding path program 4 times [2025-02-05 10:10:45,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:10:45,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761523782] [2025-02-05 10:10:45,128 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:10:45,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:10:45,153 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 109 statements into 2 equivalence classes. [2025-02-05 10:10:45,385 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 10:10:45,385 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:10:45,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:10:46,213 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 133 proven. 550 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-02-05 10:10:46,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:10:46,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761523782] [2025-02-05 10:10:46,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761523782] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:10:46,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363471639] [2025-02-05 10:10:46,214 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:10:46,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:10:46,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:10:46,215 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:10:46,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 10:10:46,264 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 109 statements into 2 equivalence classes. [2025-02-05 10:10:46,564 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 10:10:46,564 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:10:46,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:10:46,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 10:10:46,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:10:47,061 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-02-05 10:10:47,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:10:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-02-05 10:10:47,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363471639] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:10:47,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:10:47,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 25] total 70 [2025-02-05 10:10:47,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460728276] [2025-02-05 10:10:47,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:10:47,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-02-05 10:10:47,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:10:47,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-02-05 10:10:47,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1615, Invalid=3355, Unknown=0, NotChecked=0, Total=4970 [2025-02-05 10:10:47,731 INFO L87 Difference]: Start difference. First operand 116 states and 137 transitions. Second operand has 71 states, 71 states have (on average 3.0985915492957745) internal successors, (220), 70 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:49,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:10:49,395 INFO L93 Difference]: Finished difference Result 2850 states and 3438 transitions. [2025-02-05 10:10:49,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-02-05 10:10:49,396 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 3.0985915492957745) internal successors, (220), 70 states have internal predecessors, (220), 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 109 [2025-02-05 10:10:49,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:10:49,402 INFO L225 Difference]: With dead ends: 2850 [2025-02-05 10:10:49,402 INFO L226 Difference]: Without dead ends: 2771 [2025-02-05 10:10:49,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3726 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3820, Invalid=7310, Unknown=0, NotChecked=0, Total=11130 [2025-02-05 10:10:49,406 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2302 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2302 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:10:49,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2302 Valid, 297 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:10:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2025-02-05 10:10:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 224. [2025-02-05 10:10:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.2062780269058295) internal successors, (269), 223 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 269 transitions. [2025-02-05 10:10:49,450 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 269 transitions. Word has length 109 [2025-02-05 10:10:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:10:49,451 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 269 transitions. [2025-02-05 10:10:49,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 3.0985915492957745) internal successors, (220), 70 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:10:49,451 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 269 transitions. [2025-02-05 10:10:49,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-05 10:10:49,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:10:49,452 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 34, 24, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1] [2025-02-05 10:10:49,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:10:49,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:10:49,653 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:10:49,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:10:49,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1303212240, now seen corresponding path program 5 times [2025-02-05 10:10:49,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:10:49,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557369592] [2025-02-05 10:10:49,653 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:10:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:10:49,682 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 217 statements into 59 equivalence classes. [2025-02-05 10:10:52,752 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 59 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 10:10:52,753 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 59 check-sat command(s) [2025-02-05 10:10:52,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:10:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 5150 backedges. 1724 proven. 3293 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-02-05 10:10:56,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:10:56,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557369592] [2025-02-05 10:10:56,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557369592] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:10:56,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460572282] [2025-02-05 10:10:56,150 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:10:56,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:10:56,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:10:56,152 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:10:56,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 10:10:56,230 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 217 statements into 59 equivalence classes.