./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/init-2-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/init-2-n-u.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 44b18e123610caaf6237dddd08dfbd765ad919d1168e6261239628431b3c22b1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:09:13,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:09:13,601 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 17:09:13,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:09:13,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:09:13,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:09:13,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:09:13,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:09:13,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:09:13,630 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:09:13,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:09:13,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:09:13,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:09:13,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:09:13,632 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:09:13,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:09:13,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:09:13,632 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:09:13,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:09:13,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:09:13,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:09:13,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:09:13,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:09:13,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:09:13,633 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:09:13,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:09:13,633 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:09:13,633 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:09:13,633 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:09:13,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:09:13,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:09:13,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:09:13,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:09:13,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:09:13,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:09:13,634 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:09:13,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:09:13,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:09:13,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:09:13,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:09:13,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:09:13,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:09:13,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:09:13,634 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 -> 44b18e123610caaf6237dddd08dfbd765ad919d1168e6261239628431b3c22b1 [2025-02-07 17:09:13,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:09:13,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:09:13,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:09:13,850 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:09:13,850 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:09:13,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/init-2-n-u.c [2025-02-07 17:09:14,989 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a5a46880/4e8cb40b5246475ebe6f0ab1d37bc4c7/FLAGe9d7dde81 [2025-02-07 17:09:15,212 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:09:15,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-2-n-u.c [2025-02-07 17:09:15,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a5a46880/4e8cb40b5246475ebe6f0ab1d37bc4c7/FLAGe9d7dde81 [2025-02-07 17:09:15,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a5a46880/4e8cb40b5246475ebe6f0ab1d37bc4c7 [2025-02-07 17:09:15,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:09:15,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:09:15,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:09:15,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:09:15,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:09:15,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:09:15" (1/1) ... [2025-02-07 17:09:15,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d30a14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:15, skipping insertion in model container [2025-02-07 17:09:15,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:09:15" (1/1) ... [2025-02-07 17:09:15,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:09:15,648 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-multidimensional/init-2-n-u.c[322,335] [2025-02-07 17:09:15,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:09:15,663 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:09:15,668 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-multidimensional/init-2-n-u.c[322,335] [2025-02-07 17:09:15,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:09:15,679 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:09:15,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:15 WrapperNode [2025-02-07 17:09:15,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:09:15,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:09:15,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:09:15,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:09:15,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:15" (1/1) ... [2025-02-07 17:09:15,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:15" (1/1) ... [2025-02-07 17:09:15,696 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2025-02-07 17:09:15,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:09:15,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:09:15,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:09:15,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:09:15,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:15" (1/1) ... [2025-02-07 17:09:15,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:15" (1/1) ... [2025-02-07 17:09:15,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:15" (1/1) ... [2025-02-07 17:09:15,707 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-07 17:09:15,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:15" (1/1) ... [2025-02-07 17:09:15,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:15" (1/1) ... [2025-02-07 17:09:15,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:15" (1/1) ... [2025-02-07 17:09:15,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:15" (1/1) ... [2025-02-07 17:09:15,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:15" (1/1) ... [2025-02-07 17:09:15,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:15" (1/1) ... [2025-02-07 17:09:15,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:09:15,713 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:09:15,713 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:09:15,713 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:09:15,713 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:15" (1/1) ... [2025-02-07 17:09:15,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:09:15,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:15,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 17:09:15,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 17:09:15,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:09:15,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:09:15,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 17:09:15,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 17:09:15,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 17:09:15,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 17:09:15,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:09:15,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:09:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 17:09:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 17:09:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 17:09:15,788 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:09:15,789 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:09:15,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: 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-07 17:09:15,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L40: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;main_~j~0#1 := 1 + main_~j~0#1; [2025-02-07 17:09:15,865 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-07 17:09:15,865 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:09:15,870 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:09:15,870 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:09:15,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:09:15 BoogieIcfgContainer [2025-02-07 17:09:15,870 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:09:15,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:09:15,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:09:15,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:09:15,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:09:15" (1/3) ... [2025-02-07 17:09:15,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19900e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:09:15, skipping insertion in model container [2025-02-07 17:09:15,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:15" (2/3) ... [2025-02-07 17:09:15,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19900e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:09:15, skipping insertion in model container [2025-02-07 17:09:15,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:09:15" (3/3) ... [2025-02-07 17:09:15,876 INFO L128 eAbstractionObserver]: Analyzing ICFG init-2-n-u.c [2025-02-07 17:09:15,885 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:09:15,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG init-2-n-u.c that has 1 procedures, 12 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-07 17:09:15,913 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:09:15,919 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;@34133381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:09:15,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:09:15,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 17:09:15,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:15,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 17:09:15,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:15,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:15,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1386573371, now seen corresponding path program 1 times [2025-02-07 17:09:15,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:15,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969031277] [2025-02-07 17:09:15,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:15,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 17:09:15,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 17:09:15,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:15,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:16,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:16,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969031277] [2025-02-07 17:09:16,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969031277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:16,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:16,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:09:16,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804321292] [2025-02-07 17:09:16,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:16,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:09:16,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:16,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:09:16,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:09:16,121 INFO L87 Difference]: Start difference. First operand has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:16,154 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2025-02-07 17:09:16,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:09:16,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-07 17:09:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:16,161 INFO L225 Difference]: With dead ends: 23 [2025-02-07 17:09:16,161 INFO L226 Difference]: Without dead ends: 10 [2025-02-07 17:09:16,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:09:16,166 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:16,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 15 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-07 17:09:16,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-02-07 17:09:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2025-02-07 17:09:16,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2025-02-07 17:09:16,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:16,187 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-02-07 17:09:16,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2025-02-07 17:09:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 17:09:16,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:16,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:16,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:09:16,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:16,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:16,190 INFO L85 PathProgramCache]: Analyzing trace with hash -516110595, now seen corresponding path program 1 times [2025-02-07 17:09:16,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:16,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097920569] [2025-02-07 17:09:16,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:16,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:16,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 17:09:16,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 17:09:16,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:16,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:16,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:16,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097920569] [2025-02-07 17:09:16,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097920569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:16,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:16,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:09:16,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759942168] [2025-02-07 17:09:16,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:16,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:09:16,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:16,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:09:16,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:09:16,282 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. 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-07 17:09:16,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:16,296 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-02-07 17:09:16,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:09:16,296 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-07 17:09:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:16,296 INFO L225 Difference]: With dead ends: 17 [2025-02-07 17:09:16,297 INFO L226 Difference]: Without dead ends: 10 [2025-02-07 17:09:16,297 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-07 17:09:16,297 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:16,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 9 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:16,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-07 17:09:16,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-02-07 17:09:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2025-02-07 17:09:16,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2025-02-07 17:09:16,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:16,300 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-02-07 17:09:16,300 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-07 17:09:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2025-02-07 17:09:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 17:09:16,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:16,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:16,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 17:09:16,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:16,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:16,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2097528844, now seen corresponding path program 1 times [2025-02-07 17:09:16,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:16,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476310678] [2025-02-07 17:09:16,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:16,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:16,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 17:09:16,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 17:09:16,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:16,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:16,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:16,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476310678] [2025-02-07 17:09:16,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476310678] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:09:16,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114933716] [2025-02-07 17:09:16,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:16,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:16,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:16,370 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:09:16,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 17:09:16,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 17:09:16,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 17:09:16,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:16,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:16,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 17:09:16,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:09:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:16,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:09:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:16,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114933716] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:09:16,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:09:16,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-07 17:09:16,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025808516] [2025-02-07 17:09:16,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:09:16,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 17:09:16,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:16,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 17:09:16,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-07 17:09:16,512 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:16,584 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2025-02-07 17:09:16,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 17:09:16,585 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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 9 [2025-02-07 17:09:16,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:16,585 INFO L225 Difference]: With dead ends: 21 [2025-02-07 17:09:16,585 INFO L226 Difference]: Without dead ends: 13 [2025-02-07 17:09:16,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 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-07 17:09:16,586 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:16,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 19 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-07 17:09:16,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-07 17:09:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-02-07 17:09:16,593 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2025-02-07 17:09:16,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:16,593 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-02-07 17:09:16,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2025-02-07 17:09:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 17:09:16,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:16,594 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:16,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 17:09:16,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:16,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:16,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:16,800 INFO L85 PathProgramCache]: Analyzing trace with hash 138023613, now seen corresponding path program 2 times [2025-02-07 17:09:16,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:16,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498937968] [2025-02-07 17:09:16,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:09:16,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:16,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-07 17:09:16,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 17:09:16,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:09:16,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 17:09:16,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:16,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498937968] [2025-02-07 17:09:16,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498937968] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:09:16,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545016621] [2025-02-07 17:09:16,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:09:16,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:16,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:16,962 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:09:16,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 17:09:17,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-07 17:09:17,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 17:09:17,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:09:17,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:17,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 17:09:17,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:09:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:17,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:09:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:17,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545016621] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:09:17,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:09:17,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 15 [2025-02-07 17:09:17,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281925899] [2025-02-07 17:09:17,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:09:17,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-07 17:09:17,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:17,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-07 17:09:17,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-02-07 17:09:17,208 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:17,616 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2025-02-07 17:09:17,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-07 17:09:17,617 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-07 17:09:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:17,617 INFO L225 Difference]: With dead ends: 53 [2025-02-07 17:09:17,617 INFO L226 Difference]: Without dead ends: 42 [2025-02-07 17:09:17,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2025-02-07 17:09:17,619 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 63 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:17,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 17 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-07 17:09:17,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2025-02-07 17:09:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2025-02-07 17:09:17,624 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 12 [2025-02-07 17:09:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:17,624 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2025-02-07 17:09:17,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2025-02-07 17:09:17,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-07 17:09:17,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:17,625 INFO L218 NwaCegarLoop]: trace histogram [20, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:17,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 17:09:17,829 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-07 17:09:17,829 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:17,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:17,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1414262655, now seen corresponding path program 3 times [2025-02-07 17:09:17,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:17,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199315301] [2025-02-07 17:09:17,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:09:17,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:17,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 13 equivalence classes. [2025-02-07 17:09:17,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 17:09:17,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-07 17:09:17,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-07 17:09:17,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:17,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199315301] [2025-02-07 17:09:17,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199315301] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:09:17,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878818893] [2025-02-07 17:09:17,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:09:17,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:17,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:17,971 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:09:17,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 17:09:18,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 13 equivalence classes. [2025-02-07 17:09:18,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 28 of 30 statements. [2025-02-07 17:09:18,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-02-07 17:09:18,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:18,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-02-07 17:09:18,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:09:18,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 17:09:18,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:18,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-07 17:09:18,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:18,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:18,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:18,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:09:18,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-02-07 17:09:18,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:18,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:18,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:18,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:18,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:18,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:18,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:09:18,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-02-07 17:09:19,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:09:19,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-02-07 17:09:19,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:19,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:09:19,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-02-07 17:09:24,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:24,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:09:24,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-02-07 17:09:33,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:33,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:09:33,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2025-02-07 17:09:42,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:42,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:09:42,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 84 treesize of output 104 [2025-02-07 17:10:05,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:05,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:10:05,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 93 treesize of output 116 [2025-02-07 17:10:25,662 WARN L249 Executor]: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-02-07 17:10:25,664 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-02-07 17:10:25,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-02-07 17:10:25,674 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-07 17:10:25,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:25,865 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:947) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2025-02-07 17:10:25,879 INFO L158 Benchmark]: Toolchain (without parser) took 70316.06ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 87.2MB in the end (delta: 27.1MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2025-02-07 17:10:25,880 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 17:10:25,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 117.80ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 103.3MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 17:10:25,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.13ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 102.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 17:10:25,880 INFO L158 Benchmark]: Boogie Preprocessor took 15.53ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 101.1MB in the end (delta: 904.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 17:10:25,881 INFO L158 Benchmark]: IcfgBuilder took 157.62ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 88.9MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 17:10:25,881 INFO L158 Benchmark]: TraceAbstraction took 70004.73ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 87.2MB in the end (delta: 1.3MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2025-02-07 17:10:25,882 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 117.80ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 103.3MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.13ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 102.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.53ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 101.1MB in the end (delta: 904.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 157.62ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 88.9MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 70004.73ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 87.2MB in the end (delta: 1.3MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/init-2-n-u.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44b18e123610caaf6237dddd08dfbd765ad919d1168e6261239628431b3c22b1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:10:27,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:10:27,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-07 17:10:27,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:10:27,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:10:27,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:10:27,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:10:27,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:10:27,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:10:27,617 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:10:27,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:10:27,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:10:27,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:10:27,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:10:27,618 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:10:27,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:10:27,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:10:27,618 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:10:27,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:10:27,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:10:27,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:10:27,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:10:27,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:10:27,618 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 17:10:27,618 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 17:10:27,618 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 17:10:27,618 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:10:27,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:10:27,618 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:10:27,618 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:10:27,619 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:10:27,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:10:27,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:10:27,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:10:27,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:10:27,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:10:27,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:10:27,619 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:10:27,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:10:27,619 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 17:10:27,619 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 17:10:27,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:10:27,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:10:27,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:10:27,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:10:27,619 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 -> 44b18e123610caaf6237dddd08dfbd765ad919d1168e6261239628431b3c22b1 [2025-02-07 17:10:27,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:10:27,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:10:27,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:10:27,835 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:10:27,836 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:10:27,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/init-2-n-u.c [2025-02-07 17:10:29,034 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21fa400bc/2cceaee6950c4c3bacd8629bb254dcb9/FLAG21a429f23 [2025-02-07 17:10:29,241 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:10:29,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-2-n-u.c [2025-02-07 17:10:29,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21fa400bc/2cceaee6950c4c3bacd8629bb254dcb9/FLAG21a429f23 [2025-02-07 17:10:29,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21fa400bc/2cceaee6950c4c3bacd8629bb254dcb9 [2025-02-07 17:10:29,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:10:29,268 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:10:29,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:10:29,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:10:29,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:10:29,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:10:29" (1/1) ... [2025-02-07 17:10:29,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e9e37d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:29, skipping insertion in model container [2025-02-07 17:10:29,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:10:29" (1/1) ... [2025-02-07 17:10:29,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:10:29,393 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-multidimensional/init-2-n-u.c[322,335] [2025-02-07 17:10:29,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:10:29,418 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:10:29,426 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-multidimensional/init-2-n-u.c[322,335] [2025-02-07 17:10:29,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:10:29,442 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:10:29,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:29 WrapperNode [2025-02-07 17:10:29,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:10:29,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:10:29,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:10:29,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:10:29,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:29" (1/1) ... [2025-02-07 17:10:29,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:29" (1/1) ... [2025-02-07 17:10:29,465 INFO L138 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2025-02-07 17:10:29,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:10:29,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:10:29,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:10:29,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:10:29,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:29" (1/1) ... [2025-02-07 17:10:29,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:29" (1/1) ... [2025-02-07 17:10:29,473 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:29" (1/1) ... [2025-02-07 17:10:29,483 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-07 17:10:29,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:29" (1/1) ... [2025-02-07 17:10:29,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:29" (1/1) ... [2025-02-07 17:10:29,488 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:29" (1/1) ... [2025-02-07 17:10:29,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:29" (1/1) ... [2025-02-07 17:10:29,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:29" (1/1) ... [2025-02-07 17:10:29,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:29" (1/1) ... [2025-02-07 17:10:29,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:10:29,497 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:10:29,497 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:10:29,497 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:10:29,499 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:29" (1/1) ... [2025-02-07 17:10:29,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:10:29,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:10:29,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 17:10:29,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 17:10:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:10:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 17:10:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 17:10:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 17:10:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-07 17:10:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-07 17:10:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:10:29,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:10:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 17:10:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-07 17:10:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-07 17:10:29,604 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:10:29,605 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:10:29,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: 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-07 17:10:29,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L40: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;main_~j~0#1 := ~bvadd~32(1bv32, main_~j~0#1); [2025-02-07 17:10:29,762 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-07 17:10:29,762 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:10:29,768 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:10:29,768 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:10:29,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:10:29 BoogieIcfgContainer [2025-02-07 17:10:29,769 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:10:29,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:10:29,770 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:10:29,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:10:29,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:10:29" (1/3) ... [2025-02-07 17:10:29,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa40e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:10:29, skipping insertion in model container [2025-02-07 17:10:29,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:29" (2/3) ... [2025-02-07 17:10:29,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa40e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:10:29, skipping insertion in model container [2025-02-07 17:10:29,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:10:29" (3/3) ... [2025-02-07 17:10:29,778 INFO L128 eAbstractionObserver]: Analyzing ICFG init-2-n-u.c [2025-02-07 17:10:29,787 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:10:29,789 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG init-2-n-u.c that has 1 procedures, 12 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-07 17:10:29,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:10:29,834 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;@7398d1a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:10:29,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:10:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 17:10:29,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:10:29,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 17:10:29,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:10:29,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:10:29,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1386573371, now seen corresponding path program 1 times [2025-02-07 17:10:29,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:10:29,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [217907190] [2025-02-07 17:10:29,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:10:29,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:29,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:10:29,862 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:10:29,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 17:10:29,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 17:10:29,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 17:10:29,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:10:29,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:29,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 17:10:29,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:10:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:10:29,994 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:10:29,994 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:10:29,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217907190] [2025-02-07 17:10:29,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217907190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:10:29,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:10:29,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:10:29,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568355550] [2025-02-07 17:10:29,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:10:29,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:10:29,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:10:30,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:10:30,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:10:30,038 INFO L87 Difference]: Start difference. First operand has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:30,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:10:30,104 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2025-02-07 17:10:30,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:10:30,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-07 17:10:30,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:10:30,110 INFO L225 Difference]: With dead ends: 23 [2025-02-07 17:10:30,110 INFO L226 Difference]: Without dead ends: 10 [2025-02-07 17:10:30,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:10:30,113 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:10:30,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 15 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:10:30,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-07 17:10:30,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-02-07 17:10:30,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2025-02-07 17:10:30,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2025-02-07 17:10:30,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:10:30,130 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-02-07 17:10:30,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2025-02-07 17:10:30,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 17:10:30,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:10:30,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:10:30,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 17:10:30,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:30,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:10:30,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:10:30,333 INFO L85 PathProgramCache]: Analyzing trace with hash -516110595, now seen corresponding path program 1 times [2025-02-07 17:10:30,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:10:30,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [688609588] [2025-02-07 17:10:30,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:10:30,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:30,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:10:30,337 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:10:30,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 17:10:30,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 17:10:30,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 17:10:30,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:10:30,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:30,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 17:10:30,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:10:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:10:30,414 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:10:30,414 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:10:30,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688609588] [2025-02-07 17:10:30,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688609588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:10:30,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:10:30,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:10:30,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17595791] [2025-02-07 17:10:30,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:10:30,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:10:30,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:10:30,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:10:30,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:10:30,415 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. 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-07 17:10:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:10:30,472 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-02-07 17:10:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:10:30,473 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-07 17:10:30,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:10:30,474 INFO L225 Difference]: With dead ends: 17 [2025-02-07 17:10:30,474 INFO L226 Difference]: Without dead ends: 10 [2025-02-07 17:10:30,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-07 17:10:30,474 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:10:30,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 9 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:10:30,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-07 17:10:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-02-07 17:10:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:30,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2025-02-07 17:10:30,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2025-02-07 17:10:30,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:10:30,478 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-02-07 17:10:30,478 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-07 17:10:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2025-02-07 17:10:30,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 17:10:30,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:10:30,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:10:30,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 17:10:30,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:30,679 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:10:30,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:10:30,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2097528844, now seen corresponding path program 1 times [2025-02-07 17:10:30,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:10:30,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [408830932] [2025-02-07 17:10:30,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:10:30,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:30,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:10:30,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:10:30,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 17:10:30,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 17:10:30,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 17:10:30,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:10:30,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:30,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 17:10:30,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:10:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:10:30,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:10:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:10:30,815 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:10:30,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408830932] [2025-02-07 17:10:30,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408830932] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:10:30,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:10:30,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-02-07 17:10:30,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085967588] [2025-02-07 17:10:30,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:10:30,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 17:10:30,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:10:30,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 17:10:30,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 17:10:30,817 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:30,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:10:30,887 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2025-02-07 17:10:30,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 17:10:30,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 9 [2025-02-07 17:10:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:10:30,889 INFO L225 Difference]: With dead ends: 24 [2025-02-07 17:10:30,889 INFO L226 Difference]: Without dead ends: 19 [2025-02-07 17:10:30,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-07 17:10:30,890 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:10:30,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 9 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:10:30,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-02-07 17:10:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-07 17:10:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-02-07 17:10:30,894 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2025-02-07 17:10:30,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:10:30,894 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-02-07 17:10:30,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-02-07 17:10:30,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 17:10:30,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:10:30,895 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-07 17:10:30,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 17:10:31,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:31,097 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:10:31,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:10:31,098 INFO L85 PathProgramCache]: Analyzing trace with hash -179508485, now seen corresponding path program 2 times [2025-02-07 17:10:31,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:10:31,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392634365] [2025-02-07 17:10:31,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:10:31,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:31,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:10:31,100 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:10:31,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 17:10:31,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-07 17:10:31,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 17:10:31,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:10:31,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:31,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 17:10:31,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:10:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-07 17:10:31,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:10:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-07 17:10:31,245 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:10:31,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392634365] [2025-02-07 17:10:31,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392634365] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:10:31,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:10:31,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-02-07 17:10:31,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436994619] [2025-02-07 17:10:31,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:10:31,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 17:10:31,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:10:31,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 17:10:31,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-07 17:10:31,246 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:10:31,332 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2025-02-07 17:10:31,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 17:10:31,333 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-07 17:10:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:10:31,334 INFO L225 Difference]: With dead ends: 46 [2025-02-07 17:10:31,334 INFO L226 Difference]: Without dead ends: 31 [2025-02-07 17:10:31,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-07 17:10:31,334 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:10:31,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 22 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:10:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-07 17:10:31,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-07 17:10:31,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-02-07 17:10:31,350 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 18 [2025-02-07 17:10:31,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:10:31,350 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-02-07 17:10:31,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:31,350 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-02-07 17:10:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-07 17:10:31,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:10:31,351 INFO L218 NwaCegarLoop]: trace histogram [16, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-07 17:10:31,363 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-07 17:10:31,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:31,552 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:10:31,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:10:31,552 INFO L85 PathProgramCache]: Analyzing trace with hash 799999811, now seen corresponding path program 3 times [2025-02-07 17:10:31,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:10:31,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1264697594] [2025-02-07 17:10:31,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:10:31,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:31,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:10:31,555 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:10:31,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 17:10:31,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 13 equivalence classes. [2025-02-07 17:10:31,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 18 of 30 statements. [2025-02-07 17:10:31,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-07 17:10:31,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:31,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 17:10:31,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:10:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 79 proven. 10 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-07 17:10:32,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:10:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-07 17:10:32,175 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:10:32,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264697594] [2025-02-07 17:10:32,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264697594] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:10:32,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:10:32,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-02-07 17:10:32,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271878495] [2025-02-07 17:10:32,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:10:32,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 17:10:32,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:10:32,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 17:10:32,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-02-07 17:10:32,176 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:32,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:10:32,419 INFO L93 Difference]: Finished difference Result 79 states and 110 transitions. [2025-02-07 17:10:32,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 17:10:32,422 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-07 17:10:32,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:10:32,423 INFO L225 Difference]: With dead ends: 79 [2025-02-07 17:10:32,423 INFO L226 Difference]: Without dead ends: 55 [2025-02-07 17:10:32,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2025-02-07 17:10:32,424 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:10:32,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 25 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:10:32,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-07 17:10:32,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-07 17:10:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 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-07 17:10:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2025-02-07 17:10:32,437 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 30 [2025-02-07 17:10:32,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:10:32,438 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2025-02-07 17:10:32,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:32,438 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2025-02-07 17:10:32,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-07 17:10:32,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:10:32,439 INFO L218 NwaCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-07 17:10:32,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-07 17:10:32,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:32,640 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:10:32,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:10:32,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1215044413, now seen corresponding path program 4 times [2025-02-07 17:10:32,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:10:32,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1327206579] [2025-02-07 17:10:32,641 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:10:32,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:32,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:10:32,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:10:32,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 17:10:32,698 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes.