./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_push_front_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_push_front_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 e2301b0ad8c0a2894a947641f0d78dd5062c9cc62f8190d0267e0cfb25211681 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:30:26,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:30:26,756 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:26,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:30:26,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:30:26,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:30:26,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:30:26,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:30:26,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:30:26,789 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:30:26,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:30:26,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:30:26,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:30:26,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:30:26,793 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:30:26,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:30:26,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:30:26,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:30:26,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:30:26,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:30:26,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:30:26,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:30:26,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:30:26,795 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:30:26,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:30:26,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:30:26,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:30:26,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:30:26,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:30:26,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:30:26,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:30:26,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:30:26,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:30:26,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:30:26,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:30:26,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:30:26,799 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:30:26,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:30:26,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:30:26,799 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 -> e2301b0ad8c0a2894a947641f0d78dd5062c9cc62f8190d0267e0cfb25211681 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:30:27,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:30:27,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:30:27,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:30:27,049 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:30:27,049 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:30:27,050 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_push_front_harness_negated.i [2023-11-23 07:30:28,165 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:30:28,518 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:30:28,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_push_front_harness_negated.i [2023-11-23 07:30:28,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/725719657/35e9c608912d474d9dd545787f9b77ab/FLAG92cf1dd5d [2023-11-23 07:30:28,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/725719657/35e9c608912d474d9dd545787f9b77ab [2023-11-23 07:30:28,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:30:28,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:30:28,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:30:28,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:30:28,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:30:28,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:30:28" (1/1) ... [2023-11-23 07:30:28,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a002e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:28, skipping insertion in model container [2023-11-23 07:30:28,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:30:28" (1/1) ... [2023-11-23 07:30:28,655 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:30:28,855 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_push_front_harness_negated.i[4500,4513] [2023-11-23 07:30:28,862 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_push_front_harness_negated.i[4560,4573] [2023-11-23 07:30:29,354 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,356 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,357 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,357 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,358 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,374 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,387 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,389 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,389 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,390 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,390 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,391 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,391 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,595 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:30:29,596 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:30:29,597 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:30:29,598 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:30:29,601 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:30:29,601 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:30:29,602 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:30:29,602 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:30:29,604 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:30:29,611 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:30:29,787 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:30:29,806 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:30:29,817 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_push_front_harness_negated.i[4500,4513] [2023-11-23 07:30:29,817 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_push_front_harness_negated.i[4560,4573] [2023-11-23 07:30:29,882 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,883 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,883 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,883 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,884 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,890 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,890 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,891 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,891 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,892 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,892 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,893 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,893 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:29,912 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:30:29,913 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:30:29,913 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:30:29,913 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:30:29,914 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:30:29,914 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:30:29,915 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:30:29,915 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:30:29,915 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:30:29,916 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:30:29,936 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:30:30,081 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:30,081 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:30,082 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:30,082 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:30,082 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:30,082 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:30,082 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:30,082 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:30,082 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:30,082 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:30,083 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:30,083 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:30,083 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:30,083 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:30,083 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:30,083 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:30,089 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:30:30,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:30 WrapperNode [2023-11-23 07:30:30,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:30:30,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:30:30,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:30:30,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:30:30,095 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:30" (1/1) ... [2023-11-23 07:30:30,135 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:30" (1/1) ... [2023-11-23 07:30:30,162 INFO L138 Inliner]: procedures = 678, calls = 1048, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 151 [2023-11-23 07:30:30,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:30:30,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:30:30,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:30:30,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:30:30,171 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:30" (1/1) ... [2023-11-23 07:30:30,171 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:30" (1/1) ... [2023-11-23 07:30:30,174 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:30" (1/1) ... [2023-11-23 07:30:30,196 INFO L188 MemorySlicer]: Split 36 memory accesses to 3 slices as follows [2, 5, 29]. 81 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 10 writes are split as follows [0, 0, 10]. [2023-11-23 07:30:30,196 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:30" (1/1) ... [2023-11-23 07:30:30,197 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:30" (1/1) ... [2023-11-23 07:30:30,207 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:30" (1/1) ... [2023-11-23 07:30:30,218 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:30" (1/1) ... [2023-11-23 07:30:30,221 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:30" (1/1) ... [2023-11-23 07:30:30,222 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:30" (1/1) ... [2023-11-23 07:30:30,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:30:30,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:30:30,227 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:30:30,227 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:30:30,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:30" (1/1) ... [2023-11-23 07:30:30,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:30:30,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:30:30,274 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:30,290 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:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:30:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:30:30,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:30:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:30:30,309 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:30:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 07:30:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 07:30:30,309 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 07:30:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:30:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:30:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:30:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:30:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2023-11-23 07:30:30,310 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2023-11-23 07:30:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:30:30,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:30:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:30:30,310 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:30:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:30:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:30:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:30:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:30:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:30:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:30:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:30:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 07:30:30,311 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 07:30:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:30:30,311 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:30:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:30:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:30:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:30:30,512 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:30:30,513 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:30:30,815 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:30:30,859 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:30:30,859 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 07:30:30,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:30:30 BoogieIcfgContainer [2023-11-23 07:30:30,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:30:30,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:30:30,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:30:30,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:30:30,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:30:28" (1/3) ... [2023-11-23 07:30:30,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6903602a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:30:30, skipping insertion in model container [2023-11-23 07:30:30,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:30" (2/3) ... [2023-11-23 07:30:30,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6903602a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:30:30, skipping insertion in model container [2023-11-23 07:30:30,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:30:30" (3/3) ... [2023-11-23 07:30:30,867 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_push_front_harness_negated.i [2023-11-23 07:30:30,881 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:30:30,881 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:30:30,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:30:30,932 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;@5ee525df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:30:30,932 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:30:30,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 57 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-23 07:30:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 07:30:30,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:30,945 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:30:30,946 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:30,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:30,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1914549228, now seen corresponding path program 1 times [2023-11-23 07:30:30,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:30,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396102156] [2023-11-23 07:30:30,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:30,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:31,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:30:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:31,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:30:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:31,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:30:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:31,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:30:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:31,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:30:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:31,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 07:30:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:31,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:30:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:31,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 07:30:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:31,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:30:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 07:30:31,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:31,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396102156] [2023-11-23 07:30:31,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396102156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:30:31,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:30:31,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 07:30:31,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134529017] [2023-11-23 07:30:31,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:30:31,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:30:31,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:31,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:30:31,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:30:31,615 INFO L87 Difference]: Start difference. First operand has 93 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 57 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 07:30:31,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:30:31,728 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2023-11-23 07:30:31,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:30:31,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 69 [2023-11-23 07:30:31,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:30:31,740 INFO L225 Difference]: With dead ends: 184 [2023-11-23 07:30:31,740 INFO L226 Difference]: Without dead ends: 95 [2023-11-23 07:30:31,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:30:31,746 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 3 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:30:31,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 340 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:30:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-23 07:30:31,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2023-11-23 07:30:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 59 states have internal predecessors, (73), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-23 07:30:31,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 128 transitions. [2023-11-23 07:30:31,790 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 128 transitions. Word has length 69 [2023-11-23 07:30:31,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:30:31,791 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 128 transitions. [2023-11-23 07:30:31,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 07:30:31,792 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 128 transitions. [2023-11-23 07:30:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 07:30:31,795 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:31,795 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:30:31,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:30:31,797 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:31,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash -765365912, now seen corresponding path program 1 times [2023-11-23 07:30:31,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:31,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205229912] [2023-11-23 07:30:31,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:31,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:32,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:30:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:32,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:30:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:32,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:30:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:32,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:30:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:32,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:30:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:32,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 07:30:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:32,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:30:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:32,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 07:30:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:32,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:30:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 07:30:32,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:32,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205229912] [2023-11-23 07:30:32,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205229912] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:30:32,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136437695] [2023-11-23 07:30:32,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:32,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:30:32,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:30:32,300 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:32,329 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:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:32,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-23 07:30:32,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:30:32,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 07:30:32,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 07:30:32,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:32,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:32,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2023-11-23 07:30:32,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:32,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:32,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2023-11-23 07:30:33,119 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 07:30:33,120 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:30:33,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136437695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:30:33,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:30:33,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2023-11-23 07:30:33,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940500046] [2023-11-23 07:30:33,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:30:33,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:30:33,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:33,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:30:33,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:30:33,123 INFO L87 Difference]: Start difference. First operand 94 states and 128 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 07:30:34,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:30:34,496 INFO L93 Difference]: Finished difference Result 240 states and 326 transitions. [2023-11-23 07:30:34,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 07:30:34,496 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 69 [2023-11-23 07:30:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:30:34,499 INFO L225 Difference]: With dead ends: 240 [2023-11-23 07:30:34,499 INFO L226 Difference]: Without dead ends: 151 [2023-11-23 07:30:34,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-11-23 07:30:34,501 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 75 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:30:34,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 558 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-23 07:30:34,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-23 07:30:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2023-11-23 07:30:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 100 states have internal predecessors, (127), 36 states have call successors, (36), 12 states have call predecessors, (36), 11 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-23 07:30:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 198 transitions. [2023-11-23 07:30:34,528 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 198 transitions. Word has length 69 [2023-11-23 07:30:34,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:30:34,529 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 198 transitions. [2023-11-23 07:30:34,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 07:30:34,529 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2023-11-23 07:30:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 07:30:34,530 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:34,530 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:30:34,556 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:34,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:30:34,743 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:34,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:34,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1099090257, now seen corresponding path program 1 times [2023-11-23 07:30:34,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:34,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427018376] [2023-11-23 07:30:34,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:34,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:34,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:30:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:34,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:30:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:34,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:30:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:34,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:30:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:34,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 07:30:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:34,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:30:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:34,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 07:30:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:34,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 07:30:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:34,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 07:30:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:30:35,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:35,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427018376] [2023-11-23 07:30:35,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427018376] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:30:35,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103794406] [2023-11-23 07:30:35,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:35,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:30:35,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:30:35,005 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:35,020 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:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:35,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-23 07:30:35,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:30:35,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 07:30:35,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 07:30:35,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:35,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-23 07:30:35,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:35,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 18 treesize of output 13 [2023-11-23 07:30:35,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:35,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-23 07:30:35,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:35,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 18 treesize of output 13 [2023-11-23 07:30:35,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:35,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 28 [2023-11-23 07:30:35,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:35,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 26 [2023-11-23 07:30:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 07:30:35,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:30:36,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:30:36,246 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 1 case distinctions, treesize of input 99 treesize of output 98 [2023-11-23 07:30:36,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:30:36,254 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 1 case distinctions, treesize of input 89 treesize of output 90 [2023-11-23 07:30:36,271 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 6 treesize of output 4 [2023-11-23 07:30:36,290 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 8 treesize of output 6 [2023-11-23 07:30:36,310 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int)) (v_subst_2 Int)) (or (not (= (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 16) (select v_arrayElimArr_3 v_subst_2))) (forall ((v_ArrVal_388 Int) (v_ArrVal_390 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_388)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_3))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_390))) |c_ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base|) .cse2) 0)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (forall ((v_ArrVal_386 Int) (v_arrayElimArr_4 (Array Int Int)) (v_subst_1 Int)) (or (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_386)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_4))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base|) .cse2) 0) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_4 v_subst_1))))))))) is different from false [2023-11-23 07:30:36,332 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:30:36,333 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:30:36,426 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2023-11-23 07:30:36,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 185 treesize of output 214 [2023-11-23 07:30:36,437 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:30:36,437 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:30:36,493 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2023-11-23 07:30:36,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 341 treesize of output 328 [2023-11-23 07:30:36,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:30:36,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 264 treesize of output 264 [2023-11-23 07:30:36,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:30:36,536 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 231 treesize of output 228 [2023-11-23 07:30:36,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:30:36,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 308 treesize of output 308 [2023-11-23 07:30:36,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:30:36,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 275 treesize of output 272 [2023-11-23 07:30:37,234 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 8 treesize of output 4 [2023-11-23 07:30:37,263 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 8 treesize of output 4 [2023-11-23 07:30:37,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:30:37,495 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 105 treesize of output 101 [2023-11-23 07:30:37,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:30:37,506 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 111 treesize of output 107 [2023-11-23 07:30:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 1 not checked. [2023-11-23 07:30:37,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103794406] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:30:37,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:30:37,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 23 [2023-11-23 07:30:37,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436951837] [2023-11-23 07:30:37,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:30:37,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-23 07:30:37,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:37,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-23 07:30:37,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2023-11-23 07:30:37,570 INFO L87 Difference]: Start difference. First operand 146 states and 198 transitions. Second operand has 23 states, 20 states have (on average 3.8) internal successors, (76), 21 states have internal predecessors, (76), 7 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) [2023-11-23 07:30:41,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:30:41,537 INFO L93 Difference]: Finished difference Result 321 states and 431 transitions. [2023-11-23 07:30:41,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-23 07:30:41,538 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 3.8) internal successors, (76), 21 states have internal predecessors, (76), 7 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) Word has length 70 [2023-11-23 07:30:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:30:41,539 INFO L225 Difference]: With dead ends: 321 [2023-11-23 07:30:41,539 INFO L226 Difference]: Without dead ends: 199 [2023-11-23 07:30:41,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=180, Invalid=1155, Unknown=1, NotChecked=70, Total=1406 [2023-11-23 07:30:41,541 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 142 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:30:41,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 2006 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1148 Invalid, 1 Unknown, 163 Unchecked, 3.4s Time] [2023-11-23 07:30:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-11-23 07:30:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 128. [2023-11-23 07:30:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 88 states have internal predecessors, (112), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-23 07:30:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 169 transitions. [2023-11-23 07:30:41,553 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 169 transitions. Word has length 70 [2023-11-23 07:30:41,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:30:41,553 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 169 transitions. [2023-11-23 07:30:41,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 3.8) internal successors, (76), 21 states have internal predecessors, (76), 7 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) [2023-11-23 07:30:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 169 transitions. [2023-11-23 07:30:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-23 07:30:41,554 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:41,554 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:30:41,569 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:30:41,767 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,SelfDestructingSolverStorable2 [2023-11-23 07:30:41,768 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:41,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:41,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1713490392, now seen corresponding path program 1 times [2023-11-23 07:30:41,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:41,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121968395] [2023-11-23 07:30:41,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:41,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:41,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:30:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:41,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:30:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:41,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:30:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:41,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:30:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:42,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 07:30:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:42,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:30:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:42,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:30:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:42,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 07:30:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:42,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:30:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:42,047 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 07:30:42,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:42,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121968395] [2023-11-23 07:30:42,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121968395] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:30:42,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922787762] [2023-11-23 07:30:42,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:42,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:30:42,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:30:42,049 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:30:42,078 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:30:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:42,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-23 07:30:42,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:30:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 07:30:42,282 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:30:42,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922787762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:30:42,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:30:42,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2023-11-23 07:30:42,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127025800] [2023-11-23 07:30:42,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:30:42,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:30:42,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:42,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:30:42,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:30:42,285 INFO L87 Difference]: Start difference. First operand 128 states and 169 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 07:30:42,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:30:42,367 INFO L93 Difference]: Finished difference Result 226 states and 301 transitions. [2023-11-23 07:30:42,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 07:30:42,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 71 [2023-11-23 07:30:42,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:30:42,369 INFO L225 Difference]: With dead ends: 226 [2023-11-23 07:30:42,369 INFO L226 Difference]: Without dead ends: 133 [2023-11-23 07:30:42,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:30:42,370 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 4 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:30:42,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 653 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:30:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-23 07:30:42,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2023-11-23 07:30:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 87 states have (on average 1.264367816091954) internal successors, (110), 88 states have internal predecessors, (110), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-23 07:30:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 167 transitions. [2023-11-23 07:30:42,381 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 167 transitions. Word has length 71 [2023-11-23 07:30:42,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:30:42,381 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 167 transitions. [2023-11-23 07:30:42,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 07:30:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 167 transitions. [2023-11-23 07:30:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-23 07:30:42,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:42,382 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,397 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:30:42,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:30:42,596 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:42,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:42,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1881529045, now seen corresponding path program 1 times [2023-11-23 07:30:42,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:42,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847059253] [2023-11-23 07:30:42,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:42,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:42,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:30:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:42,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:30:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:42,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:30:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:42,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:30:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:42,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:30:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:42,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:30:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:42,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 07:30:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:42,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:30:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:42,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 07:30:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 07:30:42,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:42,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847059253] [2023-11-23 07:30:42,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847059253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:30:42,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:30:42,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 07:30:42,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241695242] [2023-11-23 07:30:42,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:30:42,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:30:42,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:42,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:30:42,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:30:42,779 INFO L87 Difference]: Start difference. First operand 128 states and 167 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 07:30:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:30:42,890 INFO L93 Difference]: Finished difference Result 255 states and 339 transitions. [2023-11-23 07:30:42,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 07:30:42,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2023-11-23 07:30:42,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:30:42,891 INFO L225 Difference]: With dead ends: 255 [2023-11-23 07:30:42,892 INFO L226 Difference]: Without dead ends: 143 [2023-11-23 07:30:42,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:30:42,908 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 34 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:30:42,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 606 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:30:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-23 07:30:42,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2023-11-23 07:30:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 96 states have internal predecessors, (121), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-23 07:30:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 178 transitions. [2023-11-23 07:30:42,919 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 178 transitions. Word has length 73 [2023-11-23 07:30:42,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:30:42,919 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 178 transitions. [2023-11-23 07:30:42,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 07:30:42,919 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 178 transitions. [2023-11-23 07:30:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-23 07:30:42,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:42,920 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 07:30:42,923 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:42,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:42,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1979709165, now seen corresponding path program 1 times [2023-11-23 07:30:42,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:42,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661369521] [2023-11-23 07:30:42,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:42,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:30:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:30:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:30:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:30:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:30:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:30:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 07:30:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:30:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 07:30:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 07:30:43,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:43,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661369521] [2023-11-23 07:30:43,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661369521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:30:43,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:30:43,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 07:30:43,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864128711] [2023-11-23 07:30:43,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:30:43,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:30:43,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:43,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:30:43,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 07:30:43,116 INFO L87 Difference]: Start difference. First operand 136 states and 178 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 07:30:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:30:43,190 INFO L93 Difference]: Finished difference Result 265 states and 352 transitions. [2023-11-23 07:30:43,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:30:43,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2023-11-23 07:30:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:30:43,192 INFO L225 Difference]: With dead ends: 265 [2023-11-23 07:30:43,192 INFO L226 Difference]: Without dead ends: 147 [2023-11-23 07:30:43,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:30:43,193 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 34 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:30:43,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 539 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:30:43,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-23 07:30:43,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2023-11-23 07:30:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 96 states have internal predecessors, (119), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-23 07:30:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 176 transitions. [2023-11-23 07:30:43,210 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 176 transitions. Word has length 73 [2023-11-23 07:30:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:30:43,210 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 176 transitions. [2023-11-23 07:30:43,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 07:30:43,211 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 176 transitions. [2023-11-23 07:30:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-23 07:30:43,213 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:43,214 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 07:30:43,214 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:43,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:43,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1939034415, now seen corresponding path program 1 times [2023-11-23 07:30:43,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:43,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133898642] [2023-11-23 07:30:43,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:43,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:30:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:30:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:30:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:30:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:30:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:30:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 07:30:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:30:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 07:30:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 07:30:43,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:43,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133898642] [2023-11-23 07:30:43,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133898642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:30:43,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:30:43,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 07:30:43,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641042401] [2023-11-23 07:30:43,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:30:43,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:30:43,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:43,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:30:43,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 07:30:43,393 INFO L87 Difference]: Start difference. First operand 136 states and 176 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 07:30:43,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:30:43,421 INFO L93 Difference]: Finished difference Result 136 states and 176 transitions. [2023-11-23 07:30:43,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:30:43,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2023-11-23 07:30:43,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:30:43,422 INFO L225 Difference]: With dead ends: 136 [2023-11-23 07:30:43,422 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 07:30:43,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:30:43,423 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:30:43,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 68 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:30:43,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 07:30:43,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 07:30:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 07:30:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 07:30:43,425 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2023-11-23 07:30:43,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:30:43,425 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 07:30:43,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 07:30:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 07:30:43,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 07:30:43,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 07:30:43,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 07:30:43,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 07:30:43,676 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4715 4719) no Hoare annotation was computed. [2023-11-23 07:30:43,677 INFO L899 garLoopResultBuilder]: For program point L4718(line 4718) no Hoare annotation was computed. [2023-11-23 07:30:43,677 INFO L899 garLoopResultBuilder]: For program point L4718-3(line 4718) no Hoare annotation was computed. [2023-11-23 07:30:43,677 INFO L899 garLoopResultBuilder]: For program point L4718-2(line 4718) no Hoare annotation was computed. [2023-11-23 07:30:43,677 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4715 4719) the Hoare annotation is: true [2023-11-23 07:30:43,677 INFO L899 garLoopResultBuilder]: For program point L4718-5(line 4718) no Hoare annotation was computed. [2023-11-23 07:30:43,677 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4726 4730) no Hoare annotation was computed. [2023-11-23 07:30:43,677 INFO L899 garLoopResultBuilder]: For program point L4729-2(line 4729) no Hoare annotation was computed. [2023-11-23 07:30:43,677 INFO L899 garLoopResultBuilder]: For program point L4729-3(line 4729) no Hoare annotation was computed. [2023-11-23 07:30:43,677 INFO L899 garLoopResultBuilder]: For program point L4729(line 4729) no Hoare annotation was computed. [2023-11-23 07:30:43,677 INFO L899 garLoopResultBuilder]: For program point L4729-5(line 4729) no Hoare annotation was computed. [2023-11-23 07:30:43,677 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4726 4730) the Hoare annotation is: true [2023-11-23 07:30:43,677 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-23 07:30:43,677 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-23 07:30:43,677 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-23 07:30:43,677 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-23 07:30:43,677 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2023-11-23 07:30:43,678 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 266) the Hoare annotation is: true [2023-11-23 07:30:43,678 INFO L902 garLoopResultBuilder]: At program point L4923(line 4923) the Hoare annotation is: true [2023-11-23 07:30:43,678 INFO L902 garLoopResultBuilder]: At program point L4922(line 4922) the Hoare annotation is: true [2023-11-23 07:30:43,678 INFO L899 garLoopResultBuilder]: For program point L4923-1(line 4923) no Hoare annotation was computed. [2023-11-23 07:30:43,678 INFO L902 garLoopResultBuilder]: At program point L4920-1(line 4920) the Hoare annotation is: true [2023-11-23 07:30:43,678 INFO L899 garLoopResultBuilder]: For program point L4921-2(line 4921) no Hoare annotation was computed. [2023-11-23 07:30:43,678 INFO L899 garLoopResultBuilder]: For program point L4920-2(line 4920) no Hoare annotation was computed. [2023-11-23 07:30:43,678 INFO L902 garLoopResultBuilder]: At program point L4921(line 4921) the Hoare annotation is: true [2023-11-23 07:30:43,678 INFO L902 garLoopResultBuilder]: At program point L4922-1(line 4922) the Hoare annotation is: true [2023-11-23 07:30:43,678 INFO L902 garLoopResultBuilder]: At program point L4920(line 4920) the Hoare annotation is: true [2023-11-23 07:30:43,678 INFO L902 garLoopResultBuilder]: At program point L4921-1(line 4921) the Hoare annotation is: true [2023-11-23 07:30:43,678 INFO L899 garLoopResultBuilder]: For program point L4922-2(line 4922) no Hoare annotation was computed. [2023-11-23 07:30:43,678 INFO L902 garLoopResultBuilder]: At program point L4912-1(line 4912) the Hoare annotation is: true [2023-11-23 07:30:43,678 INFO L899 garLoopResultBuilder]: For program point L4912-2(line 4912) no Hoare annotation was computed. [2023-11-23 07:30:43,678 INFO L902 garLoopResultBuilder]: At program point L4913(lines 4913 4915) the Hoare annotation is: true [2023-11-23 07:30:43,678 INFO L902 garLoopResultBuilder]: At program point L4912(line 4912) the Hoare annotation is: true [2023-11-23 07:30:43,678 INFO L899 garLoopResultBuilder]: For program point L4913-1(lines 4913 4915) no Hoare annotation was computed. [2023-11-23 07:30:43,678 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4909 4924) the Hoare annotation is: true [2023-11-23 07:30:43,678 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_insert_beforeEXIT(lines 4909 4924) no Hoare annotation was computed. [2023-11-23 07:30:43,678 INFO L899 garLoopResultBuilder]: For program point L7356-2(line 7356) no Hoare annotation was computed. [2023-11-23 07:30:43,679 INFO L895 garLoopResultBuilder]: At program point L4986(line 4986) the Hoare annotation is: false [2023-11-23 07:30:43,679 INFO L895 garLoopResultBuilder]: At program point L7356-1(line 7356) the Hoare annotation is: false [2023-11-23 07:30:43,679 INFO L895 garLoopResultBuilder]: At program point L7356(line 7356) the Hoare annotation is: false [2023-11-23 07:30:43,679 INFO L895 garLoopResultBuilder]: At program point L4982(line 4982) the Hoare annotation is: (and (let ((.cse4 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_push_front_~list#1.base|)) (.cse3 (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_linked_list_push_front_~list#1.base|)) (.cse6 (+ 8 |ULTIMATE.start_aws_linked_list_push_front_~list#1.offset|))) (let ((.cse1 (= (select .cse3 .cse6) 0)) (.cse2 (+ 16 |ULTIMATE.start_aws_linked_list_push_front_~list#1.offset|)) (.cse0 (select .cse4 (+ |ULTIMATE.start_aws_linked_list_push_front_~list#1.offset| 24))) (.cse5 (= (select .cse4 .cse6) 0))) (or (and (= .cse0 |ULTIMATE.start_aws_linked_list_push_front_~list#1.base|) .cse1 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| Int)) (and (= .cse2 (select .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|)) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| |ULTIMATE.start_aws_linked_list_push_front_~list#1.offset|) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|) |ULTIMATE.start_aws_linked_list_push_front_~list#1.base|))) .cse5) (and .cse1 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (and (= |ULTIMATE.start_aws_linked_list_push_front_~list#1.base| (select (select |#memory_$Pointer$#2.base| .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|)) (= (select (select |#memory_$Pointer$#2.offset| .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) .cse2))) (<= (+ .cse0 2) |ULTIMATE.start_aws_linked_list_push_front_~list#1.base|) .cse5)))) (not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0)) (not (= |ULTIMATE.start_aws_linked_list_push_front_~list#1.base| 0))) [2023-11-23 07:30:43,679 INFO L899 garLoopResultBuilder]: For program point L4986-1(line 4986) no Hoare annotation was computed. [2023-11-23 07:30:43,679 INFO L895 garLoopResultBuilder]: At program point L4982-1(line 4982) the Hoare annotation is: (let ((.cse5 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_push_front_~list#1.base|)) (.cse4 (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_linked_list_push_front_~list#1.base|)) (.cse7 (+ 8 |ULTIMATE.start_aws_linked_list_push_front_~list#1.offset|))) (let ((.cse1 (= (select .cse4 .cse7) 0)) (.cse3 (+ 16 |ULTIMATE.start_aws_linked_list_push_front_~list#1.offset|)) (.cse0 (select .cse5 (+ |ULTIMATE.start_aws_linked_list_push_front_~list#1.offset| 24))) (.cse2 (= |ULTIMATE.start_aws_linked_list_push_front_#t~ret409#1| 0)) (.cse6 (= (select .cse5 .cse7) 0))) (or (and (= .cse0 |ULTIMATE.start_aws_linked_list_push_front_~list#1.base|) .cse1 .cse2 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| Int)) (and (= .cse3 (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|)) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| |ULTIMATE.start_aws_linked_list_push_front_~list#1.offset|) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|) |ULTIMATE.start_aws_linked_list_push_front_~list#1.base|))) .cse6) (and .cse1 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (and (= |ULTIMATE.start_aws_linked_list_push_front_~list#1.base| (select (select |#memory_$Pointer$#2.base| .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|)) (= (select (select |#memory_$Pointer$#2.offset| .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) .cse3))) (<= (+ .cse0 2) |ULTIMATE.start_aws_linked_list_push_front_~list#1.base|) .cse2 .cse6)))) [2023-11-23 07:30:43,683 INFO L899 garLoopResultBuilder]: For program point L4982-2(line 4982) no Hoare annotation was computed. [2023-11-23 07:30:43,683 INFO L895 garLoopResultBuilder]: At program point L4987(line 4987) the Hoare annotation is: false [2023-11-23 07:30:43,683 INFO L895 garLoopResultBuilder]: At program point L4987-1(line 4987) the Hoare annotation is: false [2023-11-23 07:30:43,683 INFO L899 garLoopResultBuilder]: For program point L7357-1(line 7357) no Hoare annotation was computed. [2023-11-23 07:30:43,683 INFO L895 garLoopResultBuilder]: At program point L7357(line 7357) the Hoare annotation is: false [2023-11-23 07:30:43,683 INFO L895 garLoopResultBuilder]: At program point L4983(lines 4983 4985) the Hoare annotation is: false [2023-11-23 07:30:43,683 INFO L899 garLoopResultBuilder]: For program point L4983-1(lines 4983 4985) no Hoare annotation was computed. [2023-11-23 07:30:43,684 INFO L899 garLoopResultBuilder]: For program point L4987-2(line 4987) no Hoare annotation was computed. [2023-11-23 07:30:43,684 INFO L895 garLoopResultBuilder]: At program point L7358(line 7358) the Hoare annotation is: false [2023-11-23 07:30:43,684 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 07:30:43,684 INFO L899 garLoopResultBuilder]: For program point L6755-4(lines 6755 6762) no Hoare annotation was computed. [2023-11-23 07:30:43,684 INFO L895 garLoopResultBuilder]: At program point L6755-3(lines 6755 6762) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0)) (let ((.cse5 (+ |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 8))) (let ((.cse0 (= (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse5) 0)) (.cse1 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base|)) (.cse2 (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse5) 0)) (.cse3 (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.offset|)) (.cse4 (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) (<= |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset|) .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= (+ 2 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base|) .cse2 .cse3 .cse4))))) [2023-11-23 07:30:43,684 INFO L899 garLoopResultBuilder]: For program point L4988-1(line 4988) no Hoare annotation was computed. [2023-11-23 07:30:43,684 INFO L895 garLoopResultBuilder]: At program point L7354(line 7354) the Hoare annotation is: false [2023-11-23 07:30:43,684 INFO L895 garLoopResultBuilder]: At program point L4988(line 4988) the Hoare annotation is: false [2023-11-23 07:30:43,685 INFO L899 garLoopResultBuilder]: For program point L7358-1(line 7358) no Hoare annotation was computed. [2023-11-23 07:30:43,685 INFO L899 garLoopResultBuilder]: For program point L6743-1(line 6743) no Hoare annotation was computed. [2023-11-23 07:30:43,685 INFO L895 garLoopResultBuilder]: At program point L6743(line 6743) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0)) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base|)) [2023-11-23 07:30:43,685 INFO L899 garLoopResultBuilder]: For program point L7354-2(line 7354) no Hoare annotation was computed. [2023-11-23 07:30:43,685 INFO L895 garLoopResultBuilder]: At program point L7354-1(line 7354) the Hoare annotation is: false [2023-11-23 07:30:43,685 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 07:30:43,685 INFO L895 garLoopResultBuilder]: At program point L7355-1(line 7355) the Hoare annotation is: false [2023-11-23 07:30:43,686 INFO L895 garLoopResultBuilder]: At program point L7355(line 7355) the Hoare annotation is: false [2023-11-23 07:30:43,686 INFO L899 garLoopResultBuilder]: For program point L6744-1(line 6744) no Hoare annotation was computed. [2023-11-23 07:30:43,686 INFO L895 garLoopResultBuilder]: At program point L6744(line 6744) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0)) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base|)) [2023-11-23 07:30:43,686 INFO L899 garLoopResultBuilder]: For program point L7355-2(line 7355) no Hoare annotation was computed. [2023-11-23 07:30:43,686 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-23 07:30:43,686 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-23 07:30:43,686 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-23 07:30:43,686 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-23 07:30:43,686 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-23 07:30:43,687 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-23 07:30:43,687 INFO L899 garLoopResultBuilder]: For program point L4734(lines 4734 4738) no Hoare annotation was computed. [2023-11-23 07:30:43,687 INFO L899 garLoopResultBuilder]: For program point L4751(lines 4751 4761) no Hoare annotation was computed. [2023-11-23 07:30:43,687 INFO L899 garLoopResultBuilder]: For program point L4694(line 4694) no Hoare annotation was computed. [2023-11-23 07:30:43,687 INFO L899 garLoopResultBuilder]: For program point L4694-3(lines 4694 4695) no Hoare annotation was computed. [2023-11-23 07:30:43,687 INFO L899 garLoopResultBuilder]: For program point L4756-1(lines 4756 4761) no Hoare annotation was computed. [2023-11-23 07:30:43,687 INFO L899 garLoopResultBuilder]: For program point L4694-2(line 4694) no Hoare annotation was computed. [2023-11-23 07:30:43,687 INFO L895 garLoopResultBuilder]: At program point L4756(line 4756) the Hoare annotation is: (and (forall ((|v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse1 (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2|))) (let ((.cse0 (+ |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2| 8)) (.cse2 (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2| 24)))) (or (not (= (select (select |#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2|) .cse0) 0)) (not (= (select .cse1 .cse0) 0)) (< |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2| (+ 2 .cse2)) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (or (not (= |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2| (select (select |#memory_$Pointer$#2.base| .cse2) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (not (= (+ |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2| 16) (select (select |#memory_$Pointer$#2.offset| .cse2) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| Int) (|v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse6 (select |#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1|))) (let ((.cse3 (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|))) (let ((.cse4 (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1|)) (.cse5 (+ .cse3 (- 8)))) (or (< .cse3 (+ 16 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|)) (not (= |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|))) (not (= |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1| (select .cse4 (+ .cse3 8)))) (not (= (select .cse4 .cse5) 0)) (not (= (select .cse6 .cse5) 0)))))))) [2023-11-23 07:30:43,688 INFO L899 garLoopResultBuilder]: For program point L4694-8(lines 4694 4696) no Hoare annotation was computed. [2023-11-23 07:30:43,688 INFO L899 garLoopResultBuilder]: For program point L4694-5(lines 4694 4695) no Hoare annotation was computed. [2023-11-23 07:30:43,689 INFO L899 garLoopResultBuilder]: For program point L4694-6(lines 4694 4696) no Hoare annotation was computed. [2023-11-23 07:30:43,689 INFO L899 garLoopResultBuilder]: For program point L4694-11(lines 4694 4704) no Hoare annotation was computed. [2023-11-23 07:30:43,689 INFO L899 garLoopResultBuilder]: For program point L4694-9(lines 4694 4697) no Hoare annotation was computed. [2023-11-23 07:30:43,691 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_is_validEXIT(lines 4691 4708) no Hoare annotation was computed. [2023-11-23 07:30:43,691 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_is_valid_deep_returnLabel#1(lines 4731 4765) no Hoare annotation was computed. [2023-11-23 07:30:43,691 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4691 4708) the Hoare annotation is: true [2023-11-23 07:30:43,691 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_is_validFINAL(lines 4691 4708) no Hoare annotation was computed. [2023-11-23 07:30:43,691 INFO L899 garLoopResultBuilder]: For program point L4750-3(lines 4750 4763) no Hoare annotation was computed. [2023-11-23 07:30:43,691 INFO L895 garLoopResultBuilder]: At program point L4750-2(lines 4750 4763) the Hoare annotation is: (and (forall ((|v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse1 (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2|))) (let ((.cse0 (+ |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2| 8)) (.cse2 (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2| 24)))) (or (not (= (select (select |#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2|) .cse0) 0)) (not (= (select .cse1 .cse0) 0)) (< |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2| (+ 2 .cse2)) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (or (not (= |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2| (select (select |#memory_$Pointer$#2.base| .cse2) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (not (= (+ |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2| 16) (select (select |#memory_$Pointer$#2.offset| .cse2) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| Int) (|v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse6 (select |#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1|))) (let ((.cse3 (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|))) (let ((.cse4 (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1|)) (.cse5 (+ .cse3 (- 8)))) (or (< .cse3 (+ 16 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|)) (not (= |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|))) (not (= |v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1| (select .cse4 (+ .cse3 8)))) (not (= (select .cse4 .cse5) 0)) (not (= (select .cse6 .cse5) 0)))))))) [2023-11-23 07:30:43,694 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:30:43,696 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 07:30:43,713 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~list!base][~list!offset + 8] could not be translated [2023-11-23 07:30:43,713 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:43,714 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:43,714 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~list!base][~list!offset + 8] could not be translated [2023-11-23 07:30:43,714 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:43,714 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:43,714 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~list!base][~list!offset + 8] could not be translated [2023-11-23 07:30:43,714 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~list!base][~list!offset + 8] could not be translated [2023-11-23 07:30:43,715 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:43,715 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:43,717 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2 : int, v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2 : int :: ((!(#memory_$Pointer$#2.offset[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2][v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2 + 8] == 0) || !(#memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2][v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2 + 8] == 0)) || v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2 < 2 + #memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2][v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2 + 24]) || (forall v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20 : int :: !(v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2 == #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2][v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2 + 24]][v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20]) || !(v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2 + 16 == #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2][v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2 + 24]][v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20]))) could not be translated [2023-11-23 07:30:43,717 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17 : int, v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1 : int :: (((#memory_$Pointer$#2.offset[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1][v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17] < 16 + v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17 || !(v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1 == #memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1][v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17])) || !(v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1 == #memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1][#memory_$Pointer$#2.offset[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1][v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17] + 8])) || !(#memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1][#memory_$Pointer$#2.offset[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1][v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17] + -8] == 0)) || !(#memory_$Pointer$#2.offset[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1][#memory_$Pointer$#2.offset[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1][v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17] + -8] == 0)) could not be translated [2023-11-23 07:30:43,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 07:30:43 BoogieIcfgContainer [2023-11-23 07:30:43,718 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 07:30:43,719 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 07:30:43,719 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 07:30:43,719 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 07:30:43,720 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:30:30" (3/4) ... [2023-11-23 07:30:43,721 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 07:30:43,724 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2023-11-23 07:30:43,724 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2023-11-23 07:30:43,724 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:30:43,724 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_insert_before [2023-11-23 07:30:43,725 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-23 07:30:43,725 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-23 07:30:43,725 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_is_valid [2023-11-23 07:30:43,734 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2023-11-23 07:30:43,734 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-23 07:30:43,735 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 07:30:43,735 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 07:30:43,839 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 07:30:43,839 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 07:30:43,839 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 07:30:43,840 INFO L158 Benchmark]: Toolchain (without parser) took 15264.35ms. Allocated memory was 138.4MB in the beginning and 421.5MB in the end (delta: 283.1MB). Free memory was 97.0MB in the beginning and 203.8MB in the end (delta: -106.8MB). Peak memory consumption was 175.0MB. Max. memory is 16.1GB. [2023-11-23 07:30:43,843 INFO L158 Benchmark]: CDTParser took 1.73ms. Allocated memory is still 113.2MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 07:30:43,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1510.97ms. Allocated memory is still 138.4MB. Free memory was 97.0MB in the beginning and 75.6MB in the end (delta: 21.4MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. [2023-11-23 07:30:43,844 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.05ms. Allocated memory is still 138.4MB. Free memory was 75.1MB in the beginning and 69.2MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 07:30:43,844 INFO L158 Benchmark]: Boogie Preprocessor took 63.83ms. Allocated memory is still 138.4MB. Free memory was 69.2MB in the beginning and 64.6MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 07:30:43,844 INFO L158 Benchmark]: RCFGBuilder took 632.71ms. Allocated memory was 138.4MB in the beginning and 209.7MB in the end (delta: 71.3MB). Free memory was 64.6MB in the beginning and 150.5MB in the end (delta: -85.8MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2023-11-23 07:30:43,845 INFO L158 Benchmark]: TraceAbstraction took 12856.57ms. Allocated memory was 209.7MB in the beginning and 421.5MB in the end (delta: 211.8MB). Free memory was 149.4MB in the beginning and 211.1MB in the end (delta: -61.7MB). Peak memory consumption was 150.1MB. Max. memory is 16.1GB. [2023-11-23 07:30:43,847 INFO L158 Benchmark]: Witness Printer took 120.67ms. Allocated memory is still 421.5MB. Free memory was 211.1MB in the beginning and 203.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 07:30:43,848 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.73ms. Allocated memory is still 113.2MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1510.97ms. Allocated memory is still 138.4MB. Free memory was 97.0MB in the beginning and 75.6MB in the end (delta: 21.4MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.05ms. Allocated memory is still 138.4MB. Free memory was 75.1MB in the beginning and 69.2MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.83ms. Allocated memory is still 138.4MB. Free memory was 69.2MB in the beginning and 64.6MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 632.71ms. Allocated memory was 138.4MB in the beginning and 209.7MB in the end (delta: 71.3MB). Free memory was 64.6MB in the beginning and 150.5MB in the end (delta: -85.8MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12856.57ms. Allocated memory was 209.7MB in the beginning and 421.5MB in the end (delta: 211.8MB). Free memory was 149.4MB in the beginning and 211.1MB in the end (delta: -61.7MB). Peak memory consumption was 150.1MB. Max. memory is 16.1GB. * Witness Printer took 120.67ms. Allocated memory is still 421.5MB. Free memory was 211.1MB in the beginning and 203.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~list!base][~list!offset + 8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~list!base][~list!offset + 8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~list!base][~list!offset + 8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~list!base][~list!offset + 8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2 : int, v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2 : int :: ((!(#memory_$Pointer$#2.offset[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2][v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2 + 8] == 0) || !(#memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2][v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2 + 8] == 0)) || v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2 < 2 + #memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2][v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2 + 24]) || (forall v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20 : int :: !(v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2 == #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2][v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2 + 24]][v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20]) || !(v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2 + 16 == #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_2][v_ULTIMATE.start_aws_linked_list_push_front_~list#1.offset_BEFORE_CALL_2 + 24]][v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20]))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17 : int, v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1 : int :: (((#memory_$Pointer$#2.offset[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1][v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17] < 16 + v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17 || !(v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1 == #memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1][v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17])) || !(v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1 == #memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1][#memory_$Pointer$#2.offset[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1][v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17] + 8])) || !(#memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1][#memory_$Pointer$#2.offset[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1][v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17] + -8] == 0)) || !(#memory_$Pointer$#2.offset[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1][#memory_$Pointer$#2.offset[v_ULTIMATE.start_aws_linked_list_push_front_~list#1.base_BEFORE_CALL_1][v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17] + -8] == 0)) could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 326 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 295 mSDsluCounter, 4770 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 163 IncrementalHoareTripleChecker+Unchecked, 4064 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1738 IncrementalHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 706 mSDtfsCounter, 1738 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 477 GetRequests, 394 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=2, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 100 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 319 PreInvPairs, 324 NumberOfFragments, 628 HoareAnnotationTreeSize, 319 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 37 FomulaSimplificationsInter, 851 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 708 NumberOfCodeBlocks, 708 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 767 ConstructedInterpolants, 27 QuantifiedInterpolants, 3590 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1372 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 480/509 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6755]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 4750]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-23 07:30:43,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE