./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness_negated.i --full-output --preprocessor.use.memory.slicer true --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash aabf7ad166d752d3872d668e3b551e8cefeb907fee1d51e6917a6895600694bb --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:30:51,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:30:51,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:30:51,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:30:51,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:30:51,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:30:51,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:30:51,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:30:51,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:30:51,970 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:30:51,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:30:51,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:30:51,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:30:51,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:30:51,973 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:30:51,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:30:51,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:30:51,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:30:51,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:30:51,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:30:51,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:30:51,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:30:51,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:30:51,975 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:30:51,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:30:51,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:30:51,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:30:51,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:30:51,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:30:51,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:30:51,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:30:51,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:30:51,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:30:51,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:30:51,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:30:51,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:30:51,978 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:30:51,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:30:51,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:30:51,979 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aabf7ad166d752d3872d668e3b551e8cefeb907fee1d51e6917a6895600694bb Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:30:52,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:30:52,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:30:52,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:30:52,254 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:30:52,254 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:30:52,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness_negated.i [2023-11-23 07:30:53,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:30:53,777 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:30:53,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness_negated.i [2023-11-23 07:30:53,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d311e40c/ebdf7e2633434be094ba8728f78df9d7/FLAGc9d348b46 [2023-11-23 07:30:53,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d311e40c/ebdf7e2633434be094ba8728f78df9d7 [2023-11-23 07:30:53,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:30:53,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:30:53,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:30:53,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:30:53,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:30:53,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:30:53" (1/1) ... [2023-11-23 07:30:53,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c50710f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:53, skipping insertion in model container [2023-11-23 07:30:53,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:30:53" (1/1) ... [2023-11-23 07:30:53,944 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:30:54,174 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2023-11-23 07:30:54,179 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2023-11-23 07:30:54,609 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:54,612 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:54,613 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:54,614 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:54,616 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:54,631 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:54,632 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:54,633 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:54,634 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:54,635 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:54,635 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:54,636 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:54,636 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:54,809 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:30:54,816 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:30:54,816 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:30:54,817 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:30:54,818 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:30:54,818 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:30:54,819 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:30:54,819 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:30:54,820 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:30:54,820 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:30:54,946 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:30:54,957 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:30:54,966 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2023-11-23 07:30:54,969 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2023-11-23 07:30:54,995 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:54,995 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:54,996 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:54,996 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:54,997 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:55,004 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:55,004 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:55,005 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:55,005 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:55,006 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:55,007 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:55,007 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:55,007 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:55,029 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:30:55,031 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:30:55,032 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:30:55,032 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:30:55,033 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:30:55,033 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:30:55,034 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:30:55,034 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:30:55,034 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:30:55,035 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:30:55,068 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:30:55,209 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:55,209 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:55,209 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:55,209 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:55,209 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:55,210 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:55,210 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:55,211 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:55,211 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:55,211 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:55,211 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:55,212 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:55,212 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:55,212 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:55,212 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:55,217 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:30:55,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:55 WrapperNode [2023-11-23 07:30:55,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:30:55,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:30:55,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:30:55,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:30:55,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:55" (1/1) ... [2023-11-23 07:30:55,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:55" (1/1) ... [2023-11-23 07:30:55,315 INFO L138 Inliner]: procedures = 678, calls = 1048, calls flagged for inlining = 49, calls inlined = 4, statements flattened = 87 [2023-11-23 07:30:55,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:30:55,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:30:55,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:30:55,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:30:55,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:55" (1/1) ... [2023-11-23 07:30:55,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:55" (1/1) ... [2023-11-23 07:30:55,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:55" (1/1) ... [2023-11-23 07:30:55,355 INFO L188 MemorySlicer]: Split 30 memory accesses to 4 slices as follows [2, 5, 23, 0]. 77 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 7 writes are split as follows [0, 0, 7, 0]. [2023-11-23 07:30:55,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:55" (1/1) ... [2023-11-23 07:30:55,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:55" (1/1) ... [2023-11-23 07:30:55,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:55" (1/1) ... [2023-11-23 07:30:55,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:55" (1/1) ... [2023-11-23 07:30:55,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:55" (1/1) ... [2023-11-23 07:30:55,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:55" (1/1) ... [2023-11-23 07:30:55,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:30:55,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:30:55,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:30:55,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:30:55,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:55" (1/1) ... [2023-11-23 07:30:55,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:30:55,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:30:55,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 07:30:55,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 07:30:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2023-11-23 07:30:55,430 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2023-11-23 07:30:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2023-11-23 07:30:55,430 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2023-11-23 07:30:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:30:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 07:30:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 07:30:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 07:30:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 07:30:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:30:55,431 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:30:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:30:55,432 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:30:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:30:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:30:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:30:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:30:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-23 07:30:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:30:55,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:30:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-23 07:30:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-23 07:30:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-23 07:30:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-23 07:30:55,433 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-23 07:30:55,434 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-23 07:30:55,434 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-23 07:30:55,434 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-23 07:30:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:30:55,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:30:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:30:55,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:30:55,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:30:55,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:30:55,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-23 07:30:55,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:30:55,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:30:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:30:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-23 07:30:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:30:55,436 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:30:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:30:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:30:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:30:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 07:30:55,701 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:30:55,704 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:30:55,929 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:30:55,961 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:30:55,962 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-23 07:30:55,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:30:55 BoogieIcfgContainer [2023-11-23 07:30:55,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:30:55,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:30:55,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:30:55,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:30:55,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:30:53" (1/3) ... [2023-11-23 07:30:55,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4997c0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:30:55, skipping insertion in model container [2023-11-23 07:30:55,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:55" (2/3) ... [2023-11-23 07:30:55,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4997c0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:30:55, skipping insertion in model container [2023-11-23 07:30:55,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:30:55" (3/3) ... [2023-11-23 07:30:55,968 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_remove_harness_negated.i [2023-11-23 07:30:55,980 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:30:55,980 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:30:56,008 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:30:56,023 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;@344ebcce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:30:56,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:30:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-23 07:30:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-23 07:30:56,034 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:56,035 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:30:56,036 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:56,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:56,042 INFO L85 PathProgramCache]: Analyzing trace with hash 358319961, now seen corresponding path program 1 times [2023-11-23 07:30:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:56,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55210089] [2023-11-23 07:30:56,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:56,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:56,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:30:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:56,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:30:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:56,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:30:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:56,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:30:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:56,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:30:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:56,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:30:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 07:30:56,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:56,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55210089] [2023-11-23 07:30:56,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55210089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:30:56,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:30:56,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 07:30:56,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940751316] [2023-11-23 07:30:56,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:30:56,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 07:30:56,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:56,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 07:30:56,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:30:56,609 INFO L87 Difference]: Start difference. First operand has 64 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 07:30:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:30:56,641 INFO L93 Difference]: Finished difference Result 123 states and 176 transitions. [2023-11-23 07:30:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 07:30:56,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2023-11-23 07:30:56,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:30:56,648 INFO L225 Difference]: With dead ends: 123 [2023-11-23 07:30:56,648 INFO L226 Difference]: Without dead ends: 62 [2023-11-23 07:30:56,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:30:56,653 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:30:56,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:30:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-23 07:30:56,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-23 07:30:56,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 07:30:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2023-11-23 07:30:56,680 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 45 [2023-11-23 07:30:56,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:30:56,681 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2023-11-23 07:30:56,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 07:30:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2023-11-23 07:30:56,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-23 07:30:56,683 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:56,683 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:30:56,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:30:56,683 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:56,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:56,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1963352299, now seen corresponding path program 1 times [2023-11-23 07:30:56,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:56,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778654288] [2023-11-23 07:30:56,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:56,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:57,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:30:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:57,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:30:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:57,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:30:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:57,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:30:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:57,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:30:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:57,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:30:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:57,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:30:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 07:30:57,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:57,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778654288] [2023-11-23 07:30:57,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778654288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:30:57,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:30:57,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 07:30:57,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692615287] [2023-11-23 07:30:57,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:30:57,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:30:57,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:57,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:30:57,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:30:57,246 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:30:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:30:57,665 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2023-11-23 07:30:57,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:30:57,666 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2023-11-23 07:30:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:30:57,668 INFO L225 Difference]: With dead ends: 124 [2023-11-23 07:30:57,668 INFO L226 Difference]: Without dead ends: 69 [2023-11-23 07:30:57,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:30:57,670 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 53 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:30:57,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 160 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:30:57,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-23 07:30:57,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2023-11-23 07:30:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2023-11-23 07:30:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2023-11-23 07:30:57,678 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 50 [2023-11-23 07:30:57,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:30:57,678 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2023-11-23 07:30:57,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:30:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2023-11-23 07:30:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-23 07:30:57,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:57,680 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:30:57,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 07:30:57,680 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:57,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:57,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1985984553, now seen corresponding path program 1 times [2023-11-23 07:30:57,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:57,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672535250] [2023-11-23 07:30:57,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:57,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:57,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:30:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:57,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:30:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:57,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:30:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:57,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:30:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:57,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:30:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:57,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:30:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:57,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:30:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 07:30:57,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:57,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672535250] [2023-11-23 07:30:57,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672535250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:30:57,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:30:57,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 07:30:57,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432686471] [2023-11-23 07:30:57,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:30:57,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 07:30:57,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:57,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 07:30:57,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:30:57,887 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:30:58,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:30:58,068 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2023-11-23 07:30:58,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:30:58,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2023-11-23 07:30:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:30:58,069 INFO L225 Difference]: With dead ends: 116 [2023-11-23 07:30:58,069 INFO L226 Difference]: Without dead ends: 67 [2023-11-23 07:30:58,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:30:58,070 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 34 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:30:58,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 104 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:30:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-23 07:30:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-23 07:30:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2023-11-23 07:30:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2023-11-23 07:30:58,078 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 50 [2023-11-23 07:30:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:30:58,078 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2023-11-23 07:30:58,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:30:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2023-11-23 07:30:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-23 07:30:58,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:58,079 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:30:58,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 07:30:58,080 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:58,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:58,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2097742797, now seen corresponding path program 1 times [2023-11-23 07:30:58,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:58,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936911961] [2023-11-23 07:30:58,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:58,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:58,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:30:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:58,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:30:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:58,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:30:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:58,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:30:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:58,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:30:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:58,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:30:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:58,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:30:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 07:30:58,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:58,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936911961] [2023-11-23 07:30:58,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936911961] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:30:58,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694771105] [2023-11-23 07:30:58,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:58,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:30:58,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:30:58,354 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:30:58,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 07:30:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:58,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-23 07:30:58,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:30:58,580 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 07:30:58,580 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:30:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-23 07:30:58,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694771105] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 07:30:58,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:30:58,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 6] total 11 [2023-11-23 07:30:58,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016970758] [2023-11-23 07:30:58,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:30:58,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:30:58,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:58,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:30:58,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:30:58,637 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-23 07:30:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:30:58,686 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2023-11-23 07:30:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 07:30:58,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 51 [2023-11-23 07:30:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:30:58,688 INFO L225 Difference]: With dead ends: 112 [2023-11-23 07:30:58,688 INFO L226 Difference]: Without dead ends: 70 [2023-11-23 07:30:58,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:30:58,689 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:30:58,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 203 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:30:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-23 07:30:58,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2023-11-23 07:30:58,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 44 states have internal predecessors, (52), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2023-11-23 07:30:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2023-11-23 07:30:58,695 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 51 [2023-11-23 07:30:58,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:30:58,695 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2023-11-23 07:30:58,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-23 07:30:58,696 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2023-11-23 07:30:58,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-23 07:30:58,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:58,696 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:30:58,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 07:30:58,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:30:58,909 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:58,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:58,909 INFO L85 PathProgramCache]: Analyzing trace with hash -629162300, now seen corresponding path program 1 times [2023-11-23 07:30:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:58,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548490962] [2023-11-23 07:30:58,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:58,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:59,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:30:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:59,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:30:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:30:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:59,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:30:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:59,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:30:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:59,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:30:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:59,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:30:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-23 07:30:59,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:59,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548490962] [2023-11-23 07:30:59,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548490962] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:30:59,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:30:59,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 07:30:59,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130855333] [2023-11-23 07:30:59,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:30:59,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:30:59,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:59,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:30:59,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:30:59,174 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-23 07:30:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:30:59,403 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2023-11-23 07:30:59,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:30:59,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 51 [2023-11-23 07:30:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:30:59,404 INFO L225 Difference]: With dead ends: 78 [2023-11-23 07:30:59,404 INFO L226 Difference]: Without dead ends: 76 [2023-11-23 07:30:59,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:30:59,405 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 41 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:30:59,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 158 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:30:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-23 07:30:59,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2023-11-23 07:30:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-11-23 07:30:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2023-11-23 07:30:59,411 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 51 [2023-11-23 07:30:59,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:30:59,412 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2023-11-23 07:30:59,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-23 07:30:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2023-11-23 07:30:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-23 07:30:59,413 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:59,413 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:30:59,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 07:30:59,413 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:59,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:59,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2075275866, now seen corresponding path program 1 times [2023-11-23 07:30:59,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:59,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344543614] [2023-11-23 07:30:59,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:59,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:59,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:30:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:59,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:30:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:59,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:30:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:59,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:30:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:59,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:30:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:59,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:30:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:59,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:30:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-23 07:30:59,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:59,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344543614] [2023-11-23 07:30:59,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344543614] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:30:59,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973519078] [2023-11-23 07:30:59,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:59,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:30:59,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:30:59,628 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:30:59,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 07:30:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:59,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-23 07:30:59,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:30:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-23 07:30:59,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:30:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-23 07:30:59,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973519078] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:30:59,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:30:59,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-11-23 07:30:59,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816912011] [2023-11-23 07:30:59,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:30:59,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:30:59,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:59,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:30:59,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:30:59,886 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand has 11 states, 8 states have (on average 5.375) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 07:31:00,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:00,176 INFO L93 Difference]: Finished difference Result 136 states and 170 transitions. [2023-11-23 07:31:00,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:31:00,176 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 5.375) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 53 [2023-11-23 07:31:00,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:00,177 INFO L225 Difference]: With dead ends: 136 [2023-11-23 07:31:00,177 INFO L226 Difference]: Without dead ends: 78 [2023-11-23 07:31:00,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:31:00,178 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 34 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:00,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 190 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:31:00,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-23 07:31:00,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-23 07:31:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 52 states have internal predecessors, (59), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-11-23 07:31:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2023-11-23 07:31:00,185 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 53 [2023-11-23 07:31:00,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:00,185 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2023-11-23 07:31:00,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 5.375) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 07:31:00,185 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2023-11-23 07:31:00,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-23 07:31:00,186 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:00,186 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:31:00,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 07:31:00,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-23 07:31:00,399 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:00,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:00,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1215662436, now seen corresponding path program 2 times [2023-11-23 07:31:00,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:00,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163643859] [2023-11-23 07:31:00,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:00,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:00,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:31:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:00,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:31:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:00,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:31:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:00,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:31:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:00,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:31:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:00,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:31:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:00,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 07:31:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-23 07:31:00,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:00,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163643859] [2023-11-23 07:31:00,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163643859] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:00,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506373263] [2023-11-23 07:31:00,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 07:31:00,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:00,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:00,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:31:00,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 07:31:01,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 07:31:01,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 07:31:01,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-23 07:31:01,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:31:01,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:31:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-23 07:31:01,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506373263] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:31:01,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:31:01,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 5] total 17 [2023-11-23 07:31:01,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277843780] [2023-11-23 07:31:01,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:31:01,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-23 07:31:01,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:01,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-23 07:31:01,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:31:01,236 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand has 17 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-23 07:31:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:01,920 INFO L93 Difference]: Finished difference Result 154 states and 192 transitions. [2023-11-23 07:31:01,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-23 07:31:01,920 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 56 [2023-11-23 07:31:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:01,921 INFO L225 Difference]: With dead ends: 154 [2023-11-23 07:31:01,921 INFO L226 Difference]: Without dead ends: 91 [2023-11-23 07:31:01,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2023-11-23 07:31:01,923 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 76 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:01,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 319 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 07:31:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-23 07:31:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2023-11-23 07:31:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-11-23 07:31:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2023-11-23 07:31:01,929 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 56 [2023-11-23 07:31:01,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:01,929 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2023-11-23 07:31:01,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-23 07:31:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2023-11-23 07:31:01,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-23 07:31:01,930 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:01,930 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:31:01,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 07:31:02,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:02,131 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:02,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:02,132 INFO L85 PathProgramCache]: Analyzing trace with hash 67906871, now seen corresponding path program 1 times [2023-11-23 07:31:02,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:02,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27094377] [2023-11-23 07:31:02,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:02,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:02,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:31:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:02,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:31:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:02,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:31:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:02,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:31:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:02,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:31:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:02,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:31:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:02,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 07:31:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:02,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 07:31:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:02,552 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 07:31:02,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:02,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27094377] [2023-11-23 07:31:02,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27094377] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:02,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530036106] [2023-11-23 07:31:02,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:02,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:02,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:02,553 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:31:02,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 07:31:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:02,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-23 07:31:02,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:02,790 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 07:31:02,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:02,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:02,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2023-11-23 07:31:02,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:02,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:02,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 07:31:02,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2023-11-23 07:31:02,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:02,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2023-11-23 07:31:02,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:02,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 07:31:02,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 28 [2023-11-23 07:31:02,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-23 07:31:03,071 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse2 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse3 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8)) (.cse4 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse1 (select .cse4 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|)) (.cse0 (select .cse4 .cse3))) (and (not (= .cse0 0)) (= (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) .cse2 v_DerPreprocessor_2) .cse0 v_arrayElimArr_2) .cse2) .cse3 .cse0) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse1) .cse4) (not (= .cse1 .cse2)) (not (= .cse2 .cse0)) (<= 2 .cse2)))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse5 (select .cse6 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= .cse5 (select .cse6 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8))) (not (= .cse5 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse5)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|)))) is different from true [2023-11-23 07:31:05,430 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse2 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse3 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8)) (.cse4 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse1 (select .cse4 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|)) (.cse0 (select .cse4 .cse3))) (and (not (= .cse0 0)) (= (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) .cse2 v_DerPreprocessor_2) .cse0 v_arrayElimArr_2) .cse2) .cse3 .cse0) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse1) .cse4) (not (= .cse1 .cse2)) (not (= .cse2 .cse0)) (<= 2 .cse2)))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse5 (select .cse6 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= .cse5 (select .cse6 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8))) (not (= .cse5 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse5)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|)))) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse7 (select .cse8 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse7 0)) (= .cse7 (select .cse8 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse7)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse10 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse13 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (let ((.cse9 (select .cse11 .cse13)) (.cse12 (select .cse11 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse9 .cse10)) (= .cse11 (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) .cse9 v_arrayElimArr_2) .cse10) .cse13 .cse9) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse12)) (not (= .cse9 0)) (not (= .cse12 .cse10)) (<= 2 .cse10)))))))) is different from true [2023-11-23 07:31:05,643 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse2 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse3 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8)) (.cse4 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse1 (select .cse4 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|)) (.cse0 (select .cse4 .cse3))) (and (not (= .cse0 0)) (= (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) .cse2 v_DerPreprocessor_2) .cse0 v_arrayElimArr_2) .cse2) .cse3 .cse0) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse1) .cse4) (not (= .cse1 .cse2)) (not (= .cse2 .cse0)) (<= 2 .cse2)))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse5 (select .cse6 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= .cse5 (select .cse6 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8))) (not (= .cse5 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse5)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|)))) (<= 2 |c_aws_linked_list_remove_~node#1.base|) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse7 (select .cse8 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse7 0)) (= .cse7 (select .cse8 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse7)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse10 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse13 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (let ((.cse9 (select .cse11 .cse13)) (.cse12 (select .cse11 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse9 .cse10)) (= .cse11 (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) .cse9 v_arrayElimArr_2) .cse10) .cse13 .cse9) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse12)) (not (= .cse9 0)) (not (= .cse12 .cse10)) (<= 2 .cse10))))))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base|))) (let ((.cse18 (+ |c_aws_linked_list_remove_~node#1.offset| 8)) (.cse16 (select .cse17 |c_aws_linked_list_remove_~node#1.offset|))) (let ((.cse14 (not (= .cse16 |c_aws_linked_list_remove_~node#1.base|))) (.cse15 (select .cse17 .cse18))) (or (and .cse14 (= .cse15 .cse16) (not (= .cse16 0))) (and .cse14 (not (= .cse15 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (and (= .cse17 (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_1) |c_aws_linked_list_remove_~node#1.base| v_DerPreprocessor_2) .cse15 v_arrayElimArr_2) |c_aws_linked_list_remove_~node#1.base|) .cse18 .cse15) |c_aws_linked_list_remove_~node#1.offset| .cse16)) (= (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|) |c_aws_linked_list_remove_~node#1.base|))) (not (= .cse15 |c_aws_linked_list_remove_~node#1.base|)))))))) is different from true [2023-11-23 07:31:05,837 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (let ((.cse1 (select .cse0 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (= (select .cse0 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8)) .cse1) (not (= .cse1 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| .cse1)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse3 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse5 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8))) (let ((.cse2 (select .cse6 .cse5)) (.cse4 (select .cse6 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (not (= .cse2 .cse3)) (not (= .cse2 0)) (= (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) .cse2 v_arrayElimArr_2) .cse3) .cse5 .cse2) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse4) .cse6) (not (= .cse3 .cse4)) (<= 2 .cse3))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse9 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse10 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8)) (.cse11 (select |c_#memory_$Pointer$#2.base| .cse9))) (let ((.cse8 (select .cse11 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|)) (.cse7 (select .cse11 .cse10))) (and (not (= .cse7 0)) (= (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) .cse7 v_arrayElimArr_2) .cse9) .cse10 .cse7) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse8) .cse11) (not (= .cse8 .cse9)) (not (= .cse9 .cse7)) (<= 2 .cse9)))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse12 (select .cse13 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= .cse12 (select .cse13 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8))) (not (= .cse12 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse12)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|)))) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse14 (select .cse15 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse14 0)) (= .cse14 (select .cse15 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse14)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse17 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| .cse17)) (.cse20 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (let ((.cse16 (select .cse18 .cse20)) (.cse19 (select .cse18 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse16 .cse17)) (= .cse18 (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse19 v_DerPreprocessor_1) .cse17 v_DerPreprocessor_2) .cse16 v_arrayElimArr_2) .cse17) .cse20 .cse16) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse19)) (not (= .cse16 0)) (not (= .cse19 .cse17)) (<= 2 .cse17)))))))) is different from true [2023-11-23 07:31:06,270 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (let ((.cse1 (select .cse0 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (= (select .cse0 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8)) .cse1) (not (= .cse1 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| .cse1)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse3 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse5 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8))) (let ((.cse2 (select .cse6 .cse5)) (.cse4 (select .cse6 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (not (= .cse2 .cse3)) (not (= .cse2 0)) (= (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) .cse2 v_arrayElimArr_2) .cse3) .cse5 .cse2) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse4) .cse6) (not (= .cse3 .cse4)) (<= 2 .cse3))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse9 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse10 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8)) (.cse11 (select |c_#memory_$Pointer$#2.base| .cse9))) (let ((.cse8 (select .cse11 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|)) (.cse7 (select .cse11 .cse10))) (and (not (= .cse7 0)) (= (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) .cse7 v_arrayElimArr_2) .cse9) .cse10 .cse7) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse8) .cse11) (not (= .cse8 .cse9)) (not (= .cse9 .cse7)) (<= 2 .cse9)))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse12 (select .cse13 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= .cse12 (select .cse13 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8))) (not (= .cse12 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse12)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|)))) (<= 2 |c_aws_linked_list_remove_~node#1.base|) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse14 (select .cse15 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse14 0)) (= .cse14 (select .cse15 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse14)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse17 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| .cse17)) (.cse20 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (let ((.cse16 (select .cse18 .cse20)) (.cse19 (select .cse18 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse16 .cse17)) (= .cse18 (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse19 v_DerPreprocessor_1) .cse17 v_DerPreprocessor_2) .cse16 v_arrayElimArr_2) .cse17) .cse20 .cse16) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse19)) (not (= .cse16 0)) (not (= .cse19 .cse17)) (<= 2 .cse17))))))) (let ((.cse24 (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base|))) (let ((.cse25 (+ |c_aws_linked_list_remove_~node#1.offset| 8)) (.cse23 (select .cse24 |c_aws_linked_list_remove_~node#1.offset|))) (let ((.cse21 (not (= .cse23 |c_aws_linked_list_remove_~node#1.base|))) (.cse22 (select .cse24 .cse25))) (or (and .cse21 (= .cse22 .cse23) (not (= .cse23 0))) (and .cse21 (not (= .cse22 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (and (= .cse24 (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse23 v_DerPreprocessor_1) |c_aws_linked_list_remove_~node#1.base| v_DerPreprocessor_2) .cse22 v_arrayElimArr_2) |c_aws_linked_list_remove_~node#1.base|) .cse25 .cse22) |c_aws_linked_list_remove_~node#1.offset| .cse23)) (= (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|) |c_aws_linked_list_remove_~node#1.base|))) (not (= .cse22 |c_aws_linked_list_remove_~node#1.base|)))))))) is different from true [2023-11-23 07:31:06,428 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (let ((.cse1 (select .cse0 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (= (select .cse0 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8)) .cse1) (not (= .cse1 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| .cse1)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse3 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse5 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8))) (let ((.cse2 (select .cse6 .cse5)) (.cse4 (select .cse6 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (not (= .cse2 .cse3)) (not (= .cse2 0)) (= (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) .cse2 v_arrayElimArr_2) .cse3) .cse5 .cse2) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse4) .cse6) (not (= .cse3 .cse4)) (<= 2 .cse3))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse7 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse7)) (.cse11 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| 8))) (let ((.cse8 (select .cse9 .cse11)) (.cse10 (select .cse9 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4|))) (and (not (= .cse7 .cse8)) (= .cse9 (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) .cse8 v_arrayElimArr_2) .cse7) .cse11 .cse8) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| .cse10)) (not (= .cse8 0)) (not (= .cse10 .cse7)) (<= 2 .cse7)))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| Int)) (and (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4|) (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4|))) (let ((.cse12 (select .cse13 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4|))) (and (not (= .cse12 0)) (= (select .cse13 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| 8)) .cse12) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| .cse12))))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse16 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse17 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8)) (.cse18 (select |c_#memory_$Pointer$#2.base| .cse16))) (let ((.cse15 (select .cse18 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|)) (.cse14 (select .cse18 .cse17))) (and (not (= .cse14 0)) (= (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse15 v_DerPreprocessor_1) .cse16 v_DerPreprocessor_2) .cse14 v_arrayElimArr_2) .cse16) .cse17 .cse14) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse15) .cse18) (not (= .cse15 .cse16)) (not (= .cse16 .cse14)) (<= 2 .cse16)))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse19 (select .cse20 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= .cse19 (select .cse20 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8))) (not (= .cse19 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse19)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|)))) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int)) (let ((.cse22 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse21 (select .cse22 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse21 0)) (= .cse21 (select .cse22 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse21)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse24 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse25 (select |c_#memory_$Pointer$#2.base| .cse24)) (.cse27 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (let ((.cse23 (select .cse25 .cse27)) (.cse26 (select .cse25 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse23 .cse24)) (= .cse25 (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse26 v_DerPreprocessor_1) .cse24 v_DerPreprocessor_2) .cse23 v_arrayElimArr_2) .cse24) .cse27 .cse23) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse26)) (not (= .cse23 0)) (not (= .cse26 .cse24)) (<= 2 .cse24)))))))) is different from true [2023-11-23 07:31:06,817 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (let ((.cse1 (select .cse0 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (= (select .cse0 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8)) .cse1) (not (= .cse1 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| .cse1)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse3 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse5 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8))) (let ((.cse2 (select .cse6 .cse5)) (.cse4 (select .cse6 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (not (= .cse2 .cse3)) (not (= .cse2 0)) (= (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) .cse2 v_arrayElimArr_2) .cse3) .cse5 .cse2) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse4) .cse6) (not (= .cse3 .cse4)) (<= 2 .cse3))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse7 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse7)) (.cse11 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| 8))) (let ((.cse8 (select .cse9 .cse11)) (.cse10 (select .cse9 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4|))) (and (not (= .cse7 .cse8)) (= .cse9 (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) .cse8 v_arrayElimArr_2) .cse7) .cse11 .cse8) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| .cse10)) (not (= .cse8 0)) (not (= .cse10 .cse7)) (<= 2 .cse7)))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| Int)) (and (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4|) (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4|))) (let ((.cse12 (select .cse13 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4|))) (and (not (= .cse12 0)) (= (select .cse13 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| 8)) .cse12) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| .cse12))))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse16 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse17 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8)) (.cse18 (select |c_#memory_$Pointer$#2.base| .cse16))) (let ((.cse15 (select .cse18 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|)) (.cse14 (select .cse18 .cse17))) (and (not (= .cse14 0)) (= (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse15 v_DerPreprocessor_1) .cse16 v_DerPreprocessor_2) .cse14 v_arrayElimArr_2) .cse16) .cse17 .cse14) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse15) .cse18) (not (= .cse15 .cse16)) (not (= .cse16 .cse14)) (<= 2 .cse16)))))) (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse19 (select .cse20 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= .cse19 (select .cse20 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8))) (not (= .cse19 0)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse19)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|)))) (<= 2 |c_aws_linked_list_remove_~node#1.base|) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int)) (let ((.cse22 (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse21 (select .cse22 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse21 0)) (= .cse21 (select .cse22 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse21)))))) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse24 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse25 (select |c_#memory_$Pointer$#2.base| .cse24)) (.cse27 (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8))) (let ((.cse23 (select .cse25 .cse27)) (.cse26 (select .cse25 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse23 .cse24)) (= .cse25 (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse26 v_DerPreprocessor_1) .cse24 v_DerPreprocessor_2) .cse23 v_arrayElimArr_2) .cse24) .cse27 .cse23) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse26)) (not (= .cse23 0)) (not (= .cse26 .cse24)) (<= 2 .cse24))))))) (let ((.cse31 (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base|))) (let ((.cse32 (+ |c_aws_linked_list_remove_~node#1.offset| 8)) (.cse30 (select .cse31 |c_aws_linked_list_remove_~node#1.offset|))) (let ((.cse28 (not (= .cse30 |c_aws_linked_list_remove_~node#1.base|))) (.cse29 (select .cse31 .cse32))) (or (and .cse28 (= .cse29 .cse30) (not (= .cse30 0))) (and .cse28 (not (= .cse29 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (and (= .cse31 (store (store (select (store (store (store |c_#memory_$Pointer$#2.base| .cse30 v_DerPreprocessor_1) |c_aws_linked_list_remove_~node#1.base| v_DerPreprocessor_2) .cse29 v_arrayElimArr_2) |c_aws_linked_list_remove_~node#1.base|) .cse32 .cse29) |c_aws_linked_list_remove_~node#1.offset| .cse30)) (= (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|) |c_aws_linked_list_remove_~node#1.base|))) (not (= .cse29 |c_aws_linked_list_remove_~node#1.base|)))))))) is different from true [2023-11-23 07:31:10,686 INFO L349 Elim1Store]: treesize reduction 3493, result has 15.8 percent of original size [2023-11-23 07:31:10,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 17 new quantified variables, introduced 99 case distinctions, treesize of input 1134 treesize of output 1667 [2023-11-23 07:31:10,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 174 [2023-11-23 07:31:10,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 172 [2023-11-23 07:31:10,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 172 [2023-11-23 07:31:10,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 168 [2023-11-23 07:31:10,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 74 [2023-11-23 07:31:11,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:11,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 73 [2023-11-23 07:31:11,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 74 [2023-11-23 07:31:11,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 74 [2023-11-23 07:31:11,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 74 [2023-11-23 07:31:11,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 93 [2023-11-23 07:31:11,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2023-11-23 07:31:11,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:11,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2023-11-23 07:31:12,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:12,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2023-11-23 07:31:12,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:12,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2023-11-23 07:31:12,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2023-11-23 07:31:12,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:12,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2023-11-23 07:31:14,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 19 [2023-11-23 07:31:24,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 37 treesize of output 63 [2023-11-23 07:31:26,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2023-11-23 07:31:26,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2023-11-23 07:31:27,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2023-11-23 07:31:27,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 37 treesize of output 63 [2023-11-23 07:31:27,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 37 treesize of output 63 [2023-11-23 07:31:28,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2023-11-23 07:31:28,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2023-11-23 07:31:28,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2023-11-23 07:31:29,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2023-11-23 07:31:39,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:39,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:31:39,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:39,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:31:39,730 INFO L349 Elim1Store]: treesize reduction 48, result has 42.2 percent of original size [2023-11-23 07:31:39,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 114 [2023-11-23 07:31:40,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:40,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:31:40,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:40,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:31:41,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:41,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:31:41,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:41,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:31:42,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:42,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:03,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:03,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:04,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:04,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:04,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:04,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:04,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:04,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:04,863 INFO L349 Elim1Store]: treesize reduction 48, result has 42.2 percent of original size [2023-11-23 07:32:04,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 114 [2023-11-23 07:32:05,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:05,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:05,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:05,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:06,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:06,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:06,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:06,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:07,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:07,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:07,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:07,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:07,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:07,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:08,091 INFO L349 Elim1Store]: treesize reduction 48, result has 42.2 percent of original size [2023-11-23 07:32:08,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 114 [2023-11-23 07:32:08,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:08,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:09,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:09,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:09,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:09,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:09,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:09,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:12,158 INFO L349 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2023-11-23 07:32:12,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 106 [2023-11-23 07:32:14,199 INFO L349 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2023-11-23 07:32:14,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 106 [2023-11-23 07:32:15,335 INFO L349 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2023-11-23 07:32:15,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 106 [2023-11-23 07:32:16,103 INFO L349 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2023-11-23 07:32:16,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 106 [2023-11-23 07:32:16,818 INFO L349 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2023-11-23 07:32:16,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 106 [2023-11-23 07:32:17,759 INFO L349 Elim1Store]: treesize reduction 122, result has 20.3 percent of original size [2023-11-23 07:32:17,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 151 [2023-11-23 07:32:18,559 INFO L349 Elim1Store]: treesize reduction 120, result has 21.6 percent of original size [2023-11-23 07:32:18,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 153 [2023-11-23 07:32:19,641 INFO L349 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2023-11-23 07:32:19,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 106 [2023-11-23 07:32:20,436 INFO L349 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2023-11-23 07:32:20,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 106 [2023-11-23 07:32:21,684 INFO L349 Elim1Store]: treesize reduction 122, result has 20.3 percent of original size [2023-11-23 07:32:21,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 151 [2023-11-23 07:32:28,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:28,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:29,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:29,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:30,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:30,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:30,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:30,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:31,209 INFO L349 Elim1Store]: treesize reduction 48, result has 42.2 percent of original size [2023-11-23 07:32:31,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 114 [2023-11-23 07:32:32,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:32,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:33,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:33,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:34,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:34,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:35,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:35,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:32:59,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:32:59,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:33:00,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:00,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:33:00,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:00,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:33:00,755 INFO L349 Elim1Store]: treesize reduction 48, result has 42.2 percent of original size [2023-11-23 07:33:00,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 114 [2023-11-23 07:33:01,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:01,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:33:02,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:02,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:33:02,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:02,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:33:03,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:33:03,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:33:41,509 INFO L349 Elim1Store]: treesize reduction 48, result has 42.2 percent of original size [2023-11-23 07:33:41,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 108 [2023-11-23 07:33:46,009 INFO L349 Elim1Store]: treesize reduction 48, result has 42.2 percent of original size [2023-11-23 07:33:46,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 108 [2023-11-23 07:33:48,552 INFO L349 Elim1Store]: treesize reduction 48, result has 42.2 percent of original size [2023-11-23 07:33:48,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 108 [2023-11-23 07:33:53,229 INFO L349 Elim1Store]: treesize reduction 120, result has 21.6 percent of original size [2023-11-23 07:33:53,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 147 [2023-11-23 07:33:53,996 INFO L349 Elim1Store]: treesize reduction 122, result has 20.3 percent of original size [2023-11-23 07:33:53,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 145 [2023-11-23 07:33:54,707 INFO L349 Elim1Store]: treesize reduction 120, result has 21.6 percent of original size [2023-11-23 07:33:54,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 147 [2023-11-23 07:34:00,387 INFO L349 Elim1Store]: treesize reduction 48, result has 42.2 percent of original size [2023-11-23 07:34:00,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 108 [2023-11-23 07:34:06,173 INFO L349 Elim1Store]: treesize reduction 48, result has 42.2 percent of original size [2023-11-23 07:34:06,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 108 Killed by 15