./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.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_nla-digbench/recursified_lcm2.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 d93bd48e791c000b7768d0e055259ea6d087a487fbdd17b18765993d4c240b84 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:40:42,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:40:43,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:40:43,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:40:43,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:40:43,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:40:43,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:40:43,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:40:43,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:40:43,037 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:40:43,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:40:43,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:40:43,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:40:43,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:40:43,038 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:40:43,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:40:43,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:40:43,039 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:40:43,039 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:40:43,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:40:43,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:40:43,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:40:43,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:40:43,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:40:43,039 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:40:43,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:40:43,039 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:40:43,039 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:40:43,040 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:40:43,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:40:43,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:40:43,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:40:43,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:40:43,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:40:43,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:40:43,041 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:40:43,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:40:43,041 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:40:43,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:40:43,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:40:43,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:40:43,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:40:43,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:40:43,041 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 -> d93bd48e791c000b7768d0e055259ea6d087a487fbdd17b18765993d4c240b84 [2025-03-03 14:40:43,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:40:43,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:40:43,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:40:43,284 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:40:43,285 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:40:43,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c [2025-03-03 14:40:44,463 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6b81450c/b13251ee9f884edd8c39b42c2ceef40d/FLAG07db83ba8 [2025-03-03 14:40:44,671 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:40:44,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c [2025-03-03 14:40:44,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6b81450c/b13251ee9f884edd8c39b42c2ceef40d/FLAG07db83ba8 [2025-03-03 14:40:44,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6b81450c/b13251ee9f884edd8c39b42c2ceef40d [2025-03-03 14:40:44,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:40:44,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:40:44,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:40:44,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:40:44,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:40:44,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:40:44" (1/1) ... [2025-03-03 14:40:44,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e80476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:40:44, skipping insertion in model container [2025-03-03 14:40:44,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:40:44" (1/1) ... [2025-03-03 14:40:44,707 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:40:44,795 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_nla-digbench/recursified_lcm2.c[1061,1074] [2025-03-03 14:40:44,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:40:44,821 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:40:44,829 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_nla-digbench/recursified_lcm2.c[1061,1074] [2025-03-03 14:40:44,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:40:44,849 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:40:44,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:40:44 WrapperNode [2025-03-03 14:40:44,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:40:44,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:40:44,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:40:44,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:40:44,855 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:40:44" (1/1) ... [2025-03-03 14:40:44,861 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:40:44" (1/1) ... [2025-03-03 14:40:44,876 INFO L138 Inliner]: procedures = 16, calls = 82, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 92 [2025-03-03 14:40:44,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:40:44,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:40:44,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:40:44,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:40:44,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:40:44" (1/1) ... [2025-03-03 14:40:44,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:40:44" (1/1) ... [2025-03-03 14:40:44,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:40:44" (1/1) ... [2025-03-03 14:40:44,904 INFO L175 MemorySlicer]: Split 51 memory accesses to 8 slices as follows [2, 7, 7, 7, 6, 6, 8, 8]. 16 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0, 0, 0, 0, 0]. The 10 writes are split as follows [0, 0, 1, 1, 2, 2, 2, 2]. [2025-03-03 14:40:44,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:40:44" (1/1) ... [2025-03-03 14:40:44,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:40:44" (1/1) ... [2025-03-03 14:40:44,911 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:40:44" (1/1) ... [2025-03-03 14:40:44,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:40:44" (1/1) ... [2025-03-03 14:40:44,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:40:44" (1/1) ... [2025-03-03 14:40:44,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:40:44" (1/1) ... [2025-03-03 14:40:44,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:40:44,919 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:40:44,919 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:40:44,919 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:40:44,924 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:40:44" (1/1) ... [2025-03-03 14:40:44,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:40:44,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:40:44,951 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:40:44,957 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:40:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:40:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 14:40:44,973 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 14:40:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:40:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:40:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:40:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:40:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:40:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:40:44,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:40:44,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:40:44,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 14:40:44,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 14:40:44,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 14:40:44,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 14:40:44,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 14:40:44,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 14:40:44,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 14:40:44,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 14:40:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 14:40:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:40:44,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:40:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 14:40:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 14:40:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 14:40:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 14:40:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 14:40:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 14:40:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 14:40:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 14:40:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 14:40:44,975 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 14:40:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 14:40:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_35_to_46_0 [2025-03-03 14:40:44,975 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_35_to_46_0 [2025-03-03 14:40:45,050 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:40:45,052 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:40:45,137 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_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#u~0#1.base, main_~#u~0#1.offset);havoc main_~#u~0#1.base, main_~#u~0#1.offset;call ULTIMATE.dealloc(main_~#v~0#1.base, main_~#v~0#1.offset);havoc main_~#v~0#1.base, main_~#v~0#1.offset; [2025-03-03 14:40:45,189 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 14:40:45,189 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:40:45,199 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:40:45,200 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:40:45,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:40:45 BoogieIcfgContainer [2025-03-03 14:40:45,200 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:40:45,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:40:45,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:40:45,205 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:40:45,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:40:44" (1/3) ... [2025-03-03 14:40:45,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76129d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:40:45, skipping insertion in model container [2025-03-03 14:40:45,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:40:44" (2/3) ... [2025-03-03 14:40:45,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76129d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:40:45, skipping insertion in model container [2025-03-03 14:40:45,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:40:45" (3/3) ... [2025-03-03 14:40:45,207 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_lcm2.c [2025-03-03 14:40:45,217 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:40:45,218 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_lcm2.c that has 4 procedures, 36 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:40:45,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:40:45,269 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;@6fa774d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:40:45,270 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:40:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:40:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 14:40:45,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:40:45,277 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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:40:45,277 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:40:45,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:40:45,281 INFO L85 PathProgramCache]: Analyzing trace with hash 771020995, now seen corresponding path program 1 times [2025-03-03 14:40:45,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:40:45,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698263844] [2025-03-03 14:40:45,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:40:45,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:40:45,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 14:40:45,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 14:40:45,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:40:45,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:40:45,449 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:40:45,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:40:45,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698263844] [2025-03-03 14:40:45,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698263844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:40:45,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647266346] [2025-03-03 14:40:45,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:40:45,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:40:45,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:40:45,453 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:40:45,454 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:40:45,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 14:40:45,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 14:40:45,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:40:45,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:40:45,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:40:45,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:40:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:40:45,618 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:40:45,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647266346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:40:45,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:40:45,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 14:40:45,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288795209] [2025-03-03 14:40:45,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:40:45,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:40:45,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:40:45,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:40:45,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:40:45,638 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 14:40:45,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:40:45,650 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2025-03-03 14:40:45,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:40:45,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-03-03 14:40:45,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:40:45,655 INFO L225 Difference]: With dead ends: 69 [2025-03-03 14:40:45,655 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 14:40:45,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:40:45,658 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:40:45,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:40:45,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 14:40:45,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-03 14:40:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 14:40:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-03-03 14:40:45,682 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 33 [2025-03-03 14:40:45,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:40:45,683 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-03 14:40:45,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 14:40:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-03-03 14:40:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 14:40:45,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:40:45,685 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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:40:45,693 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:40:45,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:40:45,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:40:45,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:40:45,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2029721785, now seen corresponding path program 1 times [2025-03-03 14:40:45,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:40:45,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502762058] [2025-03-03 14:40:45,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:40:45,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:40:45,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 14:40:45,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 14:40:45,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:40:45,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:40:45,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173058418] [2025-03-03 14:40:45,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:40:45,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:40:45,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:40:45,991 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:40:45,993 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:40:46,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 14:40:46,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 14:40:46,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:40:46,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:40:46,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-03-03 14:40:46,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:40:46,183 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:40:46,186 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:40:46,203 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 11 [2025-03-03 14:40:46,211 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 11 [2025-03-03 14:40:46,218 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 11 [2025-03-03 14:40:46,225 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 11 [2025-03-03 14:40:46,343 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 19 treesize of output 11 [2025-03-03 14:40:46,352 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 19 treesize of output 11 [2025-03-03 14:40:46,356 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 22 treesize of output 10 [2025-03-03 14:40:46,369 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 19 treesize of output 11 [2025-03-03 14:40:46,376 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 19 treesize of output 11 [2025-03-03 14:40:46,380 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 22 treesize of output 10 [2025-03-03 14:40:46,419 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:40:46,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:40:46,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:40:46,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502762058] [2025-03-03 14:40:46,420 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:40:46,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173058418] [2025-03-03 14:40:46,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173058418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:40:46,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:40:46,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:40:46,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870046411] [2025-03-03 14:40:46,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:40:46,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:40:46,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:40:46,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:40:46,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:40:46,421 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:40:46,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:40:46,657 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2025-03-03 14:40:46,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:40:46,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2025-03-03 14:40:46,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:40:46,658 INFO L225 Difference]: With dead ends: 47 [2025-03-03 14:40:46,659 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 14:40:46,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:40:46,659 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:40:46,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 168 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:40:46,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 14:40:46,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-03-03 14:40:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-03 14:40:46,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2025-03-03 14:40:46,672 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 33 [2025-03-03 14:40:46,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:40:46,672 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2025-03-03 14:40:46,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:40:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2025-03-03 14:40:46,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 14:40:46,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:40:46,673 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:40:46,681 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:40:46,876 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,SelfDestructingSolverStorable1 [2025-03-03 14:40:46,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:40:46,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:40:46,876 INFO L85 PathProgramCache]: Analyzing trace with hash -684455030, now seen corresponding path program 1 times [2025-03-03 14:40:46,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:40:46,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361007243] [2025-03-03 14:40:46,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:40:46,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:40:46,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 14:40:46,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 14:40:46,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:40:46,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:40:46,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154814136] [2025-03-03 14:40:46,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:40:46,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:40:46,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:40:46,948 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:40:46,950 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:40:47,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 14:40:47,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 14:40:47,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:40:47,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:40:47,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-03-03 14:40:47,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:40:47,110 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:40:47,112 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:40:47,123 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 11 [2025-03-03 14:40:47,128 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 11 [2025-03-03 14:40:47,133 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 11 [2025-03-03 14:40:47,139 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 11 [2025-03-03 14:40:47,161 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 11 treesize of output 7 [2025-03-03 14:40:47,165 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 11 treesize of output 7 [2025-03-03 14:40:47,172 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 11 treesize of output 7 [2025-03-03 14:40:47,175 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 11 treesize of output 7 [2025-03-03 14:40:47,507 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 34 treesize of output 22 [2025-03-03 14:40:47,515 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 41 treesize of output 25 [2025-03-03 14:40:47,519 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:40:47,526 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 30 treesize of output 18 [2025-03-03 14:40:47,532 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 37 treesize of output 21 [2025-03-03 14:40:47,538 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:40:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:40:47,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:40:47,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:40:47,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361007243] [2025-03-03 14:40:47,591 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:40:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154814136] [2025-03-03 14:40:47,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154814136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:40:47,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:40:47,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 14:40:47,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356669461] [2025-03-03 14:40:47,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:40:47,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:40:47,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:40:47,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:40:47,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:40:47,592 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:40:47,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:40:47,883 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2025-03-03 14:40:47,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:40:47,883 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2025-03-03 14:40:47,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:40:47,886 INFO L225 Difference]: With dead ends: 53 [2025-03-03 14:40:47,886 INFO L226 Difference]: Without dead ends: 43 [2025-03-03 14:40:47,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:40:47,887 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:40:47,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:40:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-03 14:40:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-03 14:40:47,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-03 14:40:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-03 14:40:47,894 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 43 [2025-03-03 14:40:47,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:40:47,895 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-03 14:40:47,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:40:47,895 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-03-03 14:40:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 14:40:47,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:40:47,895 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:40:47,902 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:40:48,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:40:48,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:40:48,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:40:48,096 INFO L85 PathProgramCache]: Analyzing trace with hash -800610683, now seen corresponding path program 1 times [2025-03-03 14:40:48,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:40:48,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055520151] [2025-03-03 14:40:48,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:40:48,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:40:48,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 14:40:48,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 14:40:48,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:40:48,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:40:48,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078712574] [2025-03-03 14:40:48,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:40:48,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:40:48,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:40:48,164 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:40:48,166 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:40:48,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 14:40:48,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 14:40:48,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:40:48,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:40:48,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 164 conjuncts are in the unsatisfiable core [2025-03-03 14:40:48,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:40:48,756 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:40:48,758 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:40:48,766 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 11 [2025-03-03 14:40:48,770 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 11 [2025-03-03 14:40:48,776 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 11 [2025-03-03 14:40:48,781 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 11 [2025-03-03 14:40:52,919 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_func_to_recursive_line_35_to_46_0_~b.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~u.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~u.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~y.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_35_to_46_0_~y.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_35_to_46_0_~b.base_BEFORE_CALL_1 Int)) (let ((.cse0 (select (select |c_#memory_int#3| v_func_to_recursive_line_35_to_46_0_~b.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~b.offset_BEFORE_CALL_1))) (and (= .cse0 (select (select |c_#memory_int#4| v_func_to_recursive_line_35_to_46_0_~u.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~u.offset_BEFORE_CALL_1)) (= (select (select |c_#memory_int#7| v_func_to_recursive_line_35_to_46_0_~y.base_BEFORE_CALL_2) v_func_to_recursive_line_35_to_46_0_~y.offset_BEFORE_CALL_2) .cse0)))) (exists ((v_func_to_recursive_line_35_to_46_0_~v.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~v.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~x.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_35_to_46_0_~a.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~x.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_35_to_46_0_~a.offset_BEFORE_CALL_1 Int)) (let ((.cse1 (select (select |c_#memory_int#2| v_func_to_recursive_line_35_to_46_0_~a.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~a.offset_BEFORE_CALL_1))) (and (= (select (select |c_#memory_int#6| v_func_to_recursive_line_35_to_46_0_~x.base_BEFORE_CALL_2) v_func_to_recursive_line_35_to_46_0_~x.offset_BEFORE_CALL_2) .cse1) (= .cse1 (select (select |c_#memory_int#5| v_func_to_recursive_line_35_to_46_0_~v.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~v.offset_BEFORE_CALL_1)))))) is different from true [2025-03-03 14:40:53,129 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 35 treesize of output 21 [2025-03-03 14:40:53,138 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 33 treesize of output 21 [2025-03-03 14:40:53,260 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 36 treesize of output 24 [2025-03-03 14:40:53,269 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 25 treesize of output 17 [2025-03-03 14:40:53,278 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 36 treesize of output 24 [2025-03-03 14:40:53,283 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 45 treesize of output 29 [2025-03-03 14:40:53,288 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 43 treesize of output 27 [2025-03-03 14:40:53,291 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 29 treesize of output 17 [2025-03-03 14:40:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 1 not checked. [2025-03-03 14:40:57,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:41:10,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:41:10,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055520151] [2025-03-03 14:41:10,818 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:41:10,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078712574] [2025-03-03 14:41:10,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078712574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:41:10,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:41:10,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2025-03-03 14:41:10,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041249239] [2025-03-03 14:41:10,819 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 14:41:10,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 14:41:10,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:41:10,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 14:41:10,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=229, Unknown=3, NotChecked=30, Total=306 [2025-03-03 14:41:10,820 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:41:15,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 14:41:19,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 14:41:27,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 14:41:31,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 14:41:35,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 14:41:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:41:36,021 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2025-03-03 14:41:36,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:41:36,022 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2025-03-03 14:41:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:41:36,023 INFO L225 Difference]: With dead ends: 61 [2025-03-03 14:41:36,023 INFO L226 Difference]: Without dead ends: 59 [2025-03-03 14:41:36,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=4, NotChecked=40, Total=506 [2025-03-03 14:41:36,023 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 19 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:41:36,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 244 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 259 Invalid, 5 Unknown, 76 Unchecked, 20.9s Time] [2025-03-03 14:41:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-03 14:41:36,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-03-03 14:41:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-03 14:41:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2025-03-03 14:41:36,035 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 44 [2025-03-03 14:41:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:41:36,035 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2025-03-03 14:41:36,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:41:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2025-03-03 14:41:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 14:41:36,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:41:36,036 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:41:36,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:41:36,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:41:36,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:41:36,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:41:36,239 INFO L85 PathProgramCache]: Analyzing trace with hash 942199652, now seen corresponding path program 1 times [2025-03-03 14:41:36,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:41:36,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511966316] [2025-03-03 14:41:36,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:41:36,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:41:36,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 14:41:36,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 14:41:36,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:41:36,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:41:36,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1025293047] [2025-03-03 14:41:36,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:41:36,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:41:36,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:41:36,294 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:41:36,296 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:41:36,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 14:41:36,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 14:41:36,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:41:36,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:41:36,838 WARN L254 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 169 conjuncts are in the unsatisfiable core [2025-03-03 14:41:36,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:41:36,846 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:41:36,848 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:41:36,854 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 11 [2025-03-03 14:41:36,858 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 11 [2025-03-03 14:41:36,863 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 11 [2025-03-03 14:41:36,867 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 11 [2025-03-03 14:41:40,941 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_func_to_recursive_line_35_to_46_0_~y.offset_BEFORE_CALL_4 Int) (v_func_to_recursive_line_35_to_46_0_~u.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_35_to_46_0_~b.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_35_to_46_0_~b.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_35_to_46_0_~u.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_35_to_46_0_~y.base_BEFORE_CALL_4 Int)) (let ((.cse0 (select (select |c_#memory_int#3| v_func_to_recursive_line_35_to_46_0_~b.base_BEFORE_CALL_3) v_func_to_recursive_line_35_to_46_0_~b.offset_BEFORE_CALL_3))) (and (= .cse0 (select (select |c_#memory_int#7| v_func_to_recursive_line_35_to_46_0_~y.base_BEFORE_CALL_4) v_func_to_recursive_line_35_to_46_0_~y.offset_BEFORE_CALL_4)) (= .cse0 (select (select |c_#memory_int#4| v_func_to_recursive_line_35_to_46_0_~u.base_BEFORE_CALL_3) v_func_to_recursive_line_35_to_46_0_~u.offset_BEFORE_CALL_3))))) (exists ((v_func_to_recursive_line_35_to_46_0_~a.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_35_to_46_0_~v.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_35_to_46_0_~x.base_BEFORE_CALL_4 Int) (v_func_to_recursive_line_35_to_46_0_~x.offset_BEFORE_CALL_4 Int) (v_func_to_recursive_line_35_to_46_0_~v.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_35_to_46_0_~a.base_BEFORE_CALL_3 Int)) (let ((.cse1 (select (select |c_#memory_int#2| v_func_to_recursive_line_35_to_46_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_35_to_46_0_~a.offset_BEFORE_CALL_3))) (and (= (select (select |c_#memory_int#5| v_func_to_recursive_line_35_to_46_0_~v.base_BEFORE_CALL_3) v_func_to_recursive_line_35_to_46_0_~v.offset_BEFORE_CALL_3) .cse1) (= (select (select |c_#memory_int#6| v_func_to_recursive_line_35_to_46_0_~x.base_BEFORE_CALL_4) v_func_to_recursive_line_35_to_46_0_~x.offset_BEFORE_CALL_4) .cse1))))) is different from true [2025-03-03 14:41:41,033 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 35 treesize of output 21 [2025-03-03 14:41:41,041 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 33 treesize of output 21 [2025-03-03 14:41:41,146 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 25 treesize of output 17 [2025-03-03 14:41:41,152 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 38 treesize of output 26 [2025-03-03 14:41:41,157 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 46 treesize of output 30 [2025-03-03 14:41:41,162 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 64 treesize of output 44 [2025-03-03 14:41:41,166 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 53 treesize of output 33 [2025-03-03 14:41:41,172 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 29 treesize of output 17 [2025-03-03 14:41:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 2 not checked. [2025-03-03 14:41:41,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:41:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:41:42,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:41:42,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511966316] [2025-03-03 14:41:42,931 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:41:42,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025293047] [2025-03-03 14:41:42,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025293047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:41:42,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:41:42,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2025-03-03 14:41:42,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475444966] [2025-03-03 14:41:42,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:41:42,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 14:41:42,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:41:42,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 14:41:42,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=152, Unknown=1, NotChecked=24, Total=210 [2025-03-03 14:41:42,932 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 15 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:41:51,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-03 14:42:01,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:01,296 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2025-03-03 14:42:01,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 14:42:01,297 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2025-03-03 14:42:01,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:01,299 INFO L225 Difference]: With dead ends: 77 [2025-03-03 14:42:01,299 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 14:42:01,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=4, NotChecked=42, Total=552 [2025-03-03 14:42:01,300 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 31 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:01,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 253 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 256 Invalid, 0 Unknown, 69 Unchecked, 4.2s Time] [2025-03-03 14:42:01,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 14:42:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2025-03-03 14:42:01,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 9 states have call predecessors, (13), 10 states have return successors, (19), 12 states have call predecessors, (19), 12 states have call successors, (19) [2025-03-03 14:42:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2025-03-03 14:42:01,313 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 44 [2025-03-03 14:42:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:01,313 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2025-03-03 14:42:01,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:42:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2025-03-03 14:42:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 14:42:01,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:01,314 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:42:01,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:42:01,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:42:01,519 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:01,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:01,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1360712634, now seen corresponding path program 1 times [2025-03-03 14:42:01,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:01,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882982636] [2025-03-03 14:42:01,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:01,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:01,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 14:42:01,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 14:42:01,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:01,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:42:01,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2080532397] [2025-03-03 14:42:01,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:01,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:42:01,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:42:01,585 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:42:01,586 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:42:01,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 14:42:01,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 14:42:01,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:01,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:01,900 WARN L254 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 185 conjuncts are in the unsatisfiable core [2025-03-03 14:42:01,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:42:01,910 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:42:01,912 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:42:01,918 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 11 [2025-03-03 14:42:01,922 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 11 [2025-03-03 14:42:01,925 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 11 [2025-03-03 14:42:01,930 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 11 [2025-03-03 14:42:01,946 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 11 treesize of output 7 [2025-03-03 14:42:01,949 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 11 treesize of output 7 [2025-03-03 14:42:01,953 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 11 treesize of output 7 [2025-03-03 14:42:01,955 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 11 treesize of output 7 [2025-03-03 14:42:03,444 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 37 treesize of output 33 [2025-03-03 14:42:03,448 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 33 treesize of output 29 [2025-03-03 14:42:03,451 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 29 treesize of output 25 [2025-03-03 14:42:30,073 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_39 Int) (|v_func_to_recursive_line_35_to_46_0_#t~mem6_12| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_2| Int) (v_arrayElimCell_38 Int) (v_arrayElimCell_37 Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_2| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_2| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_2| Int)) (= (* (mod (* (select (select |c_#memory_int#2| |v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_2|) |v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_2|) (select (select |c_#memory_int#3| |v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_2|) |v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_2|)) 2147483648) 2) (mod (+ (* |v_func_to_recursive_line_35_to_46_0_#t~mem6_12| v_arrayElimCell_39) (* v_arrayElimCell_38 v_arrayElimCell_37)) 4294967296))) is different from true