./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/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.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:19:39,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:19:39,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:19:39,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:19:39,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:19:39,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:19:39,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:19:39,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:19:39,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:19:39,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:19:39,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:19:39,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:19:39,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:19:39,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:19:39,747 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:19:39,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:19:39,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:19:39,748 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:19:39,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:19:39,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:19:39,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:19:39,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:19:39,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:19:39,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:19:39,753 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:19:39,754 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:19:39,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:19:39,754 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:19:39,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:19:39,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:19:39,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:19:39,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:19:39,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:19:39,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:19:39,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:19:39,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:19:39,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:19:39,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:19:39,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:19:39,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:19:39,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:19:39,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:19:39,759 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-10-14 03:19:39,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:19:40,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:19:40,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:19:40,025 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:19:40,025 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:19:40,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c [2024-10-14 03:19:41,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:19:41,575 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:19:41,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c [2024-10-14 03:19:41,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c94af7bf7/27a844bbd0034fdda8bcbe68de682f61/FLAGb09f5198b [2024-10-14 03:19:41,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c94af7bf7/27a844bbd0034fdda8bcbe68de682f61 [2024-10-14 03:19:41,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:19:41,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:19:41,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:19:41,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:19:41,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:19:41,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:19:41" (1/1) ... [2024-10-14 03:19:41,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6edff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:19:41, skipping insertion in model container [2024-10-14 03:19:41,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:19:41" (1/1) ... [2024-10-14 03:19:41,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:19:41,788 WARN L248 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] [2024-10-14 03:19:41,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:19:41,811 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:19:41,823 WARN L248 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] [2024-10-14 03:19:41,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:19:41,845 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:19:41,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:19:41 WrapperNode [2024-10-14 03:19:41,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:19:41,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:19:41,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:19:41,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:19:41,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:19:41" (1/1) ... [2024-10-14 03:19:41,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:19:41" (1/1) ... [2024-10-14 03:19:41,882 INFO L138 Inliner]: procedures = 16, calls = 82, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 92 [2024-10-14 03:19:41,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:19:41,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:19:41,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:19:41,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:19:41,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:19:41" (1/1) ... [2024-10-14 03:19:41,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:19:41" (1/1) ... [2024-10-14 03:19:41,894 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:19:41" (1/1) ... [2024-10-14 03:19:41,908 INFO L175 MemorySlicer]: Split 51 memory accesses to 8 slices as follows [2, 8, 7, 8, 6, 6, 7, 7]. 16 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 0, 7, 0, 0, 0, 0, 0]. The 10 writes are split as follows [0, 2, 0, 2, 2, 2, 1, 1]. [2024-10-14 03:19:41,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:19:41" (1/1) ... [2024-10-14 03:19:41,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:19:41" (1/1) ... [2024-10-14 03:19:41,916 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:19:41" (1/1) ... [2024-10-14 03:19:41,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:19:41" (1/1) ... [2024-10-14 03:19:41,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:19:41" (1/1) ... [2024-10-14 03:19:41,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:19:41" (1/1) ... [2024-10-14 03:19:41,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:19:41,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:19:41,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:19:41,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:19:41,928 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:19:41" (1/1) ... [2024-10-14 03:19:41,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:19:41,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:19:41,960 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) [2024-10-14 03:19:41,963 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 [2024-10-14 03:19:42,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:19:42,006 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 03:19:42,006 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 03:19:42,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:19:42,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 03:19:42,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 03:19:42,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 03:19:42,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 03:19:42,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 03:19:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 03:19:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 03:19:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 03:19:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 03:19:42,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 03:19:42,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 03:19:42,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 03:19:42,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 03:19:42,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 03:19:42,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-14 03:19:42,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-14 03:19:42,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:19:42,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:19:42,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 03:19:42,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 03:19:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 03:19:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 03:19:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 03:19:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 03:19:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-14 03:19:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-14 03:19:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 03:19:42,011 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 03:19:42,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 03:19:42,012 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_35_to_46_0 [2024-10-14 03:19:42,012 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_35_to_46_0 [2024-10-14 03:19:42,103 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:19:42,105 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:19:42,316 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-14 03:19:42,316 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:19:42,343 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:19:42,344 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 03:19:42,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:19:42 BoogieIcfgContainer [2024-10-14 03:19:42,344 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:19:42,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:19:42,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:19:42,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:19:42,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:19:41" (1/3) ... [2024-10-14 03:19:42,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d425e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:19:42, skipping insertion in model container [2024-10-14 03:19:42,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:19:41" (2/3) ... [2024-10-14 03:19:42,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d425e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:19:42, skipping insertion in model container [2024-10-14 03:19:42,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:19:42" (3/3) ... [2024-10-14 03:19:42,351 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_lcm2.c [2024-10-14 03:19:42,364 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:19:42,364 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:19:42,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:19:42,422 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;@5a2c3608, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:19:42,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:19:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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) [2024-10-14 03:19:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 03:19:42,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:19:42,432 INFO L215 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] [2024-10-14 03:19:42,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:19:42,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:19:42,438 INFO L85 PathProgramCache]: Analyzing trace with hash 897324978, now seen corresponding path program 1 times [2024-10-14 03:19:42,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:19:42,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154862613] [2024-10-14 03:19:42,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:19:42,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:19:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:19:42,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:19:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:19:42,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:19:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:19:42,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:19:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:19:42,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 03:19:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:19:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 03:19:42,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:19:42,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154862613] [2024-10-14 03:19:42,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154862613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:19:42,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:19:42,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:19:42,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919318716] [2024-10-14 03:19:42,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:19:42,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:19:42,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:19:42,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:19:42,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:19:42,840 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2024-10-14 03:19:42,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:19:42,875 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2024-10-14 03:19:42,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:19:42,878 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 32 [2024-10-14 03:19:42,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:19:42,885 INFO L225 Difference]: With dead ends: 64 [2024-10-14 03:19:42,886 INFO L226 Difference]: Without dead ends: 31 [2024-10-14 03:19:42,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:19:42,894 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:19:42,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:19:42,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-14 03:19:42,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-14 03:19:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 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) [2024-10-14 03:19:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-14 03:19:42,939 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 32 [2024-10-14 03:19:42,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:19:42,940 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-14 03:19:42,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2024-10-14 03:19:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-10-14 03:19:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 03:19:42,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:19:42,943 INFO L215 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] [2024-10-14 03:19:42,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:19:42,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:19:42,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:19:42,944 INFO L85 PathProgramCache]: Analyzing trace with hash -409193286, now seen corresponding path program 1 times [2024-10-14 03:19:42,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:19:42,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865659806] [2024-10-14 03:19:42,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:19:42,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:19:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 03:19:43,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1351895007] [2024-10-14 03:19:43,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:19:43,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:19:43,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:19:43,093 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) [2024-10-14 03:19:43,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:19:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:19:43,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-10-14 03:19:43,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:19:43,389 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 [2024-10-14 03:19:43,394 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 [2024-10-14 03:19:43,429 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 [2024-10-14 03:19:43,441 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 [2024-10-14 03:19:43,450 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 [2024-10-14 03:19:43,459 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 [2024-10-14 03:19:43,644 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 [2024-10-14 03:19:43,654 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 26 treesize of output 14 [2024-10-14 03:19:43,658 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 [2024-10-14 03:19:43,672 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 [2024-10-14 03:19:43,683 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 [2024-10-14 03:19:43,689 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 [2024-10-14 03:19:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 03:19:43,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:19:43,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:19:43,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865659806] [2024-10-14 03:19:43,753 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 03:19:43,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351895007] [2024-10-14 03:19:43,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351895007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:19:43,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:19:43,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:19:43,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084598850] [2024-10-14 03:19:43,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:19:43,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:19:43,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:19:43,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:19:43,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:19:43,763 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) [2024-10-14 03:19:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:19:44,070 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-10-14 03:19:44,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:19:44,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 32 [2024-10-14 03:19:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:19:44,073 INFO L225 Difference]: With dead ends: 46 [2024-10-14 03:19:44,073 INFO L226 Difference]: Without dead ends: 44 [2024-10-14 03:19:44,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:19:44,075 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:19:44,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 157 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:19:44,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-14 03:19:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2024-10-14 03:19:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1481481481481481) 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) [2024-10-14 03:19:44,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-10-14 03:19:44,087 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 32 [2024-10-14 03:19:44,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:19:44,088 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-10-14 03:19:44,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) [2024-10-14 03:19:44,088 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-10-14 03:19:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 03:19:44,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:19:44,089 INFO L215 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] [2024-10-14 03:19:44,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:19:44,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:19:44,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:19:44,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:19:44,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1459834226, now seen corresponding path program 1 times [2024-10-14 03:19:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:19:44,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961707808] [2024-10-14 03:19:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:19:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:19:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 03:19:44,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [216257540] [2024-10-14 03:19:44,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:19:44,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:19:44,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:19:44,399 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) [2024-10-14 03:19:44,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:19:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:19:44,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-14 03:19:44,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:19:44,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 [2024-10-14 03:19:44,760 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 [2024-10-14 03:19:44,774 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 [2024-10-14 03:19:44,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 [2024-10-14 03:19:44,789 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 [2024-10-14 03:19:44,799 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 [2024-10-14 03:19:44,840 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 [2024-10-14 03:19:44,845 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 [2024-10-14 03:19:44,856 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 [2024-10-14 03:19:44,860 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 [2024-10-14 03:19:45,012 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 [2024-10-14 03:19:45,026 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 26 treesize of output 14 [2024-10-14 03:19:45,032 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 [2024-10-14 03:19:45,044 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 [2024-10-14 03:19:45,051 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 [2024-10-14 03:19:45,054 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 [2024-10-14 03:19:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 03:19:45,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:19:45,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:19:45,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961707808] [2024-10-14 03:19:45,096 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 03:19:45,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216257540] [2024-10-14 03:19:45,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216257540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:19:45,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:19:45,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:19:45,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461261313] [2024-10-14 03:19:45,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:19:45,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:19:45,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:19:45,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:19:45,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:19:45,099 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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) [2024-10-14 03:19:45,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:19:45,352 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-10-14 03:19:45,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:19:45,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 42 [2024-10-14 03:19:45,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:19:45,355 INFO L225 Difference]: With dead ends: 52 [2024-10-14 03:19:45,356 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 03:19:45,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:19:45,358 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 17 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:19:45,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 75 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:19:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 03:19:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-14 03:19:45,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 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) [2024-10-14 03:19:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-10-14 03:19:45,373 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 42 [2024-10-14 03:19:45,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:19:45,374 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-10-14 03:19:45,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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) [2024-10-14 03:19:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-10-14 03:19:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 03:19:45,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:19:45,375 INFO L215 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] [2024-10-14 03:19:45,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 03:19:45,579 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,SelfDestructingSolverStorable2 [2024-10-14 03:19:45,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:19:45,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:19:45,580 INFO L85 PathProgramCache]: Analyzing trace with hash 44848769, now seen corresponding path program 1 times [2024-10-14 03:19:45,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:19:45,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128699224] [2024-10-14 03:19:45,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:19:45,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:19:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 03:19:45,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1918700646] [2024-10-14 03:19:45,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:19:45,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:19:45,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:19:45,662 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) [2024-10-14 03:19:45,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:19:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:19:46,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 167 conjuncts are in the unsatisfiable core [2024-10-14 03:19:46,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:19:46,615 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 [2024-10-14 03:19:46,618 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 [2024-10-14 03:19:46,632 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 [2024-10-14 03:19:46,637 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 [2024-10-14 03:19:46,645 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 [2024-10-14 03:19:46,653 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 [2024-10-14 03:19:50,769 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_~b.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~y.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~y.offset_BEFORE_CALL_1 Int)) (let ((.cse0 (select (select |c_#memory_int#7| 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#1| v_func_to_recursive_line_35_to_46_0_~y.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~y.offset_BEFORE_CALL_1) .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.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~x.offset_BEFORE_CALL_1 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_~a.offset_BEFORE_CALL_1 Int)) (let ((.cse1 (select (select |c_#memory_int#6| 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 (= .cse1 (select (select |c_#memory_int#3| v_func_to_recursive_line_35_to_46_0_~x.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~x.offset_BEFORE_CALL_1)) (= .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 [2024-10-14 03:19:50,929 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 [2024-10-14 03:19:50,941 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 [2024-10-14 03:19:51,058 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 [2024-10-14 03:19:51,068 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 [2024-10-14 03:19:51,077 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 [2024-10-14 03:19:51,088 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 47 treesize of output 31 [2024-10-14 03:19:51,096 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 52 treesize of output 32 [2024-10-14 03:19:51,103 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 26 treesize of output 14 [2024-10-14 03:19:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 2 not checked. [2024-10-14 03:19:51,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:19:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-14 03:19:57,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:19:57,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128699224] [2024-10-14 03:19:57,226 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 03:19:57,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918700646] [2024-10-14 03:19:57,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918700646] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:19:57,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 03:19:57,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2024-10-14 03:19:57,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885364506] [2024-10-14 03:19:57,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 03:19:57,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 03:19:57,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:19:57,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 03:19:57,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=152, Unknown=2, NotChecked=24, Total=210 [2024-10-14 03:19:57,229 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 15 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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) [2024-10-14 03:20:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:20:12,036 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2024-10-14 03:20:12,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 03:20:12,037 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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 43 [2024-10-14 03:20:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:20:12,038 INFO L225 Difference]: With dead ends: 62 [2024-10-14 03:20:12,038 INFO L226 Difference]: Without dead ends: 58 [2024-10-14 03:20:12,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=90, Invalid=415, Unknown=5, NotChecked=42, Total=552 [2024-10-14 03:20:12,039 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:20:12,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 232 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 239 Invalid, 0 Unknown, 68 Unchecked, 1.4s Time] [2024-10-14 03:20:12,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-14 03:20:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2024-10-14 03:20:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-14 03:20:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-10-14 03:20:12,077 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 43 [2024-10-14 03:20:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:20:12,079 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-10-14 03:20:12,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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) [2024-10-14 03:20:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-10-14 03:20:12,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 03:20:12,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:20:12,085 INFO L215 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] [2024-10-14 03:20:12,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 03:20:12,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:20:12,286 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:20:12,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:20:12,286 INFO L85 PathProgramCache]: Analyzing trace with hash 79448969, now seen corresponding path program 1 times [2024-10-14 03:20:12,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:20:12,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610331558] [2024-10-14 03:20:12,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:20:12,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:20:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 03:20:12,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1985830075] [2024-10-14 03:20:12,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:20:12,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:20:12,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:20:12,416 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) [2024-10-14 03:20:12,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 03:20:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:20:12,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 181 conjuncts are in the unsatisfiable core [2024-10-14 03:20:12,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:20:12,997 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 [2024-10-14 03:20:12,999 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 [2024-10-14 03:20:13,007 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 [2024-10-14 03:20:13,013 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 [2024-10-14 03:20:13,020 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 [2024-10-14 03:20:13,027 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 [2024-10-14 03:20:13,049 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 [2024-10-14 03:20:13,052 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 [2024-10-14 03:20:13,059 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 [2024-10-14 03:20:13,062 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 [2024-10-14 03:20:14,369 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 [2024-10-14 03:20:14,383 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 20 treesize of output 9 [2024-10-14 03:20:14,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2024-10-14 03:20:14,645 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 77 treesize of output 61 [2024-10-14 03:20:14,660 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 72 treesize of output 60 [2024-10-14 03:20:14,671 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 91 treesize of output 71 [2024-10-14 03:20:14,680 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 89 treesize of output 53 [2024-10-14 03:20:14,689 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 93 treesize of output 57 [2024-10-14 03:20:14,696 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 34 [2024-10-14 03:20:15,116 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-14 03:20:15,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:20:24,157 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_4| Int)) (let ((.cse0 (* 2 (mod (* (select (select |c_#memory_int#7| |v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#6| |v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_4|)) 2147483648)))) (or (= .cse0 (mod (+ (* (select (select |c_#memory_int#3| |v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#4| |v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_4|)) (* (select (select |c_#memory_int#5| |v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#1| |v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_4|))) 4294967296)) (not (= .cse0 (mod (+ (* (select (select |c_old(#memory_int#4)| |v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_4|) (select (select |c_old(#memory_int#3)| |v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_4|)) (* (select (select |c_old(#memory_int#1)| |v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_4|) (select (select |c_old(#memory_int#5)| |v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_4|))) 4294967296)))))) (or (= (* 2 (mod (* (select (select |c_#memory_int#7| |c_func_to_recursive_line_35_to_46_0_#in~b.base|) |c_func_to_recursive_line_35_to_46_0_#in~b.offset|) (select (select |c_#memory_int#6| |c_func_to_recursive_line_35_to_46_0_#in~a.base|) |c_func_to_recursive_line_35_to_46_0_#in~a.offset|)) 2147483648)) (mod (+ (* (select (select |c_old(#memory_int#3)| |c_func_to_recursive_line_35_to_46_0_#in~x.base|) |c_func_to_recursive_line_35_to_46_0_#in~x.offset|) (select (select |c_old(#memory_int#4)| |c_func_to_recursive_line_35_to_46_0_#in~u.base|) |c_func_to_recursive_line_35_to_46_0_#in~u.offset|)) (* (select (select |c_old(#memory_int#5)| |c_func_to_recursive_line_35_to_46_0_#in~v.base|) |c_func_to_recursive_line_35_to_46_0_#in~v.offset|) (select (select |c_old(#memory_int#1)| |c_func_to_recursive_line_35_to_46_0_#in~y.base|) |c_func_to_recursive_line_35_to_46_0_#in~y.offset|))) 4294967296)) (forall ((|v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_4| Int)) (= (* 2 (mod (* (select (select |c_#memory_int#7| |v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#6| |v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_4|)) 2147483648)) (mod (+ (* (select (select |c_#memory_int#3| |v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#4| |v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_4|)) (* (select (select |c_#memory_int#5| |v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#1| |v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_4|))) 4294967296))))) is different from false [2024-10-14 03:20:27,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:20:27,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610331558] [2024-10-14 03:20:27,365 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 03:20:27,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985830075] [2024-10-14 03:20:27,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985830075] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:20:27,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:20:27,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-10-14 03:20:27,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930120232] [2024-10-14 03:20:27,365 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 03:20:27,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 03:20:27,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:20:27,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 03:20:27,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=328, Unknown=1, NotChecked=36, Total=420 [2024-10-14 03:20:27,367 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 15 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 03:20:40,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-10-14 03:20:41,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:20:41,949 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-10-14 03:20:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:20:41,950 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 55 [2024-10-14 03:20:41,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:20:41,952 INFO L225 Difference]: With dead ends: 71 [2024-10-14 03:20:41,952 INFO L226 Difference]: Without dead ends: 61 [2024-10-14 03:20:41,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=111, Invalid=648, Unknown=1, NotChecked=52, Total=812 [2024-10-14 03:20:41,953 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:20:41,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 104 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2024-10-14 03:20:41,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-14 03:20:41,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-14 03:20:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.075) internal successors, (43), 41 states have internal predecessors, (43), 13 states have call successors, (13), 9 states have call predecessors, (13), 7 states have return successors, (17), 10 states have call predecessors, (17), 12 states have call successors, (17) [2024-10-14 03:20:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2024-10-14 03:20:41,971 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 55 [2024-10-14 03:20:41,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:20:41,972 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2024-10-14 03:20:41,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 03:20:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2024-10-14 03:20:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 03:20:41,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:20:41,973 INFO L215 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] [2024-10-14 03:20:41,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 03:20:42,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:20:42,174 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:20:42,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:20:42,174 INFO L85 PathProgramCache]: Analyzing trace with hash -738199481, now seen corresponding path program 1 times [2024-10-14 03:20:42,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:20:42,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540188178] [2024-10-14 03:20:42,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:20:42,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:20:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 03:20:42,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2085560380] [2024-10-14 03:20:42,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:20:42,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:20:42,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:20:42,263 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) [2024-10-14 03:20:42,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 03:20:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:20:42,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 176 conjuncts are in the unsatisfiable core [2024-10-14 03:20:42,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:20:42,592 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 [2024-10-14 03:20:42,618 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 [2024-10-14 03:20:42,649 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 [2024-10-14 03:20:42,698 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 [2024-10-14 03:20:42,748 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 [2024-10-14 03:20:42,798 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 [2024-10-14 03:20:43,062 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 [2024-10-14 03:20:43,092 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 [2024-10-14 03:20:43,149 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 [2024-10-14 03:20:43,180 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 [2024-10-14 03:20:51,525 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 [2024-10-14 03:20:51,599 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 [2024-10-14 03:20:52,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 36 treesize of output 24 [2024-10-14 03:20:52,550 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 [2024-10-14 03:20:52,588 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 32 treesize of output 20 [2024-10-14 03:20:52,627 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 47 treesize of output 31 [2024-10-14 03:20:52,662 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 17 treesize of output 9 [2024-10-14 03:20:52,731 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 26 treesize of output 14 [2024-10-14 03:20:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-14 03:20:53,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:21:06,790 WARN L286 SmtUtils]: Spent 7.48s on a formula simplification that was a NOOP. DAG size: 169 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-14 03:21:13,410 WARN L286 SmtUtils]: Spent 5.78s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)