./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/init-non-constant-3-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-non-constant-3-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 df76811034b688387cfe28dd1eb6de91c21580662ac8ddb8163b41c1d6179172 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:09:40,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:09:40,670 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:40,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:09:40,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:09:40,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:09:40,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:09:40,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:09:40,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:09:40,697 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:09:40,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:09:40,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:09:40,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:09:40,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:09:40,697 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:09:40,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:09:40,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:09:40,697 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:09:40,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:09:40,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:09:40,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:09:40,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:09:40,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:09:40,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:09:40,698 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:09:40,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:09:40,698 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:09:40,698 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:09:40,698 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:09:40,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:09:40,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:09:40,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:09:40,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:09:40,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:09:40,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:09:40,698 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:09:40,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:09:40,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:09:40,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:09:40,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:09:40,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:09:40,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:09:40,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:09:40,702 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 -> df76811034b688387cfe28dd1eb6de91c21580662ac8ddb8163b41c1d6179172 [2025-02-07 17:09:40,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:09:40,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:09:40,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:09:40,916 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:09:40,916 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:09:40,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c [2025-02-07 17:09:41,987 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90a295a19/16a7f853385f42f68fb4af342e636be0/FLAG5667c31db [2025-02-07 17:09:42,231 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:09:42,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c [2025-02-07 17:09:42,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90a295a19/16a7f853385f42f68fb4af342e636be0/FLAG5667c31db [2025-02-07 17:09:42,568 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90a295a19/16a7f853385f42f68fb4af342e636be0 [2025-02-07 17:09:42,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:09:42,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:09:42,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:09:42,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:09:42,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:09:42,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:09:42" (1/1) ... [2025-02-07 17:09:42,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f57c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:42, skipping insertion in model container [2025-02-07 17:09:42,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:09:42" (1/1) ... [2025-02-07 17:09:42,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:09:42,656 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-non-constant-3-u.c[333,346] [2025-02-07 17:09:42,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:09:42,675 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:09:42,681 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-non-constant-3-u.c[333,346] [2025-02-07 17:09:42,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:09:42,692 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:09:42,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:42 WrapperNode [2025-02-07 17:09:42,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:09:42,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:09:42,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:09:42,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:09:42,697 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:42" (1/1) ... [2025-02-07 17:09:42,701 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:42" (1/1) ... [2025-02-07 17:09:42,709 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2025-02-07 17:09:42,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:09:42,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:09:42,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:09:42,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:09:42,713 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:42" (1/1) ... [2025-02-07 17:09:42,713 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:42" (1/1) ... [2025-02-07 17:09:42,714 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:42" (1/1) ... [2025-02-07 17:09:42,720 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:42,720 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:42" (1/1) ... [2025-02-07 17:09:42,720 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:42" (1/1) ... [2025-02-07 17:09:42,722 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:42" (1/1) ... [2025-02-07 17:09:42,722 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:42" (1/1) ... [2025-02-07 17:09:42,723 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:42" (1/1) ... [2025-02-07 17:09:42,723 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:42" (1/1) ... [2025-02-07 17:09:42,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:09:42,724 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:09:42,724 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:09:42,725 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:09:42,725 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:42" (1/1) ... [2025-02-07 17:09:42,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:09:42,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:42,747 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:42,748 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:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:09:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:09:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 17:09:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 17:09:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 17:09:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 17:09:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:09:42,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:09:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 17:09:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 17:09:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 17:09:42,812 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:09:42,817 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:09:42,917 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:42,917 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;main_~k~0#1 := 1 + main_~k~0#1; [2025-02-07 17:09:42,924 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-02-07 17:09:42,924 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:09:42,930 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:09:42,930 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:09:42,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:09:42 BoogieIcfgContainer [2025-02-07 17:09:42,930 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:09:42,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:09:42,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:09:42,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:09:42,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:09:42" (1/3) ... [2025-02-07 17:09:42,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7725a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:09:42, skipping insertion in model container [2025-02-07 17:09:42,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:42" (2/3) ... [2025-02-07 17:09:42,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7725a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:09:42, skipping insertion in model container [2025-02-07 17:09:42,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:09:42" (3/3) ... [2025-02-07 17:09:42,937 INFO L128 eAbstractionObserver]: Analyzing ICFG init-non-constant-3-u.c [2025-02-07 17:09:42,945 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:09:42,946 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG init-non-constant-3-u.c that has 1 procedures, 14 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-07 17:09:42,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:09:42,980 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;@2d586f9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:09:42,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:09:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 17:09:42,985 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:42,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:42,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:42,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:42,989 INFO L85 PathProgramCache]: Analyzing trace with hash -651683151, now seen corresponding path program 1 times [2025-02-07 17:09:42,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:42,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112346362] [2025-02-07 17:09:42,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:42,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:43,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 17:09:43,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 17:09:43,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:43,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:43,150 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:43,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:43,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112346362] [2025-02-07 17:09:43,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112346362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:43,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:43,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:09:43,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242244211] [2025-02-07 17:09:43,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:43,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:09:43,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:43,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:09:43,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:09:43,170 INFO L87 Difference]: Start difference. First operand has 14 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:43,209 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2025-02-07 17:09:43,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:09:43,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-02-07 17:09:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:43,215 INFO L225 Difference]: With dead ends: 27 [2025-02-07 17:09:43,215 INFO L226 Difference]: Without dead ends: 13 [2025-02-07 17:09:43,217 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:43,219 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:43,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 17 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-07 17:09:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2025-02-07 17:09:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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:43,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2025-02-07 17:09:43,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2025-02-07 17:09:43,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:43,245 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-02-07 17:09:43,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:43,246 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2025-02-07 17:09:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 17:09:43,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:43,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:43,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:09:43,246 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:43,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:43,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1538927827, now seen corresponding path program 1 times [2025-02-07 17:09:43,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:43,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919897739] [2025-02-07 17:09:43,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:43,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:43,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 17:09:43,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 17:09:43,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:43,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:43,343 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:43,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:43,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919897739] [2025-02-07 17:09:43,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919897739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:43,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:43,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:09:43,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188498206] [2025-02-07 17:09:43,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:43,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:09:43,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:43,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:09:43,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:09:43,345 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:43,385 INFO L93 Difference]: Finished difference Result 24 states and 36 transitions. [2025-02-07 17:09:43,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:09:43,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:43,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:43,386 INFO L225 Difference]: With dead ends: 24 [2025-02-07 17:09:43,386 INFO L226 Difference]: Without dead ends: 15 [2025-02-07 17:09:43,386 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:43,386 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:43,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 7 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-07 17:09:43,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2025-02-07 17:09:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-02-07 17:09:43,394 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 9 [2025-02-07 17:09:43,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:43,394 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-02-07 17:09:43,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:43,394 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2025-02-07 17:09:43,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 17:09:43,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:43,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:43,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 17:09:43,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:43,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:43,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1543429361, now seen corresponding path program 1 times [2025-02-07 17:09:43,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:43,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688677869] [2025-02-07 17:09:43,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:43,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:43,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 17:09:43,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 17:09:43,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:43,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:43,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:43,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688677869] [2025-02-07 17:09:43,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688677869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:43,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:43,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:09:43,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807797645] [2025-02-07 17:09:43,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:43,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:09:43,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:43,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:09:43,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:09:43,490 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:43,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:43,517 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2025-02-07 17:09:43,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:09:43,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 17:09:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:43,518 INFO L225 Difference]: With dead ends: 24 [2025-02-07 17:09:43,518 INFO L226 Difference]: Without dead ends: 13 [2025-02-07 17:09:43,518 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:43,519 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:43,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:43,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-07 17:09:43,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-07 17:09:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 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:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-02-07 17:09:43,524 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2025-02-07 17:09:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:43,524 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-02-07 17:09:43,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-02-07 17:09:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 17:09:43,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:43,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:43,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 17:09:43,525 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:43,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash 250774043, now seen corresponding path program 1 times [2025-02-07 17:09:43,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:43,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394937161] [2025-02-07 17:09:43,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:43,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:43,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 17:09:43,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 17:09:43,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:43,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:43,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:43,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394937161] [2025-02-07 17:09:43,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394937161] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:09:43,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624238937] [2025-02-07 17:09:43,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:43,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:43,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:43,619 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:43,623 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:43,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 17:09:43,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 17:09:43,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:43,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:43,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 17:09:43,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:09:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:43,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:09:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:43,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624238937] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:09:43,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:09:43,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-07 17:09:43,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526459201] [2025-02-07 17:09:43,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:09:43,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 17:09:43,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:43,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 17:09:43,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-07 17:09:43,746 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:43,796 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2025-02-07 17:09:43,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 17:09:43,796 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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:43,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:43,797 INFO L225 Difference]: With dead ends: 27 [2025-02-07 17:09:43,797 INFO L226 Difference]: Without dead ends: 16 [2025-02-07 17:09:43,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 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:43,798 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:43,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:43,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-07 17:09:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-07 17:09:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-02-07 17:09:43,801 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2025-02-07 17:09:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:43,801 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-02-07 17:09:43,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-02-07 17:09:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 17:09:43,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:43,802 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:43,810 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:44,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:44,002 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:44,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:44,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2065267185, now seen corresponding path program 2 times [2025-02-07 17:09:44,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:44,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572304100] [2025-02-07 17:09:44,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:09:44,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:44,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-07 17:09:44,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 17:09:44,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:09:44,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-07 17:09:44,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:44,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572304100] [2025-02-07 17:09:44,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572304100] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:09:44,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788948318] [2025-02-07 17:09:44,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:09:44,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:44,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:44,104 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:44,107 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:44,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-07 17:09:44,148 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 17:09:44,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:09:44,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:44,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 17:09:44,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:09:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:44,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:09:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:44,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788948318] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:09:44,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:09:44,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 15 [2025-02-07 17:09:44,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943448575] [2025-02-07 17:09:44,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:09:44,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-07 17:09:44,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:44,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-07 17:09:44,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2025-02-07 17:09:44,268 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 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:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:44,622 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2025-02-07 17:09:44,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-07 17:09:44,623 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-07 17:09:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:44,623 INFO L225 Difference]: With dead ends: 63 [2025-02-07 17:09:44,623 INFO L226 Difference]: Without dead ends: 49 [2025-02-07 17:09:44,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=629, Invalid=1093, Unknown=0, NotChecked=0, Total=1722 [2025-02-07 17:09:44,625 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 54 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:44,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 13 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:44,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-07 17:09:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2025-02-07 17:09:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-02-07 17:09:44,631 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 15 [2025-02-07 17:09:44,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:44,631 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-02-07 17:09:44,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 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:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-02-07 17:09:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 17:09:44,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:44,632 INFO L218 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:44,638 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:44,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:44,833 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:44,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:44,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1503044115, now seen corresponding path program 3 times [2025-02-07 17:09:44,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:44,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429098297] [2025-02-07 17:09:44,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:09:44,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:44,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 15 equivalence classes. [2025-02-07 17:09:44,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 33 of 35 statements. [2025-02-07 17:09:44,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-02-07 17:09:44,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 126 proven. 55 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-07 17:09:45,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:45,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429098297] [2025-02-07 17:09:45,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429098297] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:09:45,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081094379] [2025-02-07 17:09:45,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:09:45,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:45,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:45,151 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:45,153 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:45,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 15 equivalence classes. [2025-02-07 17:09:45,782 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 31 of 35 statements. [2025-02-07 17:09:45,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-07 17:09:45,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:45,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-02-07 17:09:45,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:09:45,859 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:45,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:45,910 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 27 treesize of output 11 [2025-02-07 17:09:45,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:45,960 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 27 treesize of output 11 [2025-02-07 17:09:46,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:46,024 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 27 treesize of output 11 [2025-02-07 17:09:46,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:46,076 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 27 treesize of output 11 [2025-02-07 17:09:46,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:46,125 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 27 treesize of output 11 [2025-02-07 17:09:46,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:46,167 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 27 treesize of output 11 [2025-02-07 17:09:46,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:46,213 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 27 treesize of output 11 [2025-02-07 17:09:46,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:46,261 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 27 treesize of output 11 [2025-02-07 17:09:46,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:46,304 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 27 treesize of output 11 [2025-02-07 17:09:46,364 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2025-02-07 17:09:46,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 22 [2025-02-07 17:09:46,435 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2025-02-07 17:09:46,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-02-07 17:09:46,509 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2025-02-07 17:09:46,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-02-07 17:09:46,576 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2025-02-07 17:09:46,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-02-07 17:09:46,625 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2025-02-07 17:09:46,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-02-07 17:09:46,678 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2025-02-07 17:09:46,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-02-07 17:09:46,735 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2025-02-07 17:09:46,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-02-07 17:09:46,788 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2025-02-07 17:09:46,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-02-07 17:09:46,839 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2025-02-07 17:09:46,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-02-07 17:09:46,895 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2025-02-07 17:09:46,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-02-07 17:09:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 36 proven. 202 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 17:09:47,103 INFO L312 TraceCheckSpWp]: Computing backward predicates...