/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/recursified_loop-invariants/recursified_linear-inequality-inv-a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 17:48:12,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 17:48:12,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 17:48:12,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 17:48:12,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 17:48:12,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 17:48:12,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 17:48:12,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 17:48:12,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 17:48:12,731 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 17:48:12,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 17:48:12,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 17:48:12,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 17:48:12,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 17:48:12,734 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 17:48:12,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 17:48:12,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 17:48:12,734 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 17:48:12,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 17:48:12,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 17:48:12,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 17:48:12,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 17:48:12,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 17:48:12,735 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 17:48:12,736 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 17:48:12,736 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 17:48:12,736 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 17:48:12,736 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 17:48:12,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 17:48:12,736 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 17:48:12,737 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 17:48:12,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 17:48:12,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 17:48:12,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 17:48:12,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:48:12,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 17:48:12,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 17:48:12,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 17:48:12,738 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 17:48:12,738 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 17:48:12,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 17:48:12,739 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 17:48:12,739 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 17:48:12,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 17:48:12,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 17:48:12,739 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 17:48:12,739 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 [2023-12-16 17:48:12,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 17:48:12,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 17:48:12,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 17:48:12,921 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 17:48:12,921 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 17:48:12,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursified_loop-invariants/recursified_linear-inequality-inv-a.c [2023-12-16 17:48:13,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 17:48:14,064 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 17:48:14,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-invariants/recursified_linear-inequality-inv-a.c [2023-12-16 17:48:14,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c646f1f0f/d1292d6b756d41a0a1caa1d2b86215e2/FLAG903fc50f9 [2023-12-16 17:48:14,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c646f1f0f/d1292d6b756d41a0a1caa1d2b86215e2 [2023-12-16 17:48:14,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 17:48:14,482 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 17:48:14,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 17:48:14,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 17:48:14,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 17:48:14,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:48:14" (1/1) ... [2023-12-16 17:48:14,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bfe27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:14, skipping insertion in model container [2023-12-16 17:48:14,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:48:14" (1/1) ... [2023-12-16 17:48:14,505 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 17:48:14,620 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1474,1487] [2023-12-16 17:48:14,624 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1547,1560] [2023-12-16 17:48:14,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:48:14,638 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 17:48:14,654 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1474,1487] [2023-12-16 17:48:14,656 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1547,1560] [2023-12-16 17:48:14,657 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:48:14,670 INFO L206 MainTranslator]: Completed translation [2023-12-16 17:48:14,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:14 WrapperNode [2023-12-16 17:48:14,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 17:48:14,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 17:48:14,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 17:48:14,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 17:48:14,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:14" (1/1) ... [2023-12-16 17:48:14,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:14" (1/1) ... [2023-12-16 17:48:14,705 INFO L138 Inliner]: procedures = 16, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2023-12-16 17:48:14,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 17:48:14,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 17:48:14,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 17:48:14,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 17:48:14,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:14" (1/1) ... [2023-12-16 17:48:14,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:14" (1/1) ... [2023-12-16 17:48:14,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:14" (1/1) ... [2023-12-16 17:48:14,726 INFO L175 MemorySlicer]: Split 18 memory accesses to 5 slices as follows [2, 4, 5, 3, 4]. 28 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 3 writes are split as follows [0, 1, 1, 0, 1]. [2023-12-16 17:48:14,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:14" (1/1) ... [2023-12-16 17:48:14,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:14" (1/1) ... [2023-12-16 17:48:14,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:14" (1/1) ... [2023-12-16 17:48:14,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:14" (1/1) ... [2023-12-16 17:48:14,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:14" (1/1) ... [2023-12-16 17:48:14,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:14" (1/1) ... [2023-12-16 17:48:14,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 17:48:14,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 17:48:14,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 17:48:14,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 17:48:14,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:14" (1/1) ... [2023-12-16 17:48:14,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:48:14,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 17:48:14,765 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) [2023-12-16 17:48:14,774 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 [2023-12-16 17:48:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 17:48:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-16 17:48:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-16 17:48:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-16 17:48:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-16 17:48:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-16 17:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 17:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 17:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 17:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-16 17:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-16 17:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-16 17:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-16 17:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-16 17:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-16 17:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-16 17:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 17:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 17:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 17:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-16 17:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-16 17:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-16 17:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 17:48:14,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 17:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-16 17:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-16 17:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-16 17:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-16 17:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-16 17:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 17:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 17:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 17:48:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-16 17:48:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-16 17:48:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-16 17:48:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_12_to_15_0 [2023-12-16 17:48:14,791 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_12_to_15_0 [2023-12-16 17:48:14,865 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 17:48:14,866 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 17:48:15,056 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 17:48:15,080 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 17:48:15,080 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 17:48:15,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:48:15 BoogieIcfgContainer [2023-12-16 17:48:15,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 17:48:15,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 17:48:15,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 17:48:15,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 17:48:15,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:48:14" (1/3) ... [2023-12-16 17:48:15,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c55f291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:48:15, skipping insertion in model container [2023-12-16 17:48:15,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:14" (2/3) ... [2023-12-16 17:48:15,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c55f291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:48:15, skipping insertion in model container [2023-12-16 17:48:15,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:48:15" (3/3) ... [2023-12-16 17:48:15,086 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_linear-inequality-inv-a.c [2023-12-16 17:48:15,098 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 17:48:15,098 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-16 17:48:15,128 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 17:48:15,133 INFO L357 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, mHoare=true, 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;@1a92d358, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 17:48:15,133 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-16 17:48:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 17:48:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 17:48:15,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:48:15,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:48:15,142 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:48:15,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:48:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash 947785726, now seen corresponding path program 1 times [2023-12-16 17:48:15,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:48:15,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114534058] [2023-12-16 17:48:15,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:48:15,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:48:15,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:48:15,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:48:15,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 17:48:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:48:15,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 17:48:15,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:15,418 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 [2023-12-16 17:48:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:48:15,435 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:48:15,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:48:15,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114534058] [2023-12-16 17:48:15,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114534058] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:48:15,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:48:15,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:48:15,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14579665] [2023-12-16 17:48:15,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:48:15,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:48:15,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:48:15,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:48:15,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:48:15,472 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 17:48:15,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:48:15,571 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-12-16 17:48:15,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:48:15,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-12-16 17:48:15,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:48:15,579 INFO L225 Difference]: With dead ends: 28 [2023-12-16 17:48:15,579 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 17:48:15,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 17:48:15,585 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:48:15,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:48:15,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 17:48:15,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2023-12-16 17:48:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 17:48:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-12-16 17:48:15,619 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 10 [2023-12-16 17:48:15,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:48:15,620 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-12-16 17:48:15,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 17:48:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2023-12-16 17:48:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 17:48:15,622 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:48:15,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:48:15,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 17:48:15,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:48:15,825 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:48:15,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:48:15,826 INFO L85 PathProgramCache]: Analyzing trace with hash -683409516, now seen corresponding path program 1 times [2023-12-16 17:48:15,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:48:15,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041589979] [2023-12-16 17:48:15,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:48:15,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:48:15,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:48:15,836 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:48:15,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 17:48:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:48:15,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 17:48:15,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:48:15,970 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:48:15,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:48:15,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041589979] [2023-12-16 17:48:15,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041589979] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:48:15,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:48:15,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:48:15,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119570525] [2023-12-16 17:48:15,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:48:15,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:48:15,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:48:15,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:48:15,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:48:15,973 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 17:48:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:48:16,032 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2023-12-16 17:48:16,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:48:16,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-12-16 17:48:16,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:48:16,033 INFO L225 Difference]: With dead ends: 22 [2023-12-16 17:48:16,033 INFO L226 Difference]: Without dead ends: 17 [2023-12-16 17:48:16,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 17:48:16,034 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:48:16,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 34 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:48:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-16 17:48:16,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-16 17:48:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 17:48:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-12-16 17:48:16,037 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2023-12-16 17:48:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:48:16,037 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-12-16 17:48:16,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 17:48:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-12-16 17:48:16,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 17:48:16,038 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:48:16,038 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:48:16,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-16 17:48:16,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:48:16,239 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:48:16,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:48:16,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1341401249, now seen corresponding path program 1 times [2023-12-16 17:48:16,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:48:16,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380266119] [2023-12-16 17:48:16,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:48:16,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:48:16,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:48:16,241 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:48:16,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 17:48:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:48:16,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-16 17:48:16,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:16,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-12-16 17:48:16,456 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 21 treesize of output 13 [2023-12-16 17:48:16,459 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 18 treesize of output 10 [2023-12-16 17:48:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:48:16,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:16,697 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 14 [2023-12-16 17:48:16,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:48:16,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380266119] [2023-12-16 17:48:16,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380266119] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:48:16,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1641531553] [2023-12-16 17:48:16,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:48:16,729 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:48:16,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:48:16,782 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:48:16,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-16 17:48:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:48:16,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-16 17:48:16,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:16,977 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 12 treesize of output 8 [2023-12-16 17:48:17,063 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 25 treesize of output 17 [2023-12-16 17:48:17,106 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 [2023-12-16 17:48:17,109 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 18 treesize of output 10 [2023-12-16 17:48:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:48:17,130 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:17,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1641531553] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:48:17,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:48:17,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-12-16 17:48:17,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025496380] [2023-12-16 17:48:17,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:48:17,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 17:48:17,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:48:17,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 17:48:17,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-12-16 17:48:17,372 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 17:48:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:48:17,704 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-12-16 17:48:17,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 17:48:17,704 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 15 [2023-12-16 17:48:17,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:48:17,705 INFO L225 Difference]: With dead ends: 30 [2023-12-16 17:48:17,705 INFO L226 Difference]: Without dead ends: 26 [2023-12-16 17:48:17,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2023-12-16 17:48:17,706 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:48:17,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 51 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 17:48:17,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-16 17:48:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2023-12-16 17:48:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 17:48:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-12-16 17:48:17,710 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2023-12-16 17:48:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:48:17,710 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-12-16 17:48:17,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 17:48:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-12-16 17:48:17,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-16 17:48:17,711 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:48:17,711 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:48:17,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 17:48:17,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2023-12-16 17:48:18,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 17:48:18,114 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:48:18,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:48:18,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1366238291, now seen corresponding path program 1 times [2023-12-16 17:48:18,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:48:18,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516898111] [2023-12-16 17:48:18,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:48:18,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:48:18,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:48:18,117 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:48:18,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 17:48:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:48:18,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 17:48:18,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:18,217 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 23 treesize of output 19 [2023-12-16 17:48:18,223 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_9 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_9)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) is different from true [2023-12-16 17:48:18,250 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 21 treesize of output 13 [2023-12-16 17:48:18,270 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 [2023-12-16 17:48:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-12-16 17:48:18,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:18,399 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 16 treesize of output 12 [2023-12-16 17:48:18,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:48:18,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516898111] [2023-12-16 17:48:18,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516898111] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:48:18,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1923884639] [2023-12-16 17:48:18,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:48:18,419 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:48:18,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:48:18,428 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:48:18,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-16 17:48:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:48:18,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-16 17:48:18,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:18,570 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 23 treesize of output 19 [2023-12-16 17:48:18,577 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_13 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_13)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) is different from true [2023-12-16 17:48:18,601 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 21 treesize of output 13 [2023-12-16 17:48:18,632 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 [2023-12-16 17:48:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-12-16 17:48:18,645 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:18,723 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 16 treesize of output 12 [2023-12-16 17:48:18,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1923884639] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:48:18,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:48:18,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-12-16 17:48:18,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106241166] [2023-12-16 17:48:18,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:48:18,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 17:48:18,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:48:18,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 17:48:18,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=97, Unknown=2, NotChecked=42, Total=182 [2023-12-16 17:48:18,745 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 11 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 17:48:18,797 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_9)) .cse1))))) (exists ((v_arrayElimCell_13 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_13)) .cse1)))))))) is different from true [2023-12-16 17:48:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:48:18,829 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2023-12-16 17:48:18,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 17:48:18,829 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 11 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 16 [2023-12-16 17:48:18,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:48:18,829 INFO L225 Difference]: With dead ends: 26 [2023-12-16 17:48:18,829 INFO L226 Difference]: Without dead ends: 21 [2023-12-16 17:48:18,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=114, Unknown=3, NotChecked=72, Total=240 [2023-12-16 17:48:18,830 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:48:18,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 53 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 77 Unchecked, 0.1s Time] [2023-12-16 17:48:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-16 17:48:18,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-16 17:48:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 17:48:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-12-16 17:48:18,834 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2023-12-16 17:48:18,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:48:18,834 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-12-16 17:48:18,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 11 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 17:48:18,834 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-12-16 17:48:18,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 17:48:18,834 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:48:18,835 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:48:18,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-12-16 17:48:19,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 17:48:19,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:48:19,237 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:48:19,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:48:19,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2114283542, now seen corresponding path program 2 times [2023-12-16 17:48:19,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:48:19,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848948590] [2023-12-16 17:48:19,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:48:19,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:48:19,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:48:19,239 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:48:19,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 17:48:19,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 17:48:19,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:48:19,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-16 17:48:19,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:19,387 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 23 treesize of output 19 [2023-12-16 17:48:19,496 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_17 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_17)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-16 17:48:19,506 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 29 treesize of output 21 [2023-12-16 17:48:19,540 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 18 [2023-12-16 17:48:19,543 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 21 treesize of output 13 [2023-12-16 17:48:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2023-12-16 17:48:19,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:19,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-12-16 17:48:19,988 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 21 treesize of output 17 [2023-12-16 17:48:20,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:48:20,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848948590] [2023-12-16 17:48:20,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848948590] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:48:20,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2109738371] [2023-12-16 17:48:20,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:48:20,025 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:48:20,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:48:20,026 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:48:20,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-16 17:48:20,203 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 17:48:20,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482031853] [2023-12-16 17:48:20,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:48:20,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 17:48:20,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 17:48:20,208 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 17:48:20,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 1 [2023-12-16 17:48:20,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-16 17:48:20,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 17:48:20,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:48:20,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-16 17:48:20,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:20,325 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 23 treesize of output 19 [2023-12-16 17:48:20,382 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 12 treesize of output 8 [2023-12-16 17:48:20,513 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_17 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_17)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse1)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_36| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_36|))))) is different from true [2023-12-16 17:48:20,526 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 29 treesize of output 21 [2023-12-16 17:48:20,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2023-12-16 17:48:20,621 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 14 [2023-12-16 17:48:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2023-12-16 17:48:20,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:21,347 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 23 treesize of output 19 [2023-12-16 17:48:21,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482031853] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:48:21,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:48:21,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2023-12-16 17:48:21,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023683976] [2023-12-16 17:48:21,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:48:21,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 17:48:21,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:48:21,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 17:48:21,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=174, Unknown=2, NotChecked=54, Total=272 [2023-12-16 17:48:21,411 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 17:48:21,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:48:21,881 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-12-16 17:48:21,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 17:48:21,881 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 20 [2023-12-16 17:48:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:48:21,882 INFO L225 Difference]: With dead ends: 30 [2023-12-16 17:48:21,882 INFO L226 Difference]: Without dead ends: 28 [2023-12-16 17:48:21,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=341, Unknown=2, NotChecked=78, Total=506 [2023-12-16 17:48:21,883 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 17:48:21,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 61 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 84 Unchecked, 0.3s Time] [2023-12-16 17:48:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-16 17:48:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2023-12-16 17:48:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 17:48:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-12-16 17:48:21,887 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2023-12-16 17:48:21,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:48:21,887 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-12-16 17:48:21,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 17:48:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-12-16 17:48:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 17:48:21,888 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:48:21,888 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:48:21,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-16 17:48:22,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-16 17:48:22,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 17:48:22,291 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:48:22,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:48:22,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1118284412, now seen corresponding path program 2 times [2023-12-16 17:48:22,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:48:22,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418466698] [2023-12-16 17:48:22,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:48:22,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:48:22,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:48:22,293 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:48:22,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 17:48:22,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 17:48:22,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:48:22,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 17:48:22,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:22,423 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 23 treesize of output 19 [2023-12-16 17:48:22,455 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 23 treesize of output 19 [2023-12-16 17:48:22,461 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_29)))))))) is different from true [2023-12-16 17:48:22,492 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_29 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_29)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_28)))))))) is different from true [2023-12-16 17:48:22,504 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 25 treesize of output 17 [2023-12-16 17:48:22,547 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 21 treesize of output 13 [2023-12-16 17:48:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2023-12-16 17:48:22,573 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:22,796 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 23 treesize of output 19 [2023-12-16 17:48:22,798 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 15 [2023-12-16 17:48:22,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:48:22,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418466698] [2023-12-16 17:48:22,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418466698] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:48:22,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1821117444] [2023-12-16 17:48:22,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:48:22,827 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:48:22,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:48:22,841 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:48:22,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-12-16 17:48:23,014 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 17:48:23,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600157044] [2023-12-16 17:48:23,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:48:23,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 17:48:23,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 17:48:23,021 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 17:48:23,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 1 [2023-12-16 17:48:23,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-16 17:48:23,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 17:48:23,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:48:23,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 17:48:23,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:23,131 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 23 treesize of output 19 [2023-12-16 17:48:23,163 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 23 treesize of output 19 [2023-12-16 17:48:23,168 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_35 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_35)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) is different from true [2023-12-16 17:48:23,203 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_35)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_28)))))))) is different from true [2023-12-16 17:48:23,212 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 25 treesize of output 17 [2023-12-16 17:48:23,231 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 21 treesize of output 13 [2023-12-16 17:48:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2023-12-16 17:48:23,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:23,437 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 23 treesize of output 19 [2023-12-16 17:48:23,438 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 15 [2023-12-16 17:48:23,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600157044] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:48:23,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:48:23,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2023-12-16 17:48:23,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723040015] [2023-12-16 17:48:23,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:48:23,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 17:48:23,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:48:23,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 17:48:23,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=86, Unknown=4, NotChecked=84, Total=210 [2023-12-16 17:48:23,475 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 12 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 17:48:23,601 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_35)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_28))))))) (exists ((v_arrayElimCell_29 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_29)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_28)))))))))) is different from true [2023-12-16 17:48:23,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:48:23,643 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2023-12-16 17:48:23,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 17:48:23,644 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 12 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 21 [2023-12-16 17:48:23,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:48:23,644 INFO L225 Difference]: With dead ends: 28 [2023-12-16 17:48:23,644 INFO L226 Difference]: Without dead ends: 23 [2023-12-16 17:48:23,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=102, Unknown=5, NotChecked=120, Total=272 [2023-12-16 17:48:23,646 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:48:23,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 109 Unchecked, 0.1s Time] [2023-12-16 17:48:23,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-16 17:48:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-16 17:48:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 17:48:23,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2023-12-16 17:48:23,649 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2023-12-16 17:48:23,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:48:23,650 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2023-12-16 17:48:23,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 12 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 17:48:23,650 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2023-12-16 17:48:23,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 17:48:23,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:48:23,650 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:48:23,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 17:48:23,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-16 17:48:24,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 17:48:24,061 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:48:24,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:48:24,061 INFO L85 PathProgramCache]: Analyzing trace with hash -442591433, now seen corresponding path program 3 times [2023-12-16 17:48:24,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:48:24,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186076618] [2023-12-16 17:48:24,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 17:48:24,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:48:24,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:48:24,063 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:48:24,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-16 17:48:24,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-16 17:48:24,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:48:24,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-16 17:48:24,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:24,255 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 23 treesize of output 19 [2023-12-16 17:48:24,307 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 23 treesize of output 19 [2023-12-16 17:48:24,397 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_40 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_40)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-16 17:48:24,412 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_40 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_42)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_40)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-16 17:48:24,421 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 32 treesize of output 24 [2023-12-16 17:48:24,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-12-16 17:48:24,455 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 24 treesize of output 16 [2023-12-16 17:48:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 10 not checked. [2023-12-16 17:48:24,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:25,091 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 32 [2023-12-16 17:48:25,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 32 treesize of output 28 [2023-12-16 17:48:25,094 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 28 treesize of output 20 [2023-12-16 17:48:25,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:48:25,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186076618] [2023-12-16 17:48:25,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186076618] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:48:25,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [543554435] [2023-12-16 17:48:25,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 17:48:25,137 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:48:25,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:48:25,156 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:48:25,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-12-16 17:48:25,395 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 17:48:25,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666788827] [2023-12-16 17:48:25,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 17:48:25,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 17:48:25,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 17:48:25,398 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 17:48:25,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 1 [2023-12-16 17:48:25,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-16 17:48:25,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-16 17:48:25,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:48:25,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-16 17:48:25,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:25,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 23 treesize of output 19 [2023-12-16 17:48:25,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 23 treesize of output 19 [2023-12-16 17:48:25,736 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 12 treesize of output 8 [2023-12-16 17:48:25,830 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_85| (_ BitVec 8))) (= .cse0 ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_85|))) (exists ((v_arrayElimCell_40 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_40)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse0)))))))))) is different from true [2023-12-16 17:48:25,852 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_85| (_ BitVec 8))) (= .cse0 ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_85|))) (exists ((v_arrayElimCell_40 (_ BitVec 32)) (v_arrayElimCell_51 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_40)) (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_51)))))) |c_#memory_int#2|)))) is different from true [2023-12-16 17:48:25,866 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 32 treesize of output 24 [2023-12-16 17:48:25,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2023-12-16 17:48:25,922 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 [2023-12-16 17:48:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 10 not checked. [2023-12-16 17:48:26,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:26,940 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 26 [2023-12-16 17:48:26,941 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 22 [2023-12-16 17:48:27,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666788827] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:48:27,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:48:27,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2023-12-16 17:48:27,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22482533] [2023-12-16 17:48:27,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:48:27,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 17:48:27,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:48:27,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 17:48:27,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=176, Unknown=4, NotChecked=116, Total=342 [2023-12-16 17:48:27,048 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 16 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 7 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-16 17:48:27,449 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (v_arrayElimCell_40 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_42)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_40)) .cse1 .cse2))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_85| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_85|))) (exists ((v_arrayElimCell_40 (_ BitVec 32)) (v_arrayElimCell_51 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_40)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_51))))) |c_#memory_int#2|))))) is different from true [2023-12-16 17:48:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:48:27,543 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2023-12-16 17:48:27,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 17:48:27,544 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 7 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) Word has length 25 [2023-12-16 17:48:27,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:48:27,544 INFO L225 Difference]: With dead ends: 32 [2023-12-16 17:48:27,544 INFO L226 Difference]: Without dead ends: 30 [2023-12-16 17:48:27,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=344, Unknown=5, NotChecked=210, Total=650 [2023-12-16 17:48:27,545 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 17:48:27,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 62 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 167 Unchecked, 0.3s Time] [2023-12-16 17:48:27,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-16 17:48:27,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2023-12-16 17:48:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 17:48:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-12-16 17:48:27,548 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2023-12-16 17:48:27,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:48:27,549 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-12-16 17:48:27,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 7 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-16 17:48:27,549 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2023-12-16 17:48:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 17:48:27,549 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:48:27,549 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:48:27,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-16 17:48:27,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-16 17:48:27,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:48:27,953 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:48:27,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:48:27,953 INFO L85 PathProgramCache]: Analyzing trace with hash -835428485, now seen corresponding path program 3 times [2023-12-16 17:48:27,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:48:27,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434748330] [2023-12-16 17:48:27,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 17:48:27,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:48:27,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:48:27,955 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:48:27,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-16 17:48:28,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-16 17:48:28,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:48:28,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-16 17:48:28,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:28,126 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 23 treesize of output 19 [2023-12-16 17:48:28,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2023-12-16 17:48:28,185 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 23 treesize of output 19 [2023-12-16 17:48:28,191 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_59 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_59)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) is different from true [2023-12-16 17:48:28,211 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_59 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_59)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_57)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) is different from true [2023-12-16 17:48:28,223 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_59 (_ BitVec 32)) (v_arrayElimCell_60 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_59)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_60)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_57)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) is different from true [2023-12-16 17:48:28,231 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 28 treesize of output 20 [2023-12-16 17:48:28,258 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 24 treesize of output 16 [2023-12-16 17:48:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2023-12-16 17:48:28,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:28,646 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 26 [2023-12-16 17:48:28,649 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 22 [2023-12-16 17:48:28,650 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 18 [2023-12-16 17:48:28,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:48:28,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434748330] [2023-12-16 17:48:28,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434748330] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:48:28,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [75842048] [2023-12-16 17:48:28,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 17:48:28,708 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:48:28,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:48:28,709 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:48:28,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-12-16 17:48:28,921 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 17:48:28,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241064114] [2023-12-16 17:48:28,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 17:48:28,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 17:48:28,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 17:48:28,922 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 17:48:28,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-16 17:48:28,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 1 [2023-12-16 17:48:29,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-16 17:48:29,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:48:29,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-16 17:48:29,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:29,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 23 treesize of output 19 [2023-12-16 17:48:29,127 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 23 treesize of output 19 [2023-12-16 17:48:29,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 23 treesize of output 19 [2023-12-16 17:48:29,185 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_68 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_68)))))))) is different from true [2023-12-16 17:48:29,207 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_68 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_57)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_68)))))))) is different from true [2023-12-16 17:48:29,219 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_69 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_68 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_57)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_69)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_68)))))) |c_#memory_int#2|)) is different from true [2023-12-16 17:48:29,229 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 28 treesize of output 20 [2023-12-16 17:48:29,252 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 24 treesize of output 16 [2023-12-16 17:48:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2023-12-16 17:48:29,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:29,587 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 26 [2023-12-16 17:48:29,589 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 22 [2023-12-16 17:48:29,590 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 18 [2023-12-16 17:48:29,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241064114] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:48:29,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:48:29,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2023-12-16 17:48:29,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113443403] [2023-12-16 17:48:29,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:48:29,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 17:48:29,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:48:29,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 17:48:29,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=88, Unknown=6, NotChecked=138, Total=272 [2023-12-16 17:48:29,630 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-16 17:48:29,773 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_68 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_57)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_68))))))) (exists ((v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_59 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_59)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_57)) .cse1)))))))) is different from true [2023-12-16 17:48:29,777 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_59 (_ BitVec 32)) (v_arrayElimCell_60 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_59)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_60)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_57)) .cse1))))) (exists ((v_arrayElimCell_69 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_arrayElimCell_68 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_57)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_69)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_68))))) |c_#memory_int#2|))))) is different from true [2023-12-16 17:48:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:48:29,828 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-12-16 17:48:29,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 17:48:29,829 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) Word has length 26 [2023-12-16 17:48:29,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:48:29,829 INFO L225 Difference]: With dead ends: 30 [2023-12-16 17:48:29,829 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 17:48:29,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=8, NotChecked=216, Total=380 [2023-12-16 17:48:29,830 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:48:29,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 47 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 180 Unchecked, 0.2s Time] [2023-12-16 17:48:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 17:48:29,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-16 17:48:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 17:48:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2023-12-16 17:48:29,835 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 26 [2023-12-16 17:48:29,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:48:29,835 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-12-16 17:48:29,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-16 17:48:29,835 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2023-12-16 17:48:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-16 17:48:29,836 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:48:29,836 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:48:29,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-16 17:48:30,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-16 17:48:30,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 17:48:30,242 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:48:30,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:48:30,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2069291986, now seen corresponding path program 4 times [2023-12-16 17:48:30,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:48:30,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434900161] [2023-12-16 17:48:30,242 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 17:48:30,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:48:30,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:48:30,244 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:48:30,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-16 17:48:30,389 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 17:48:30,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:48:30,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-16 17:48:30,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:30,443 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 23 treesize of output 19 [2023-12-16 17:48:30,495 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 23 treesize of output 19 [2023-12-16 17:48:30,546 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 23 treesize of output 19 [2023-12-16 17:48:30,646 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_75 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75)))))))) is different from true [2023-12-16 17:48:30,661 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_78 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_78)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75)))))))) is different from true [2023-12-16 17:48:30,679 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_79 (_ BitVec 32)) (v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_78 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_78)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_79)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75)))))))) is different from true [2023-12-16 17:48:30,690 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 27 [2023-12-16 17:48:30,736 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 24 [2023-12-16 17:48:30,738 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 27 treesize of output 19 [2023-12-16 17:48:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 18 not checked. [2023-12-16 17:48:30,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:32,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2023-12-16 17:48:32,150 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 35 treesize of output 31 [2023-12-16 17:48:32,151 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 31 treesize of output 27 [2023-12-16 17:48:32,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2023-12-16 17:48:32,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:48:32,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434900161] [2023-12-16 17:48:32,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434900161] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:48:32,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1907264153] [2023-12-16 17:48:32,210 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 17:48:32,210 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:48:32,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:48:32,211 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:48:32,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-12-16 17:48:32,436 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 17:48:32,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:48:32,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-16 17:48:32,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:32,498 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 23 treesize of output 19 [2023-12-16 17:48:32,559 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 23 treesize of output 19 [2023-12-16 17:48:32,601 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 23 treesize of output 19 [2023-12-16 17:48:32,638 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 12 treesize of output 8 [2023-12-16 17:48:32,726 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_151| (_ BitVec 8))) (= .cse0 ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_151|))) (exists ((v_arrayElimCell_75 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse0)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75)))))))))) is different from true [2023-12-16 17:48:32,748 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_90)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_151| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_151|))))) is different from true [2023-12-16 17:48:32,767 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) (and (exists ((v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_90)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse1)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_91)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75)))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_151| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_151|))))) is different from true [2023-12-16 17:48:32,782 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 27 [2023-12-16 17:48:32,877 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 40 treesize of output 28 [2023-12-16 17:48:32,887 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 28 treesize of output 20 [2023-12-16 17:48:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 18 not checked. [2023-12-16 17:48:41,093 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:42,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2023-12-16 17:48:42,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2023-12-16 17:48:42,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2023-12-16 17:48:42,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1907264153] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:48:42,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:48:42,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-12-16 17:48:42,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570035504] [2023-12-16 17:48:42,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:48:42,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 17:48:42,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:48:42,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 17:48:42,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=231, Unknown=8, NotChecked=210, Total=506 [2023-12-16 17:48:42,767 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 20 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-16 17:48:43,490 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_90)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_151| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_151|))) (exists ((v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_78 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_78)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75)))))))))) is different from true [2023-12-16 17:48:43,497 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|)) (.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse3)))) (and (exists ((v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_90)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_91)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75))))))) (exists ((|v_func_to_recursive_line_12_to_15_0_#t~nondet6_151| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_func_to_recursive_line_12_to_15_0_#t~nondet6_151|))) (exists ((v_arrayElimCell_79 (_ BitVec 32)) (v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_78 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_78)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_79)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_75)))))))))) is different from true [2023-12-16 17:48:43,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:48:43,718 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2023-12-16 17:48:43,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 17:48:43,719 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) Word has length 30 [2023-12-16 17:48:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:48:43,721 INFO L225 Difference]: With dead ends: 34 [2023-12-16 17:48:43,721 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 17:48:43,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=106, Invalid=422, Unknown=10, NotChecked=392, Total=930 [2023-12-16 17:48:43,723 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 17:48:43,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 86 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 272 Unchecked, 0.6s Time] [2023-12-16 17:48:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 17:48:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2023-12-16 17:48:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 17:48:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-12-16 17:48:43,730 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 30 [2023-12-16 17:48:43,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:48:43,731 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-12-16 17:48:43,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-16 17:48:43,731 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-12-16 17:48:43,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 17:48:43,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:48:43,735 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:48:43,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-16 17:48:43,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2023-12-16 17:48:44,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 17:48:44,146 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:48:44,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:48:44,146 INFO L85 PathProgramCache]: Analyzing trace with hash 276461924, now seen corresponding path program 4 times [2023-12-16 17:48:44,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:48:44,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124874051] [2023-12-16 17:48:44,146 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 17:48:44,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:48:44,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:48:44,147 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:48:44,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-16 17:48:44,298 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 17:48:44,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:48:44,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-16 17:48:44,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:44,340 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 23 treesize of output 19 [2023-12-16 17:48:44,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2023-12-16 17:48:44,410 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 23 treesize of output 19 [2023-12-16 17:48:44,437 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 23 treesize of output 19 [2023-12-16 17:48:44,443 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_101 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_101)))))) |c_#memory_int#2|)) is different from true [2023-12-16 17:48:44,463 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_101 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_101)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98)))))))) is different from true [2023-12-16 17:48:44,476 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_101 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_101)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98)))))))) is different from true [2023-12-16 17:48:44,491 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_101 (_ BitVec 32)) (v_arrayElimCell_103 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_103)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_101)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98)))))) |c_#memory_int#2|)) is different from true [2023-12-16 17:48:44,504 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 31 treesize of output 23 [2023-12-16 17:48:44,537 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 27 treesize of output 19 [2023-12-16 17:48:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 23 not checked. [2023-12-16 17:48:44,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:45,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2023-12-16 17:48:45,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2023-12-16 17:48:45,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2023-12-16 17:48:45,325 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 21 [2023-12-16 17:48:45,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:48:45,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124874051] [2023-12-16 17:48:45,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124874051] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:48:45,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [216067252] [2023-12-16 17:48:45,393 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 17:48:45,393 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:48:45,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:48:45,394 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:48:45,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-16 17:48:45,623 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 17:48:45,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:48:45,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-16 17:48:45,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:45,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 23 treesize of output 19 [2023-12-16 17:48:45,698 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 23 treesize of output 19 [2023-12-16 17:48:45,733 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 23 treesize of output 19 [2023-12-16 17:48:45,772 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 23 treesize of output 19 [2023-12-16 17:48:45,779 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_113 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_113)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) is different from true [2023-12-16 17:48:45,803 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_113)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98)))))))) is different from true [2023-12-16 17:48:45,818 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_113)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_114)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98)))))))) is different from true [2023-12-16 17:48:45,835 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_113)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_114)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_115)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98)))))))) is different from true [2023-12-16 17:48:45,847 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 31 treesize of output 23 [2023-12-16 17:48:45,894 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 27 treesize of output 19 [2023-12-16 17:48:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 23 not checked. [2023-12-16 17:48:46,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:47,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2023-12-16 17:48:47,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2023-12-16 17:48:47,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2023-12-16 17:48:47,119 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 21 [2023-12-16 17:48:47,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [216067252] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:48:47,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:48:47,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2023-12-16 17:48:47,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706902896] [2023-12-16 17:48:47,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:48:47,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 17:48:47,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:48:47,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 17:48:47,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=124, Unknown=8, NotChecked=232, Total=420 [2023-12-16 17:48:47,180 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 18 states, 15 states have (on average 1.6) internal successors, (24), 18 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-16 17:48:47,664 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_113)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98))))))) (exists ((v_arrayElimCell_101 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_101)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98)))))))))) is different from true [2023-12-16 17:48:47,670 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_113)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_114)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98))))))) (exists ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_101 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_101)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98)))))))))) is different from true [2023-12-16 17:48:47,677 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_113)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_114)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_115)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98))))))) (exists ((v_arrayElimCell_102 (_ BitVec 32)) (v_arrayElimCell_101 (_ BitVec 32)) (v_arrayElimCell_103 (_ BitVec 32)) (v_arrayElimCell_98 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_103)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_101)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_102)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_98))))) |c_#memory_int#2|))))) is different from true [2023-12-16 17:48:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:48:47,765 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2023-12-16 17:48:47,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 17:48:47,765 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.6) internal successors, (24), 18 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) Word has length 31 [2023-12-16 17:48:47,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:48:47,766 INFO L225 Difference]: With dead ends: 32 [2023-12-16 17:48:47,766 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 17:48:47,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=70, Invalid=145, Unknown=11, NotChecked=374, Total=600 [2023-12-16 17:48:47,767 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 17:48:47,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 272 Unchecked, 0.5s Time] [2023-12-16 17:48:47,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 17:48:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-16 17:48:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 17:48:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2023-12-16 17:48:47,770 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2023-12-16 17:48:47,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:48:47,770 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2023-12-16 17:48:47,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 1.6) internal successors, (24), 18 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-16 17:48:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2023-12-16 17:48:47,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 17:48:47,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:48:47,771 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:48:47,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2023-12-16 17:48:47,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-16 17:48:48,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:48:48,177 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:48:48,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:48:48,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1644200719, now seen corresponding path program 5 times [2023-12-16 17:48:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:48:48,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639813326] [2023-12-16 17:48:48,178 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 17:48:48,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:48:48,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:48:48,179 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:48:48,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-16 17:48:48,409 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-16 17:48:48,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:48:48,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 73 conjunts are in the unsatisfiable core [2023-12-16 17:48:48,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:48,467 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 23 treesize of output 19 [2023-12-16 17:48:48,529 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 23 treesize of output 19 [2023-12-16 17:48:48,577 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 23 treesize of output 19 [2023-12-16 17:48:48,625 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 23 treesize of output 19 [2023-12-16 17:48:48,722 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-16 17:48:48,735 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_126 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_126)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-16 17:48:48,751 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_126 (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_126)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_127)))))))) is different from true [2023-12-16 17:48:48,769 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_126 (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_126)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_127)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_128)))))))) is different from true [2023-12-16 17:48:48,779 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 38 treesize of output 30 [2023-12-16 17:48:48,872 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 35 treesize of output 27 [2023-12-16 17:48:48,875 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 22 [2023-12-16 17:48:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 28 not checked. [2023-12-16 17:48:52,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:54,199 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 50 treesize of output 46 [2023-12-16 17:48:54,200 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 38 [2023-12-16 17:48:54,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-12-16 17:48:54,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2023-12-16 17:48:54,207 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 26 [2023-12-16 17:48:54,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:48:54,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639813326] [2023-12-16 17:48:54,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639813326] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:48:54,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [586505395] [2023-12-16 17:48:54,283 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 17:48:54,283 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:48:54,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:48:54,284 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:48:54,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-12-16 17:48:54,574 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-16 17:48:54,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:48:54,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 77 conjunts are in the unsatisfiable core [2023-12-16 17:48:54,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:54,656 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 23 treesize of output 19 [2023-12-16 17:48:54,700 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 23 treesize of output 19 [2023-12-16 17:48:54,749 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 23 treesize of output 19 [2023-12-16 17:48:54,812 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 23 treesize of output 19 [2023-12-16 17:48:54,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 17:48:54,905 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_141 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_141)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-16 17:48:54,923 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_142 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_141)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_142)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-16 17:48:54,943 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_142 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32)) (v_arrayElimCell_143 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_141)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_143)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_142)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))) |c_#memory_int#2|)) is different from true [2023-12-16 17:48:54,958 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 38 treesize of output 30 [2023-12-16 17:48:55,018 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 35 treesize of output 27 [2023-12-16 17:48:55,021 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 22 [2023-12-16 17:49:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 28 not checked. [2023-12-16 17:49:06,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:49:08,614 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 42 treesize of output 38 [2023-12-16 17:49:08,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-12-16 17:49:08,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2023-12-16 17:49:08,619 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 26 [2023-12-16 17:49:12,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [586505395] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:49:12,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:49:12,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2023-12-16 17:49:12,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137455497] [2023-12-16 17:49:12,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:49:12,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 17:49:12,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:49:12,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 17:49:12,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=226, Unknown=10, NotChecked=252, Total=552 [2023-12-16 17:49:12,719 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 20 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-16 17:49:13,270 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_126 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_126)) .cse1 .cse2))))) (exists ((v_arrayElimCell_141 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_141)) .cse1 .cse2)))))))) is different from true [2023-12-16 17:49:13,278 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_142 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_141)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_142)) .cse1 .cse2))))) (exists ((v_arrayElimCell_126 (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_126)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_127)))))))))) is different from true [2023-12-16 17:49:13,286 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))) (and (exists ((v_arrayElimCell_126 (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_126)) .cse1 .cse2 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_127)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_128))))))) (exists ((v_arrayElimCell_142 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32)) (v_arrayElimCell_143 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_122)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_141)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_143)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_142)) .cse1 .cse2))) |c_#memory_int#2|))))) is different from true [2023-12-16 17:49:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:49:13,405 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2023-12-16 17:49:13,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 17:49:13,405 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) Word has length 35 [2023-12-16 17:49:13,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:49:13,406 INFO L225 Difference]: With dead ends: 36 [2023-12-16 17:49:13,406 INFO L226 Difference]: Without dead ends: 34 [2023-12-16 17:49:13,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=114, Invalid=419, Unknown=13, NotChecked=510, Total=1056 [2023-12-16 17:49:13,407 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 17:49:13,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 64 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 333 Unchecked, 0.3s Time] [2023-12-16 17:49:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-16 17:49:13,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2023-12-16 17:49:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 7 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-16 17:49:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2023-12-16 17:49:13,413 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 35 [2023-12-16 17:49:13,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:49:13,413 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2023-12-16 17:49:13,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-16 17:49:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2023-12-16 17:49:13,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 17:49:13,414 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:49:13,414 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:49:13,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-16 17:49:13,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-12-16 17:49:13,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 17:49:13,822 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:49:13,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:49:13,823 INFO L85 PathProgramCache]: Analyzing trace with hash -569381213, now seen corresponding path program 5 times [2023-12-16 17:49:13,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:49:13,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167965721] [2023-12-16 17:49:13,823 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 17:49:13,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:49:13,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:49:13,824 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:49:13,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-16 17:49:14,051 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-16 17:49:14,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:49:14,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-16 17:49:14,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:49:14,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 23 treesize of output 19 [2023-12-16 17:49:14,129 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 23 treesize of output 19 [2023-12-16 17:49:14,158 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 23 treesize of output 19 [2023-12-16 17:49:14,188 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 23 treesize of output 19 [2023-12-16 17:49:14,219 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 23 treesize of output 19 [2023-12-16 17:49:14,225 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_155 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) is different from true [2023-12-16 17:49:14,246 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)))))))) is different from true [2023-12-16 17:49:14,287 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_156 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_156)))))))) is different from true [2023-12-16 17:49:14,304 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_157 (_ BitVec 32)) (v_arrayElimCell_156 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_157)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_156)))))) |c_#memory_int#2|)) is different from true [2023-12-16 17:49:14,323 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_157 (_ BitVec 32)) (v_arrayElimCell_156 (_ BitVec 32)) (v_arrayElimCell_158 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_158)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_157)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_156)))))))) is different from true [2023-12-16 17:49:14,333 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 34 treesize of output 26 [2023-12-16 17:49:14,377 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 22 [2023-12-16 17:49:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 34 not checked. [2023-12-16 17:49:14,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:49:15,331 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 44 treesize of output 40 [2023-12-16 17:49:15,333 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 40 treesize of output 36 [2023-12-16 17:49:15,335 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 32 [2023-12-16 17:49:15,336 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 28 [2023-12-16 17:49:15,338 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 28 treesize of output 24 [2023-12-16 17:49:15,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:49:15,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167965721] [2023-12-16 17:49:15,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167965721] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:49:15,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1952164690] [2023-12-16 17:49:15,432 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 17:49:15,432 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:49:15,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:49:15,433 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:49:15,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-12-16 17:49:15,804 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-16 17:49:15,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:49:15,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-16 17:49:15,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:49:15,870 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 23 treesize of output 19 [2023-12-16 17:49:15,906 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 23 treesize of output 19 [2023-12-16 17:49:15,940 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 23 treesize of output 19 [2023-12-16 17:49:15,981 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 23 treesize of output 19 [2023-12-16 17:49:16,017 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 23 treesize of output 19 [2023-12-16 17:49:16,024 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_170 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))))) is different from true [2023-12-16 17:49:16,049 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)))))) |c_#memory_int#2|)) is different from true [2023-12-16 17:49:16,065 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_171)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)))))))) is different from true [2023-12-16 17:49:16,083 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_172)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_171)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)))))) |c_#memory_int#2|)) is different from true [2023-12-16 17:49:16,102 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_173 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_172)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_173)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_171)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)))))))) is different from true [2023-12-16 17:49:16,116 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 34 treesize of output 26 [2023-12-16 17:49:16,185 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 22 [2023-12-16 17:49:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 34 not checked. [2023-12-16 17:49:16,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:49:17,098 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 44 treesize of output 40 [2023-12-16 17:49:17,101 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 40 treesize of output 36 [2023-12-16 17:49:17,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 36 treesize of output 32 [2023-12-16 17:49:17,105 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 28 [2023-12-16 17:49:17,107 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 28 treesize of output 24 [2023-12-16 17:49:17,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1952164690] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:49:17,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:49:17,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-12-16 17:49:17,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061160297] [2023-12-16 17:49:17,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:49:17,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 17:49:17,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:49:17,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 17:49:17,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=126, Unknown=10, NotChecked=310, Total=506 [2023-12-16 17:49:17,196 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 20 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 20 states have internal predecessors, (26), 5 states have call successors, (5), 1 states have call predecessors, (5), 11 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-16 17:49:17,513 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151))))))) (exists ((v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151))))) |c_#memory_int#2|))))) is different from true [2023-12-16 17:49:17,519 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_171)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151))))))) (exists ((v_arrayElimCell_156 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_156)))))))))) is different from true [2023-12-16 17:49:17,526 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_157 (_ BitVec 32)) (v_arrayElimCell_156 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_157)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_156))))) |c_#memory_int#2|)) (exists ((v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_172)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_171)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151))))) |c_#memory_int#2|))))) is different from true [2023-12-16 17:49:17,534 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))) (and (exists ((v_arrayElimCell_157 (_ BitVec 32)) (v_arrayElimCell_156 (_ BitVec 32)) (v_arrayElimCell_158 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_155 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_158)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_155)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_157)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_156))))))) (exists ((v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_170 (_ BitVec 32)) (v_arrayElimCell_173 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_172)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_170)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_173)) .cse1 ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_171)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_151)))))))))) is different from true [2023-12-16 17:49:17,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:49:17,641 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2023-12-16 17:49:17,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 17:49:17,642 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 20 states have internal predecessors, (26), 5 states have call successors, (5), 1 states have call predecessors, (5), 11 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) Word has length 36 [2023-12-16 17:49:17,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:49:17,642 INFO L225 Difference]: With dead ends: 34 [2023-12-16 17:49:17,642 INFO L226 Difference]: Without dead ends: 29 [2023-12-16 17:49:17,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=148, Unknown=14, NotChecked=518, Total=756 [2023-12-16 17:49:17,643 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 363 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 17:49:17,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 50 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 363 Unchecked, 0.4s Time] [2023-12-16 17:49:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-16 17:49:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-16 17:49:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 17:49:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2023-12-16 17:49:17,646 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 36 [2023-12-16 17:49:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:49:17,646 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2023-12-16 17:49:17,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 20 states have internal predecessors, (26), 5 states have call successors, (5), 1 states have call predecessors, (5), 11 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-16 17:49:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2023-12-16 17:49:17,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 17:49:17,647 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:49:17,647 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:49:17,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-12-16 17:49:17,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-12-16 17:49:18,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:49:18,048 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:49:18,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:49:18,048 INFO L85 PathProgramCache]: Analyzing trace with hash 524889158, now seen corresponding path program 6 times [2023-12-16 17:49:18,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:49:18,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012988340] [2023-12-16 17:49:18,048 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-16 17:49:18,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:49:18,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:49:18,049 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:49:18,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-16 17:49:18,362 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-12-16 17:49:18,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:49:18,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 86 conjunts are in the unsatisfiable core [2023-12-16 17:49:18,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:49:18,427 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 23 treesize of output 19 [2023-12-16 17:49:18,491 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 23 treesize of output 19 [2023-12-16 17:49:18,539 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 23 treesize of output 19 [2023-12-16 17:49:18,587 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 23 treesize of output 19 [2023-12-16 17:49:18,635 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 23 treesize of output 19 [2023-12-16 17:49:18,744 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_181 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))) |c_#memory_int#2|)) is different from true [2023-12-16 17:49:18,760 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_181 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_186)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))) |c_#memory_int#2|)) is different from true [2023-12-16 17:49:18,778 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_181 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_186)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_187)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))) |c_#memory_int#2|)) is different from true [2023-12-16 17:49:18,798 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_181 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_arrayElimCell_188 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_186)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_187)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_188)))))))) is different from true [2023-12-16 17:49:18,820 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_189 (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32)) (v_arrayElimCell_186 (_ BitVec 32)) (v_arrayElimCell_188 (_ BitVec 32)) (v_arrayElimCell_187 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_186)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_189)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_187)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_188)))))) |c_#memory_int#2|)) is different from true [2023-12-16 17:49:18,832 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 41 treesize of output 33 [2023-12-16 17:49:18,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2023-12-16 17:49:18,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-12-16 17:49:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 40 not checked. [2023-12-16 17:49:19,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:49:20,730 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 57 treesize of output 53 [2023-12-16 17:49:20,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2023-12-16 17:49:20,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2023-12-16 17:49:20,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2023-12-16 17:49:20,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2023-12-16 17:49:20,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2023-12-16 17:49:20,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:49:20,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012988340] [2023-12-16 17:49:20,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012988340] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:49:20,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [620050421] [2023-12-16 17:49:20,849 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-16 17:49:20,849 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:49:20,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:49:20,850 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:49:20,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-12-16 17:49:21,266 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 17:49:21,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125631730] [2023-12-16 17:49:21,267 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-16 17:49:21,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 17:49:21,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 17:49:21,268 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 17:49:21,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 1 [2023-12-16 17:49:21,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-16 17:49:22,494 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-12-16 17:49:22,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:49:22,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 88 conjunts are in the unsatisfiable core [2023-12-16 17:49:22,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:49:22,537 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 23 treesize of output 19 [2023-12-16 17:49:22,593 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 23 treesize of output 19 [2023-12-16 17:49:22,648 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 23 treesize of output 19 [2023-12-16 17:49:22,701 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 23 treesize of output 19 [2023-12-16 17:49:22,778 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 23 treesize of output 19 [2023-12-16 17:49:22,832 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 [2023-12-16 17:49:22,875 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_204 (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_204)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))))))))) is different from true [2023-12-16 17:49:22,894 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_205 (_ BitVec 32)) (v_arrayElimCell_204 (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_204)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_205)))))) |c_#memory_int#2|)) is different from true [2023-12-16 17:49:22,913 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_205 (_ BitVec 32)) (v_arrayElimCell_204 (_ BitVec 32)) (v_arrayElimCell_206 (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32))) (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_204)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_206)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_205)))))) |c_#memory_int#2|)) is different from true [2023-12-16 17:49:22,935 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_205 (_ BitVec 32)) (v_arrayElimCell_204 (_ BitVec 32)) (v_arrayElimCell_207 (_ BitVec 32)) (v_arrayElimCell_206 (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (bvadd ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_204)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_207)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_181)) (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset|))) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_206)) ((_ zero_extend 24) ((_ extract 7 0) v_arrayElimCell_205)))))))) is different from true [2023-12-16 17:49:22,946 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 41 treesize of output 33 [2023-12-16 17:49:23,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 38 treesize of output 30 [2023-12-16 17:49:23,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 Received shutdown request... [2023-12-16 17:49:34,202 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 17:49:34,204 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 17:49:34,221 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 17:49:35,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-16 17:49:35,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-12-16 17:49:35,274 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-16 17:49:35,275 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 41 with TraceHistMax 7,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-16 17:49:35,276 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-16 17:49:35,291 INFO L445 BasicCegarLoop]: Path program histogram: [6, 5, 1, 1] [2023-12-16 17:49:35,294 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 17:49:35,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:49:35 BoogieIcfgContainer [2023-12-16 17:49:35,295 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 17:49:35,296 INFO L158 Benchmark]: Toolchain (without parser) took 80813.34ms. Allocated memory was 328.2MB in the beginning and 396.4MB in the end (delta: 68.2MB). Free memory was 286.8MB in the beginning and 338.2MB in the end (delta: -51.4MB). Peak memory consumption was 19.0MB. Max. memory is 8.0GB. [2023-12-16 17:49:35,296 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 17:49:35,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.99ms. Allocated memory is still 328.2MB. Free memory was 286.7MB in the beginning and 275.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 17:49:35,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.48ms. Allocated memory is still 328.2MB. Free memory was 275.1MB in the beginning and 273.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 17:49:35,296 INFO L158 Benchmark]: Boogie Preprocessor took 31.79ms. Allocated memory is still 328.2MB. Free memory was 273.6MB in the beginning and 270.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 17:49:35,296 INFO L158 Benchmark]: RCFGBuilder took 342.01ms. Allocated memory is still 328.2MB. Free memory was 270.9MB in the beginning and 254.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 17:49:35,296 INFO L158 Benchmark]: TraceAbstraction took 80213.53ms. Allocated memory was 328.2MB in the beginning and 396.4MB in the end (delta: 68.2MB). Free memory was 254.2MB in the beginning and 338.2MB in the end (delta: -84.1MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 17:49:35,297 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks [2023-12-16 17:49:35,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.99ms. Allocated memory is still 328.2MB. Free memory was 286.7MB in the beginning and 275.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.48ms. Allocated memory is still 328.2MB. Free memory was 275.1MB in the beginning and 273.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.79ms. Allocated memory is still 328.2MB. Free memory was 273.6MB in the beginning and 270.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 342.01ms. Allocated memory is still 328.2MB. Free memory was 270.9MB in the beginning and 254.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 80213.53ms. Allocated memory was 328.2MB in the beginning and 396.4MB in the end (delta: 68.2MB). Free memory was 254.2MB in the beginning and 338.2MB in the end (delta: -84.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 52). Cancelled while NwaCegarLoop was analyzing trace of length 41 with TraceHistMax 7,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 60). Cancelled while NwaCegarLoop was analyzing trace of length 41 with TraceHistMax 7,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 80.2s, OverallIterations: 13, TraceHistogramMax: 7, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 664 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1857 IncrementalHoareTripleChecker+Unchecked, 511 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 654 IncrementalHoareTripleChecker+Invalid, 2539 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 153 mSDtfsCounter, 654 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 659 GetRequests, 379 SyntacticMatches, 53 SemanticMatches, 227 ConstructedPredicates, 66 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 34.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=11, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 49.2s InterpolantComputationTime, 531 NumberOfCodeBlocks, 531 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 509 ConstructedInterpolants, 211 QuantifiedInterpolants, 7549 SizeOfPredicates, 386 NumberOfNonLiveVariables, 3876 ConjunctsInSsa, 820 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 260/640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown