./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:38:00,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:38:00,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:38:00,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:38:00,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:38:00,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:38:00,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:38:00,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:38:00,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:38:00,584 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:38:00,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:38:00,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:38:00,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:38:00,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:38:00,585 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:38:00,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:38:00,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:38:00,586 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:38:00,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:38:00,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:38:00,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:38:00,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:38:00,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:38:00,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:38:00,586 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:38:00,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:38:00,586 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:38:00,586 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:38:00,587 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:38:00,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:38:00,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:38:00,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:38:00,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:38:00,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:38:00,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:38:00,587 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:38:00,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:38:00,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:38:00,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:38:00,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:38:00,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:38:00,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:38:00,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:38:00,588 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/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 -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2025-03-03 14:38:00,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:38:00,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:38:00,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:38:00,827 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:38:00,827 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:38:00,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2025-03-03 14:38:01,914 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6a741c89/305fa83ea9ec47c4a13e5dac11655992/FLAG01290af5b [2025-03-03 14:38:02,103 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:38:02,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2025-03-03 14:38:02,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6a741c89/305fa83ea9ec47c4a13e5dac11655992/FLAG01290af5b [2025-03-03 14:38:02,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6a741c89/305fa83ea9ec47c4a13e5dac11655992 [2025-03-03 14:38:02,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:38:02,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:38:02,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:38:02,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:38:02,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:38:02,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:38:02" (1/1) ... [2025-03-03 14:38:02,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4110503e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:02, skipping insertion in model container [2025-03-03 14:38:02,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:38:02" (1/1) ... [2025-03-03 14:38:02,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:38:02,591 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c[1963,1976] [2025-03-03 14:38:02,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:38:02,600 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:38:02,614 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c[1963,1976] [2025-03-03 14:38:02,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:38:02,624 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:38:02,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:02 WrapperNode [2025-03-03 14:38:02,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:38:02,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:38:02,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:38:02,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:38:02,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:02" (1/1) ... [2025-03-03 14:38:02,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:02" (1/1) ... [2025-03-03 14:38:02,646 INFO L138 Inliner]: procedures = 14, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2025-03-03 14:38:02,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:38:02,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:38:02,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:38:02,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:38:02,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:02" (1/1) ... [2025-03-03 14:38:02,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:02" (1/1) ... [2025-03-03 14:38:02,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:02" (1/1) ... [2025-03-03 14:38:02,662 INFO L175 MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 6, 6, 6]. 30 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 1, 1, 1]. The 6 writes are split as follows [0, 2, 2, 2]. [2025-03-03 14:38:02,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:02" (1/1) ... [2025-03-03 14:38:02,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:02" (1/1) ... [2025-03-03 14:38:02,666 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:02" (1/1) ... [2025-03-03 14:38:02,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:02" (1/1) ... [2025-03-03 14:38:02,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:02" (1/1) ... [2025-03-03 14:38:02,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:02" (1/1) ... [2025-03-03 14:38:02,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:38:02,674 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:38:02,676 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:38:02,676 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:38:02,676 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:02" (1/1) ... [2025-03-03 14:38:02,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:38:02,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:02,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:38:02,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:38:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:38:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:38:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:38:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:38:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:38:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 14:38:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 14:38:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 14:38:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 14:38:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 14:38:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2025-03-03 14:38:02,713 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2025-03-03 14:38:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2025-03-03 14:38:02,713 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2025-03-03 14:38:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:38:02,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:38:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 14:38:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 14:38:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 14:38:02,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 14:38:02,714 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2025-03-03 14:38:02,714 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2025-03-03 14:38:02,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 14:38:02,770 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:38:02,771 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:38:02,871 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L81: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2025-03-03 14:38:02,899 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 14:38:02,899 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:38:02,908 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:38:02,908 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:38:02,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:38:02 BoogieIcfgContainer [2025-03-03 14:38:02,908 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:38:02,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:38:02,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:38:02,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:38:02,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:38:02" (1/3) ... [2025-03-03 14:38:02,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab11109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:38:02, skipping insertion in model container [2025-03-03 14:38:02,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:02" (2/3) ... [2025-03-03 14:38:02,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab11109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:38:02, skipping insertion in model container [2025-03-03 14:38:02,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:38:02" (3/3) ... [2025-03-03 14:38:02,916 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_3.c [2025-03-03 14:38:02,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:38:02,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_3.c that has 4 procedures, 33 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:38:02,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:38:02,974 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;@2c3f3dfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:38:02,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:38:02,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 14:38:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 14:38:02,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:02,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:02,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:02,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:02,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1062323027, now seen corresponding path program 1 times [2025-03-03 14:38:02,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:02,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337963910] [2025-03-03 14:38:02,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:02,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:03,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 14:38:03,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 14:38:03,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:03,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:38:03,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:03,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337963910] [2025-03-03 14:38:03,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337963910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:03,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:03,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:38:03,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891129375] [2025-03-03 14:38:03,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:03,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:38:03,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:03,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:38:03,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:38:03,372 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:38:03,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:03,497 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2025-03-03 14:38:03,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:38:03,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-03 14:38:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:03,502 INFO L225 Difference]: With dead ends: 46 [2025-03-03 14:38:03,502 INFO L226 Difference]: Without dead ends: 31 [2025-03-03 14:38:03,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:38:03,505 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:03,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 59 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:38:03,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-03 14:38:03,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-03 14:38:03,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-03 14:38:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-03-03 14:38:03,545 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 13 [2025-03-03 14:38:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:03,545 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-03-03 14:38:03,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:38:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-03-03 14:38:03,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 14:38:03,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:03,547 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:03,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:38:03,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:03,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:03,548 INFO L85 PathProgramCache]: Analyzing trace with hash -577732476, now seen corresponding path program 1 times [2025-03-03 14:38:03,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:03,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008032095] [2025-03-03 14:38:03,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:03,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:03,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 14:38:03,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 14:38:03,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:03,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:38:03,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:03,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008032095] [2025-03-03 14:38:03,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008032095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:03,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:03,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:38:03,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343856735] [2025-03-03 14:38:03,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:03,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:38:03,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:03,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:38:03,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:38:03,739 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 14:38:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:03,827 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2025-03-03 14:38:03,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:38:03,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2025-03-03 14:38:03,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:03,829 INFO L225 Difference]: With dead ends: 61 [2025-03-03 14:38:03,829 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 14:38:03,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:38:03,830 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:03,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 82 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:38:03,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 14:38:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-03 14:38:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-03 14:38:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-03-03 14:38:03,837 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 24 [2025-03-03 14:38:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:03,837 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-03-03 14:38:03,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 14:38:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-03-03 14:38:03,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 14:38:03,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:03,838 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:03,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:38:03,839 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:03,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:03,840 INFO L85 PathProgramCache]: Analyzing trace with hash 518623942, now seen corresponding path program 1 times [2025-03-03 14:38:03,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:03,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733387620] [2025-03-03 14:38:03,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:03,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:03,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 14:38:03,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 14:38:03,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:03,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:38:04,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:04,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733387620] [2025-03-03 14:38:04,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733387620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:04,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:04,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:38:04,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185545477] [2025-03-03 14:38:04,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:04,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:38:04,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:04,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:38:04,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:38:04,021 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 14:38:04,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:04,077 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2025-03-03 14:38:04,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:38:04,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2025-03-03 14:38:04,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:04,078 INFO L225 Difference]: With dead ends: 65 [2025-03-03 14:38:04,078 INFO L226 Difference]: Without dead ends: 35 [2025-03-03 14:38:04,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:38:04,079 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:04,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 96 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:38:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-03 14:38:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-03 14:38:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-03 14:38:04,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-03-03 14:38:04,085 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 35 [2025-03-03 14:38:04,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:04,085 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-03 14:38:04,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 14:38:04,086 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-03-03 14:38:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 14:38:04,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:04,086 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:04,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:38:04,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:04,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:04,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2023010309, now seen corresponding path program 1 times [2025-03-03 14:38:04,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:04,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809794496] [2025-03-03 14:38:04,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:04,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:04,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 14:38:04,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 14:38:04,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:04,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:38:04,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:04,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809794496] [2025-03-03 14:38:04,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809794496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:04,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433000794] [2025-03-03 14:38:04,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:04,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:04,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:04,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:38:04,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:38:04,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 14:38:04,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 14:38:04,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:04,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:04,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 14:38:04,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:04,544 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-03-03 14:38:04,606 WARN L873 $PredicateComparison]: unable to prove that (exists ((func_to_recursive_line_21_to_22_0_~a.offset Int)) (let ((.cse1 (select (select |c_#memory_int#3| |c_func_to_recursive_line_21_to_22_0_#in~a.base|) func_to_recursive_line_21_to_22_0_~a.offset)) (.cse0 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_21_to_22_0_#in~a.base|))) (and (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_21_to_22_0_#in~a.base| (store .cse0 func_to_recursive_line_21_to_22_0_~a.offset .cse1)) |c_#memory_int#3|) (<= .cse1 (+ (select .cse0 func_to_recursive_line_21_to_22_0_~a.offset) 1))))) is different from true [2025-03-03 14:38:04,664 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-03-03 14:38:04,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 32 [2025-03-03 14:38:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2025-03-03 14:38:04,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:04,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433000794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:04,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:38:04,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2025-03-03 14:38:04,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487956355] [2025-03-03 14:38:04,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:04,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 14:38:04,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:04,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 14:38:04,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2025-03-03 14:38:04,963 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 15 states, 12 states have (on average 3.5) internal successors, (42), 13 states have internal predecessors, (42), 7 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-03 14:38:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:05,217 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2025-03-03 14:38:05,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:38:05,217 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.5) internal successors, (42), 13 states have internal predecessors, (42), 7 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) Word has length 40 [2025-03-03 14:38:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:05,218 INFO L225 Difference]: With dead ends: 79 [2025-03-03 14:38:05,218 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 14:38:05,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=423, Unknown=1, NotChecked=42, Total=552 [2025-03-03 14:38:05,219 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:05,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 109 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 218 Invalid, 0 Unknown, 116 Unchecked, 0.1s Time] [2025-03-03 14:38:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 14:38:05,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-03-03 14:38:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-03 14:38:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-03-03 14:38:05,234 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 40 [2025-03-03 14:38:05,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:05,234 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-03-03 14:38:05,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.5) internal successors, (42), 13 states have internal predecessors, (42), 7 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-03 14:38:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-03-03 14:38:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 14:38:05,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:05,237 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:05,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:38:05,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:05,437 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:05,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:05,438 INFO L85 PathProgramCache]: Analyzing trace with hash -955186197, now seen corresponding path program 1 times [2025-03-03 14:38:05,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:05,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609979503] [2025-03-03 14:38:05,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:05,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:05,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 14:38:05,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 14:38:05,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:05,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:38:05,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:05,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609979503] [2025-03-03 14:38:05,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609979503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:05,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:05,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:38:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507642483] [2025-03-03 14:38:05,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:05,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:38:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:05,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:38:05,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:38:05,506 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 14:38:05,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:05,527 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-03-03 14:38:05,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:38:05,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2025-03-03 14:38:05,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:05,531 INFO L225 Difference]: With dead ends: 49 [2025-03-03 14:38:05,531 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 14:38:05,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:38:05,531 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:05,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:38:05,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 14:38:05,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2025-03-03 14:38:05,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-03 14:38:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-03-03 14:38:05,541 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 45 [2025-03-03 14:38:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:05,541 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-03-03 14:38:05,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 14:38:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-03-03 14:38:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 14:38:05,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:05,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:05,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:38:05,542 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:05,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:05,542 INFO L85 PathProgramCache]: Analyzing trace with hash -955185236, now seen corresponding path program 1 times [2025-03-03 14:38:05,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:05,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703643325] [2025-03-03 14:38:05,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:05,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:05,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 14:38:05,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 14:38:05,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:05,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:38:05,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:05,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703643325] [2025-03-03 14:38:05,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703643325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:05,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651558167] [2025-03-03 14:38:05,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:05,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:05,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:05,959 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:38:05,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:38:06,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 14:38:06,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 14:38:06,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:06,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:06,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 14:38:06,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:06,037 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-03-03 14:38:06,186 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:38:06,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:38:06,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651558167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:06,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:06,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 27 [2025-03-03 14:38:06,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859357188] [2025-03-03 14:38:06,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:06,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 14:38:06,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:06,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 14:38:06,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:38:06,627 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 27 states, 20 states have (on average 2.55) internal successors, (51), 23 states have internal predecessors, (51), 11 states have call successors, (15), 6 states have call predecessors, (15), 9 states have return successors, (15), 8 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-03 14:38:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:06,976 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2025-03-03 14:38:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:38:06,976 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 20 states have (on average 2.55) internal successors, (51), 23 states have internal predecessors, (51), 11 states have call successors, (15), 6 states have call predecessors, (15), 9 states have return successors, (15), 8 states have call predecessors, (15), 11 states have call successors, (15) Word has length 45 [2025-03-03 14:38:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:06,977 INFO L225 Difference]: With dead ends: 89 [2025-03-03 14:38:06,977 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 14:38:06,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=1198, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 14:38:06,979 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 48 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:06,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 254 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:38:06,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 14:38:06,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 14:38:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 6 states have call successors, (6), 4 states have call predecessors, (6), 10 states have return successors, (14), 11 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-03 14:38:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-03-03 14:38:06,989 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 45 [2025-03-03 14:38:06,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:06,991 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-03-03 14:38:06,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 20 states have (on average 2.55) internal successors, (51), 23 states have internal predecessors, (51), 11 states have call successors, (15), 6 states have call predecessors, (15), 9 states have return successors, (15), 8 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-03 14:38:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-03-03 14:38:06,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:38:06,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:06,992 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:07,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:38:07,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 14:38:07,196 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:07,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:07,196 INFO L85 PathProgramCache]: Analyzing trace with hash -417065904, now seen corresponding path program 2 times [2025-03-03 14:38:07,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:07,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005369037] [2025-03-03 14:38:07,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:07,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:07,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-03 14:38:07,217 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:38:07,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:07,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 10 proven. 91 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 14:38:07,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:07,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005369037] [2025-03-03 14:38:07,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005369037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:07,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984248377] [2025-03-03 14:38:07,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:07,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:07,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:07,724 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:38:07,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:38:07,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-03 14:38:07,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:38:07,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:07,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:07,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 14:38:07,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:07,820 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 15 treesize of output 1 [2025-03-03 14:38:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-03 14:38:07,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-03 14:38:08,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984248377] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:08,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:08,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 10] total 28 [2025-03-03 14:38:08,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799649047] [2025-03-03 14:38:08,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:08,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 14:38:08,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:08,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 14:38:08,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:38:08,375 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 28 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 24 states have internal predecessors, (52), 11 states have call successors, (16), 5 states have call predecessors, (16), 10 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-03 14:38:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:08,762 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2025-03-03 14:38:08,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 14:38:08,765 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 24 states have internal predecessors, (52), 11 states have call successors, (16), 5 states have call predecessors, (16), 10 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) Word has length 76 [2025-03-03 14:38:08,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:08,765 INFO L225 Difference]: With dead ends: 93 [2025-03-03 14:38:08,765 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 14:38:08,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=1325, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 14:38:08,767 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 45 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:08,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 171 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:38:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 14:38:08,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 14:38:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 6 states have call successors, (6), 4 states have call predecessors, (6), 11 states have return successors, (14), 11 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-03 14:38:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-03-03 14:38:08,773 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 76 [2025-03-03 14:38:08,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:08,774 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-03-03 14:38:08,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 24 states have internal predecessors, (52), 11 states have call successors, (16), 5 states have call predecessors, (16), 10 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-03 14:38:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-03-03 14:38:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 14:38:08,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:08,775 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:08,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:38:08,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:08,979 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:08,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:08,979 INFO L85 PathProgramCache]: Analyzing trace with hash -456120223, now seen corresponding path program 2 times [2025-03-03 14:38:08,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:08,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610665352] [2025-03-03 14:38:08,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:08,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:08,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-03-03 14:38:09,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 14:38:09,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:09,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 14 proven. 389 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2025-03-03 14:38:09,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:09,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610665352] [2025-03-03 14:38:09,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610665352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:09,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919452271] [2025-03-03 14:38:09,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:09,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:09,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:09,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:38:09,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:38:09,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-03-03 14:38:09,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 14:38:09,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:09,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:09,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-03 14:38:09,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:10,009 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 15 treesize of output 1 [2025-03-03 14:38:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 366 proven. 24 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-03-03 14:38:10,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 8 proven. 411 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2025-03-03 14:38:11,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919452271] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:11,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:11,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 22] total 38 [2025-03-03 14:38:11,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518187796] [2025-03-03 14:38:11,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:11,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-03 14:38:11,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:11,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-03 14:38:11,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1142, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 14:38:11,890 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 38 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 32 states have internal predecessors, (69), 12 states have call successors, (23), 8 states have call predecessors, (23), 13 states have return successors, (29), 11 states have call predecessors, (29), 12 states have call successors, (29) [2025-03-03 14:38:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:12,169 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2025-03-03 14:38:12,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:38:12,170 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 32 states have internal predecessors, (69), 12 states have call successors, (23), 8 states have call predecessors, (23), 13 states have return successors, (29), 11 states have call predecessors, (29), 12 states have call successors, (29) Word has length 159 [2025-03-03 14:38:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:12,171 INFO L225 Difference]: With dead ends: 97 [2025-03-03 14:38:12,171 INFO L226 Difference]: Without dead ends: 53 [2025-03-03 14:38:12,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 299 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=396, Invalid=1674, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 14:38:12,172 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 24 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:12,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 379 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:38:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-03 14:38:12,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-03 14:38:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 13 states have return successors, (16), 13 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-03 14:38:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2025-03-03 14:38:12,179 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 159 [2025-03-03 14:38:12,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:12,179 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2025-03-03 14:38:12,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 32 states have internal predecessors, (69), 12 states have call successors, (23), 8 states have call predecessors, (23), 13 states have return successors, (29), 11 states have call predecessors, (29), 12 states have call successors, (29) [2025-03-03 14:38:12,179 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2025-03-03 14:38:12,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-03 14:38:12,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:12,181 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:12,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:38:12,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:12,382 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:12,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:12,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1613645343, now seen corresponding path program 3 times [2025-03-03 14:38:12,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:12,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181186496] [2025-03-03 14:38:12,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:12,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:12,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 199 statements into 11 equivalence classes. [2025-03-03 14:38:12,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 46 of 199 statements. [2025-03-03 14:38:12,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 14:38:12,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1881 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1869 trivial. 0 not checked. [2025-03-03 14:38:12,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181186496] [2025-03-03 14:38:12,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181186496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:12,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311999875] [2025-03-03 14:38:12,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:12,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:12,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:12,673 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:38:12,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:38:12,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 199 statements into 11 equivalence classes. [2025-03-03 14:38:12,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 46 of 199 statements. [2025-03-03 14:38:12,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 14:38:12,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:12,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 14:38:12,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:12,795 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 15 treesize of output 1 [2025-03-03 14:38:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1881 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1873 trivial. 0 not checked. [2025-03-03 14:38:12,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1881 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1866 trivial. 0 not checked. [2025-03-03 14:38:13,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311999875] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:13,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:13,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14] total 29 [2025-03-03 14:38:13,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113601960] [2025-03-03 14:38:13,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:13,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 14:38:13,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:13,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 14:38:13,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2025-03-03 14:38:13,716 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 29 states, 21 states have (on average 2.142857142857143) internal successors, (45), 25 states have internal predecessors, (45), 13 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (16), 11 states have call predecessors, (16), 13 states have call successors, (16) [2025-03-03 14:38:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:13,908 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2025-03-03 14:38:13,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:38:13,912 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 21 states have (on average 2.142857142857143) internal successors, (45), 25 states have internal predecessors, (45), 13 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (16), 11 states have call predecessors, (16), 13 states have call successors, (16) Word has length 199 [2025-03-03 14:38:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:13,913 INFO L225 Difference]: With dead ends: 66 [2025-03-03 14:38:13,913 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 14:38:13,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 383 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 14:38:13,914 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 45 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:13,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 123 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:38:13,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 14:38:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-03 14:38:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 37 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 15 states have return successors, (18), 15 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-03 14:38:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2025-03-03 14:38:13,921 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 199 [2025-03-03 14:38:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:13,921 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2025-03-03 14:38:13,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 21 states have (on average 2.142857142857143) internal successors, (45), 25 states have internal predecessors, (45), 13 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (16), 11 states have call predecessors, (16), 13 states have call successors, (16) [2025-03-03 14:38:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2025-03-03 14:38:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-03-03 14:38:13,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:13,924 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 48, 48, 48, 12, 12, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:13,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:38:14,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:14,125 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:14,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:14,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1739148011, now seen corresponding path program 4 times [2025-03-03 14:38:14,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:14,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171142204] [2025-03-03 14:38:14,125 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:38:14,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:14,151 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 385 statements into 2 equivalence classes. [2025-03-03 14:38:14,189 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 384 of 385 statements. [2025-03-03 14:38:14,189 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:38:14,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7694 backedges. 12 proven. 161 refuted. 0 times theorem prover too weak. 7521 trivial. 0 not checked. [2025-03-03 14:38:15,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:15,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171142204] [2025-03-03 14:38:15,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171142204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:15,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648522780] [2025-03-03 14:38:15,207 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:38:15,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:15,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:15,209 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:38:15,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:38:15,331 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 385 statements into 2 equivalence classes. [2025-03-03 14:38:15,455 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 384 of 385 statements. [2025-03-03 14:38:15,455 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:38:15,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:15,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 1661 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-03 14:38:15,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:15,472 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 15 treesize of output 1 [2025-03-03 14:38:15,692 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 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-03 14:38:15,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 14:38:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7694 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 7667 trivial. 0 not checked. [2025-03-03 14:38:15,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:16,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648522780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:16,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:38:16,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2025-03-03 14:38:16,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167407756] [2025-03-03 14:38:16,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:16,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 14:38:16,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:16,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 14:38:16,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:38:16,343 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 24 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 22 states have internal predecessors, (50), 11 states have call successors, (16), 3 states have call predecessors, (16), 10 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-03 14:38:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:16,606 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2025-03-03 14:38:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 14:38:16,607 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 22 states have internal predecessors, (50), 11 states have call successors, (16), 3 states have call predecessors, (16), 10 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) Word has length 385 [2025-03-03 14:38:16,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:16,608 INFO L225 Difference]: With dead ends: 115 [2025-03-03 14:38:16,608 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 14:38:16,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=1091, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 14:38:16,609 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:16,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 113 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:38:16,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 14:38:16,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-03 14:38:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 40 states have internal predecessors, (44), 6 states have call successors, (6), 4 states have call predecessors, (6), 17 states have return successors, (21), 18 states have call predecessors, (21), 6 states have call successors, (21) [2025-03-03 14:38:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2025-03-03 14:38:16,614 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 385 [2025-03-03 14:38:16,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:16,614 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2025-03-03 14:38:16,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 22 states have internal predecessors, (50), 11 states have call successors, (16), 3 states have call predecessors, (16), 10 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-03 14:38:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2025-03-03 14:38:16,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-03-03 14:38:16,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:16,619 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 72, 72, 72, 16, 16, 12, 12, 12, 12, 12, 12, 12, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:16,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:38:16,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:16,820 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:16,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:16,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1338883179, now seen corresponding path program 3 times [2025-03-03 14:38:16,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:16,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980014231] [2025-03-03 14:38:16,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:16,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:16,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 549 statements into 46 equivalence classes. [2025-03-03 14:38:16,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 134 of 549 statements. [2025-03-03 14:38:16,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 14:38:16,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 17236 backedges. 297 proven. 17 refuted. 0 times theorem prover too weak. 16922 trivial. 0 not checked. [2025-03-03 14:38:17,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:17,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980014231] [2025-03-03 14:38:17,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980014231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:17,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60635032] [2025-03-03 14:38:17,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:17,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:17,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:17,375 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:38:17,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:38:17,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 549 statements into 46 equivalence classes. [2025-03-03 14:38:17,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 134 of 549 statements. [2025-03-03 14:38:17,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 14:38:17,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:17,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-03 14:38:17,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:17,718 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-03-03 14:38:17,883 INFO L134 CoverageAnalysis]: Checked inductivity of 17236 backedges. 300 proven. 15 refuted. 0 times theorem prover too weak. 16921 trivial. 0 not checked. [2025-03-03 14:38:17,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 17236 backedges. 290 proven. 33 refuted. 0 times theorem prover too weak. 16913 trivial. 0 not checked. [2025-03-03 14:38:20,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60635032] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:20,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:20,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 18] total 36 [2025-03-03 14:38:20,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815039828] [2025-03-03 14:38:20,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:20,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 14:38:20,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:20,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 14:38:20,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1024, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 14:38:20,532 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 36 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 31 states have internal predecessors, (65), 17 states have call successors, (24), 7 states have call predecessors, (24), 11 states have return successors, (27), 15 states have call predecessors, (27), 17 states have call successors, (27) [2025-03-03 14:38:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:20,782 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2025-03-03 14:38:20,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:38:20,782 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 31 states have internal predecessors, (65), 17 states have call successors, (24), 7 states have call predecessors, (24), 11 states have return successors, (27), 15 states have call predecessors, (27), 17 states have call successors, (27) Word has length 549 [2025-03-03 14:38:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:20,783 INFO L225 Difference]: With dead ends: 125 [2025-03-03 14:38:20,783 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 14:38:20,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1123 GetRequests, 1080 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=327, Invalid=1479, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 14:38:20,784 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 43 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:20,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 224 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:38:20,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 14:38:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-03 14:38:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 42 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 19 states have return successors, (23), 20 states have call predecessors, (23), 6 states have call successors, (23) [2025-03-03 14:38:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2025-03-03 14:38:20,791 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 549 [2025-03-03 14:38:20,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:20,792 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2025-03-03 14:38:20,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 31 states have internal predecessors, (65), 17 states have call successors, (24), 7 states have call predecessors, (24), 11 states have return successors, (27), 15 states have call predecessors, (27), 17 states have call successors, (27) [2025-03-03 14:38:20,792 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2025-03-03 14:38:20,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2025-03-03 14:38:20,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:20,795 INFO L218 NwaCegarLoop]: trace histogram [140, 140, 120, 120, 120, 24, 24, 20, 20, 20, 20, 20, 20, 20, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:20,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:38:20,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:20,996 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:20,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:20,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1104500563, now seen corresponding path program 4 times [2025-03-03 14:38:20,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:20,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922318494] [2025-03-03 14:38:20,996 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:38:20,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:21,047 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 877 statements into 2 equivalence classes. [2025-03-03 14:38:21,150 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 876 of 877 statements. [2025-03-03 14:38:21,150 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:38:21,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 47792 backedges. 24 proven. 701 refuted. 0 times theorem prover too weak. 47067 trivial. 0 not checked. [2025-03-03 14:38:25,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:25,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922318494] [2025-03-03 14:38:25,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922318494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:25,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321231100] [2025-03-03 14:38:25,526 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:38:25,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:25,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:25,528 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:38:25,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:38:25,760 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 877 statements into 2 equivalence classes. [2025-03-03 14:38:26,045 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 876 of 877 statements. [2025-03-03 14:38:26,045 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:38:26,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:26,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 3599 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-03 14:38:26,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:26,074 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-03-03 14:38:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 47792 backedges. 18068 proven. 35 refuted. 0 times theorem prover too weak. 29689 trivial. 0 not checked. [2025-03-03 14:38:26,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:30,255 INFO L134 CoverageAnalysis]: Checked inductivity of 47792 backedges. 8 proven. 756 refuted. 0 times theorem prover too weak. 47028 trivial. 0 not checked. [2025-03-03 14:38:30,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321231100] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:30,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:30,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 26] total 44 [2025-03-03 14:38:30,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967156299] [2025-03-03 14:38:30,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:30,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-03 14:38:30,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:30,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-03 14:38:30,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=1519, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 14:38:30,258 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 44 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 37 states have internal predecessors, (81), 19 states have call successors, (29), 9 states have call predecessors, (29), 15 states have return successors, (37), 20 states have call predecessors, (37), 19 states have call successors, (37) [2025-03-03 14:38:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:30,539 INFO L93 Difference]: Finished difference Result 131 states and 153 transitions. [2025-03-03 14:38:30,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:38:30,540 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 37 states have internal predecessors, (81), 19 states have call successors, (29), 9 states have call predecessors, (29), 15 states have return successors, (37), 20 states have call predecessors, (37), 19 states have call successors, (37) Word has length 877 [2025-03-03 14:38:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:30,541 INFO L225 Difference]: With dead ends: 131 [2025-03-03 14:38:30,541 INFO L226 Difference]: Without dead ends: 69 [2025-03-03 14:38:30,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1790 GetRequests, 1737 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=502, Invalid=2048, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 14:38:30,542 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 57 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:30,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 316 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:38:30,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-03 14:38:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-03 14:38:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.119047619047619) internal successors, (47), 43 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 20 states have return successors, (24), 21 states have call predecessors, (24), 6 states have call successors, (24) [2025-03-03 14:38:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2025-03-03 14:38:30,548 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 877 [2025-03-03 14:38:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:30,548 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2025-03-03 14:38:30,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 37 states have internal predecessors, (81), 19 states have call successors, (29), 9 states have call predecessors, (29), 15 states have return successors, (37), 20 states have call predecessors, (37), 19 states have call successors, (37) [2025-03-03 14:38:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2025-03-03 14:38:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1042 [2025-03-03 14:38:30,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:30,553 INFO L218 NwaCegarLoop]: trace histogram [168, 168, 144, 144, 144, 28, 28, 24, 24, 24, 24, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:30,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 14:38:30,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 14:38:30,754 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:30,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:30,754 INFO L85 PathProgramCache]: Analyzing trace with hash 13472343, now seen corresponding path program 5 times [2025-03-03 14:38:30,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:30,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031503805] [2025-03-03 14:38:30,754 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:38:30,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:30,809 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1041 statements into 52 equivalence classes. [2025-03-03 14:38:31,656 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) and asserted 1041 of 1041 statements. [2025-03-03 14:38:31,657 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2025-03-03 14:38:31,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 68806 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 68770 trivial. 0 not checked. [2025-03-03 14:38:35,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:35,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031503805] [2025-03-03 14:38:35,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031503805] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:35,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697658286] [2025-03-03 14:38:35,896 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:38:35,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:35,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:35,898 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:38:35,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:38:36,186 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1041 statements into 52 equivalence classes.