./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_next_harness.i --full-output --preprocessor.use.memory.slicer false --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_next_harness.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 5bb1e95e9d6379d31cbb3e207d6fe85ddf495edebf9b764e927537f63dbf829e --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:49:38,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:49:38,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:49:38,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:49:38,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:49:38,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:49:38,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:49:38,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:49:38,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:49:38,983 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:49:38,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:49:38,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:49:38,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:49:38,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:49:38,985 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:49:38,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:49:38,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:49:38,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:49:38,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:49:38,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:49:38,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:49:38,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:49:38,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:49:38,986 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:49:38,987 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:49:38,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:49:38,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:49:38,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:49:38,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:49:38,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:49:38,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:49:38,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:49:38,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:49:38,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:49:38,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:49:38,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:49:38,989 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:49:38,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:49:38,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:49:38,989 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 -> 5bb1e95e9d6379d31cbb3e207d6fe85ddf495edebf9b764e927537f63dbf829e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:49:39,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:49:39,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:49:39,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:49:39,216 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:49:39,216 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:49:39,217 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_next_harness.i [2023-11-23 08:49:40,174 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:49:40,486 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:49:40,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_next_harness.i [2023-11-23 08:49:40,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55d3d40ed/7c8d495da5fc4aaa82d9719e40a963a2/FLAG97af27a8e [2023-11-23 08:49:40,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55d3d40ed/7c8d495da5fc4aaa82d9719e40a963a2 [2023-11-23 08:49:40,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:49:40,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:49:40,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:49:40,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:49:40,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:49:40,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:49:40" (1/1) ... [2023-11-23 08:49:40,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab3ac17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:40, skipping insertion in model container [2023-11-23 08:49:40,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:49:40" (1/1) ... [2023-11-23 08:49:40,599 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:49:40,762 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_next_harness.i[4494,4507] [2023-11-23 08:49:40,770 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_next_harness.i[4554,4567] [2023-11-23 08:49:41,247 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,248 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,248 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,249 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,249 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,258 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,259 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,260 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,261 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,262 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,262 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,263 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,263 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,504 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:49:41,505 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:49:41,506 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:49:41,506 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:49:41,507 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:49:41,509 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:49:41,509 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:49:41,511 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:49:41,511 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:49:41,512 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:49:41,683 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:49:41,718 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:49:41,749 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_next_harness.i[4494,4507] [2023-11-23 08:49:41,750 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_next_harness.i[4554,4567] [2023-11-23 08:49:41,786 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,787 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,787 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,790 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,790 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,801 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,802 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,803 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,803 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,803 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,804 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,804 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,804 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:49:41,839 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:49:41,840 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:49:41,840 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:49:41,841 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:49:41,841 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:49:41,842 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:49:41,842 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:49:41,843 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:49:41,843 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:49:41,844 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:49:41,873 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:49:42,118 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:42,125 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:42,125 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:42,125 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:42,126 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:42,126 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:42,126 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:42,126 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:42,126 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:42,126 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:42,126 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:42,127 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:42,127 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:42,127 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:42,127 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:49:42,132 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:49:42,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:42 WrapperNode [2023-11-23 08:49:42,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:49:42,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:49:42,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:49:42,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:49:42,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:42" (1/1) ... [2023-11-23 08:49:42,289 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:42" (1/1) ... [2023-11-23 08:49:42,324 INFO L138 Inliner]: procedures = 678, calls = 1039, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 56 [2023-11-23 08:49:42,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:49:42,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:49:42,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:49:42,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:49:42,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:42" (1/1) ... [2023-11-23 08:49:42,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:42" (1/1) ... [2023-11-23 08:49:42,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:42" (1/1) ... [2023-11-23 08:49:42,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:42" (1/1) ... [2023-11-23 08:49:42,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:42" (1/1) ... [2023-11-23 08:49:42,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:42" (1/1) ... [2023-11-23 08:49:42,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:42" (1/1) ... [2023-11-23 08:49:42,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:42" (1/1) ... [2023-11-23 08:49:42,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:49:42,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:49:42,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:49:42,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:49:42,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:42" (1/1) ... [2023-11-23 08:49:42,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:49:42,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:49:42,417 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 08:49:42,520 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 08:49:42,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:49:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:49:42,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:49:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:49:42,580 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:49:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:49:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:49:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:49:42,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:49:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:49:42,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:49:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:49:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:49:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:49:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:49:42,582 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:49:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:49:42,909 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:49:42,911 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:49:43,162 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:49:43,214 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:49:43,214 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 08:49:43,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:49:43 BoogieIcfgContainer [2023-11-23 08:49:43,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:49:43,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:49:43,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:49:43,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:49:43,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:49:40" (1/3) ... [2023-11-23 08:49:43,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697cf048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:49:43, skipping insertion in model container [2023-11-23 08:49:43,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:49:42" (2/3) ... [2023-11-23 08:49:43,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697cf048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:49:43, skipping insertion in model container [2023-11-23 08:49:43,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:49:43" (3/3) ... [2023-11-23 08:49:43,220 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_next_harness.i [2023-11-23 08:49:43,232 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:49:43,232 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:49:43,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:49:43,288 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;@7c34542, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:49:43,289 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:49:43,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 08:49:43,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 08:49:43,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:43,297 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:49:43,298 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:43,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:43,301 INFO L85 PathProgramCache]: Analyzing trace with hash 155807456, now seen corresponding path program 1 times [2023-11-23 08:49:43,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:43,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738392466] [2023-11-23 08:49:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:43,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:49:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:43,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:49:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:43,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:49:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 08:49:43,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:43,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738392466] [2023-11-23 08:49:43,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738392466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:43,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:49:43,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 08:49:43,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624254340] [2023-11-23 08:49:43,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:43,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 08:49:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:43,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 08:49:43,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:49:43,986 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 08:49:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:44,017 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2023-11-23 08:49:44,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 08:49:44,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-11-23 08:49:44,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:44,025 INFO L225 Difference]: With dead ends: 81 [2023-11-23 08:49:44,025 INFO L226 Difference]: Without dead ends: 41 [2023-11-23 08:49:44,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:49:44,033 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:44,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:49:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-23 08:49:44,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-23 08:49:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 08:49:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2023-11-23 08:49:44,069 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 25 [2023-11-23 08:49:44,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:44,070 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2023-11-23 08:49:44,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 08:49:44,071 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2023-11-23 08:49:44,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 08:49:44,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:44,074 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:49:44,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:49:44,075 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:44,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:44,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1124056222, now seen corresponding path program 1 times [2023-11-23 08:49:44,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:44,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732814930] [2023-11-23 08:49:44,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:44,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:44,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:49:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:44,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:49:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:44,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:49:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:49:45,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:45,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732814930] [2023-11-23 08:49:45,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732814930] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:45,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:49:45,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 08:49:45,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979925299] [2023-11-23 08:49:45,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:45,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:49:45,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:45,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:49:45,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:49:45,094 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 08:49:45,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:45,302 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2023-11-23 08:49:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:49:45,303 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-23 08:49:45,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:45,307 INFO L225 Difference]: With dead ends: 51 [2023-11-23 08:49:45,307 INFO L226 Difference]: Without dead ends: 49 [2023-11-23 08:49:45,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:49:45,308 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 13 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:45,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 245 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:49:45,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-23 08:49:45,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2023-11-23 08:49:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 08:49:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2023-11-23 08:49:45,317 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 25 [2023-11-23 08:49:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:45,318 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2023-11-23 08:49:45,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 08:49:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2023-11-23 08:49:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 08:49:45,319 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:45,319 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:49:45,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 08:49:45,319 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:45,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:45,319 INFO L85 PathProgramCache]: Analyzing trace with hash 650951140, now seen corresponding path program 1 times [2023-11-23 08:49:45,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:45,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059184008] [2023-11-23 08:49:45,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:45,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:45,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:49:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:45,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:49:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:45,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:49:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:45,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 08:49:45,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:45,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059184008] [2023-11-23 08:49:45,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059184008] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:49:45,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388818522] [2023-11-23 08:49:45,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:45,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:49:45,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:49:45,693 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 08:49:45,695 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 08:49:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:45,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-23 08:49:45,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:49:45,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 08:49:45,838 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 18 treesize of output 12 [2023-11-23 08:49:45,851 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 08:49:45,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2023-11-23 08:49:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:49:46,218 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:49:46,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388818522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:46,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:49:46,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2023-11-23 08:49:46,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103918095] [2023-11-23 08:49:46,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:46,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:49:46,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:46,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:49:46,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-11-23 08:49:46,222 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 08:49:46,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:46,509 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2023-11-23 08:49:46,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:49:46,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-23 08:49:46,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:46,511 INFO L225 Difference]: With dead ends: 99 [2023-11-23 08:49:46,511 INFO L226 Difference]: Without dead ends: 53 [2023-11-23 08:49:46,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2023-11-23 08:49:46,512 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 39 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:46,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 112 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:49:46,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-23 08:49:46,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2023-11-23 08:49:46,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2023-11-23 08:49:46,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2023-11-23 08:49:46,519 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 25 [2023-11-23 08:49:46,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:46,519 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2023-11-23 08:49:46,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 08:49:46,520 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2023-11-23 08:49:46,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 08:49:46,520 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:46,521 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:49:46,535 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 08:49:46,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:49:46,735 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:46,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:46,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1331009510, now seen corresponding path program 1 times [2023-11-23 08:49:46,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:46,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538007747] [2023-11-23 08:49:46,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:46,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:46,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:49:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:46,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:49:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:46,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:49:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:46,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:49:46,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:46,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538007747] [2023-11-23 08:49:46,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538007747] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:49:46,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765626766] [2023-11-23 08:49:46,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:46,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:49:46,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:49:46,984 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 08:49:47,004 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 08:49:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:47,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:49:47,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:49:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:49:47,115 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:49:47,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765626766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:47,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:49:47,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-11-23 08:49:47,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549402942] [2023-11-23 08:49:47,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:47,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:49:47,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:47,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:49:47,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:49:47,117 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 08:49:47,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:47,153 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2023-11-23 08:49:47,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:49:47,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-23 08:49:47,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:47,155 INFO L225 Difference]: With dead ends: 103 [2023-11-23 08:49:47,155 INFO L226 Difference]: Without dead ends: 53 [2023-11-23 08:49:47,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:49:47,156 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:47,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 165 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:49:47,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-23 08:49:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2023-11-23 08:49:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-23 08:49:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2023-11-23 08:49:47,162 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 25 [2023-11-23 08:49:47,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:47,163 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2023-11-23 08:49:47,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 08:49:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2023-11-23 08:49:47,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 08:49:47,164 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:47,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:49:47,176 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 08:49:47,376 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,SelfDestructingSolverStorable3 [2023-11-23 08:49:47,377 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:47,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:47,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1420762213, now seen corresponding path program 1 times [2023-11-23 08:49:47,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:47,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160713858] [2023-11-23 08:49:47,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:47,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:47,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:49:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:47,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:49:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:47,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:49:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:48,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:49:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:48,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:49:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 08:49:48,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:48,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160713858] [2023-11-23 08:49:48,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160713858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:49:48,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:49:48,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 08:49:48,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218054261] [2023-11-23 08:49:48,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:49:48,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:49:48,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:49:48,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:49:48,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:49:48,157 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-23 08:49:48,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:49:48,338 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2023-11-23 08:49:48,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:49:48,339 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2023-11-23 08:49:48,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:49:48,339 INFO L225 Difference]: With dead ends: 59 [2023-11-23 08:49:48,340 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 08:49:48,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:49:48,340 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:49:48,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 297 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:49:48,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 08:49:48,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2023-11-23 08:49:48,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 08:49:48,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2023-11-23 08:49:48,348 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 38 [2023-11-23 08:49:48,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:49:48,348 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2023-11-23 08:49:48,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-23 08:49:48,348 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2023-11-23 08:49:48,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 08:49:48,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:49:48,349 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:49:48,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 08:49:48,349 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:49:48,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:49:48,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1099197721, now seen corresponding path program 1 times [2023-11-23 08:49:48,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:49:48,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292926907] [2023-11-23 08:49:48,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:48,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:49:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:48,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:49:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:48,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:49:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:48,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:49:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:48,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:49:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:48,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:49:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:49:48,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:49:48,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292926907] [2023-11-23 08:49:48,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292926907] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:49:48,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732953955] [2023-11-23 08:49:48,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:49:48,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:49:48,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:49:48,808 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 08:49:48,848 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 08:49:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:49:48,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-23 08:49:48,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:49:48,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-11-23 08:49:48,964 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-23 08:49:48,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 101 [2023-11-23 08:49:48,971 INFO L349 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2023-11-23 08:49:48,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 1 [2023-11-23 08:49:48,978 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 15 treesize of output 13 [2023-11-23 08:49:48,984 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 18 treesize of output 12 [2023-11-23 08:49:51,019 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_7|) 0))) (and (<= |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$.base| .cse0) (+ 8 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_7|) 0)))) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_7|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_7|)))) is different from true [2023-11-23 08:50:04,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-23 08:50:08,759 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_9| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_9|) 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_9|) (<= |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$.base| .cse0) (+ |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_1| 8))) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_9|))))) is different from true [2023-11-23 08:50:12,137 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_9| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_9|) 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_9|) (<= |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$.base| .cse0) (+ |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_1| 8))) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_9|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_2| Int) (|ULTIMATE.start_aws_linked_list_next_~node#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0))) (and (not (= .cse1 |ULTIMATE.start_aws_linked_list_next_~node#1.base|)) (<= |ULTIMATE.start_aws_linked_list_next_~node#1.base| (select (select |c_#memory_$Pointer$.base| .cse1) (+ |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_2| 8))) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|))))) is different from true [2023-11-23 08:50:14,431 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_3| Int) (|ULTIMATE.start_aws_linked_list_next_~node#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0))) (and (not (= .cse0 |ULTIMATE.start_aws_linked_list_next_~node#1.base|)) (<= |ULTIMATE.start_aws_linked_list_next_~node#1.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_3| 8))) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_9| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_9|) 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_9|) (<= |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$.base| .cse1) (+ |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_1| 8))) (not (= .cse1 |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_9|)))))) is different from true [2023-11-23 08:50:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-23 08:50:27,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:50:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 08:50:43,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732953955] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:43,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:50:43,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 13] total 29 [2023-11-23 08:50:43,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789224633] [2023-11-23 08:50:43,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:43,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:50:43,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:43,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:50:43,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=505, Unknown=23, NotChecked=196, Total=812 [2023-11-23 08:50:43,418 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 08:50:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:50,124 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2023-11-23 08:50:50,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:50:50,125 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-11-23 08:50:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:50,125 INFO L225 Difference]: With dead ends: 96 [2023-11-23 08:50:50,125 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 08:50:50,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 60.3s TimeCoverageRelationStatistics Valid=110, Invalid=637, Unknown=25, NotChecked=220, Total=992 [2023-11-23 08:50:50,126 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:50,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 156 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:50:50,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 08:50:50,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2023-11-23 08:50:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 41 states have internal predecessors, (44), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2023-11-23 08:50:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2023-11-23 08:50:50,149 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 38 [2023-11-23 08:50:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:50,150 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2023-11-23 08:50:50,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 08:50:50,150 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2023-11-23 08:50:50,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 08:50:50,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:50,154 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:50:50,168 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 08:50:50,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:50,366 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:50,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:50,367 INFO L85 PathProgramCache]: Analyzing trace with hash -419139351, now seen corresponding path program 1 times [2023-11-23 08:50:50,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:50,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59385265] [2023-11-23 08:50:50,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:50,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:50,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:50,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:50:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:50,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:50:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:50,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:50:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:50,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:50:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:50:50,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:50,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59385265] [2023-11-23 08:50:50,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59385265] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:50,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222730982] [2023-11-23 08:50:50,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:50,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:50,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:50,628 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:50:50,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 08:50:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:50,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-23 08:50:50,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:50,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 08:50:50,776 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 18 treesize of output 12 [2023-11-23 08:50:50,784 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 08:50:50,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2023-11-23 08:50:50,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-23 08:50:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 08:50:50,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:50:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 08:50:51,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222730982] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:51,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:50:51,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 8] total 18 [2023-11-23 08:50:51,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205239087] [2023-11-23 08:50:51,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:51,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:50:51,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:51,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:50:51,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2023-11-23 08:50:51,083 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 08:50:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:51,150 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2023-11-23 08:50:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:50:51,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-11-23 08:50:51,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:51,151 INFO L225 Difference]: With dead ends: 105 [2023-11-23 08:50:51,151 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 08:50:51,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2023-11-23 08:50:51,152 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:51,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 197 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:50:51,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 08:50:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2023-11-23 08:50:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-23 08:50:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2023-11-23 08:50:51,162 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 38 [2023-11-23 08:50:51,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:51,165 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2023-11-23 08:50:51,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 08:50:51,165 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2023-11-23 08:50:51,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-23 08:50:51,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:51,167 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:50:51,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 08:50:51,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:51,372 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:51,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:51,373 INFO L85 PathProgramCache]: Analyzing trace with hash 652205250, now seen corresponding path program 1 times [2023-11-23 08:50:51,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:51,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941579413] [2023-11-23 08:50:51,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:51,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:51,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:51,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:50:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:51,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:50:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:51,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:50:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:51,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:50:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:51,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:50:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 08:50:51,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:51,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941579413] [2023-11-23 08:50:51,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941579413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:50:51,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:50:51,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:50:51,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779044125] [2023-11-23 08:50:51,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:51,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:50:51,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:51,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:50:51,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:50:51,551 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 08:50:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:51,617 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2023-11-23 08:50:51,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:50:51,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2023-11-23 08:50:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:51,619 INFO L225 Difference]: With dead ends: 63 [2023-11-23 08:50:51,619 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 08:50:51,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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 08:50:51,620 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:51,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:50:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 08:50:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-23 08:50:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 42 states have internal predecessors, (46), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-23 08:50:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2023-11-23 08:50:51,634 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 44 [2023-11-23 08:50:51,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:51,636 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2023-11-23 08:50:51,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 08:50:51,636 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2023-11-23 08:50:51,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 08:50:51,638 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:51,638 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:50:51,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 08:50:51,638 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:51,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:51,639 INFO L85 PathProgramCache]: Analyzing trace with hash 531824209, now seen corresponding path program 1 times [2023-11-23 08:50:51,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:51,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141189789] [2023-11-23 08:50:51,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:51,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:50:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:50:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:50:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:50:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:50:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:50:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:50:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 08:50:52,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:52,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141189789] [2023-11-23 08:50:52,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141189789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:50:52,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:50:52,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 08:50:52,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461953990] [2023-11-23 08:50:52,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:52,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:50:52,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:52,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:50:52,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:50:52,302 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 10 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:50:52,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:52,471 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2023-11-23 08:50:52,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:50:52,472 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2023-11-23 08:50:52,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:52,472 INFO L225 Difference]: With dead ends: 71 [2023-11-23 08:50:52,472 INFO L226 Difference]: Without dead ends: 69 [2023-11-23 08:50:52,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:50:52,473 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 16 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:52,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 258 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:50:52,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-23 08:50:52,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-11-23 08:50:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 47 states have internal predecessors, (50), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 08:50:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2023-11-23 08:50:52,479 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 57 [2023-11-23 08:50:52,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:52,479 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2023-11-23 08:50:52,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:50:52,479 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2023-11-23 08:50:52,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 08:50:52,480 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:52,480 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:50:52,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 08:50:52,480 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:52,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:52,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1988135725, now seen corresponding path program 1 times [2023-11-23 08:50:52,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:52,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901573163] [2023-11-23 08:50:52,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:52,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:50:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:50:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:50:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:50:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:50:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:50:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:50:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:52,883 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 08:50:52,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:52,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901573163] [2023-11-23 08:50:52,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901573163] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:52,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837945075] [2023-11-23 08:50:52,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:52,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:52,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:52,902 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:50:52,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 08:50:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:53,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-23 08:50:53,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:53,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 08:50:53,099 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 08:50:53,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-23 08:50:53,104 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 18 treesize of output 12 [2023-11-23 08:50:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 08:50:54,037 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:50:54,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837945075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:50:54,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:50:54,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2023-11-23 08:50:54,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536728421] [2023-11-23 08:50:54,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:54,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:50:54,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:54,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:50:54,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2023-11-23 08:50:54,038 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:50:54,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:54,407 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2023-11-23 08:50:54,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:50:54,407 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2023-11-23 08:50:54,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:54,408 INFO L225 Difference]: With dead ends: 92 [2023-11-23 08:50:54,408 INFO L226 Difference]: Without dead ends: 68 [2023-11-23 08:50:54,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2023-11-23 08:50:54,409 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:54,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 109 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:50:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-23 08:50:54,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-23 08:50:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 47 states have internal predecessors, (49), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 08:50:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2023-11-23 08:50:54,430 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 57 [2023-11-23 08:50:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:54,430 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2023-11-23 08:50:54,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:50:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2023-11-23 08:50:54,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 08:50:54,432 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:54,432 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2023-11-23 08:50:54,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 08:50:54,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 08:50:54,648 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:54,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:54,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1308077355, now seen corresponding path program 1 times [2023-11-23 08:50:54,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:54,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420230143] [2023-11-23 08:50:54,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:54,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:54,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:54,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:50:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:50:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:50:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:50:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:50:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:50:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:50:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:50:55,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:55,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420230143] [2023-11-23 08:50:55,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420230143] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:55,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163472758] [2023-11-23 08:50:55,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:55,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:55,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:55,101 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:50:55,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 08:50:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:55,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 08:50:55,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:55,289 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 08:50:55,289 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:50:55,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163472758] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:50:55,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:50:55,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-11-23 08:50:55,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386365256] [2023-11-23 08:50:55,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:55,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:50:55,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:55,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:50:55,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:50:55,292 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 08:50:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:55,323 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2023-11-23 08:50:55,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:50:55,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2023-11-23 08:50:55,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:55,326 INFO L225 Difference]: With dead ends: 94 [2023-11-23 08:50:55,326 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 08:50:55,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:50:55,327 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 3 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:55,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 161 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:50:55,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 08:50:55,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-23 08:50:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 41 states have internal predecessors, (43), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-23 08:50:55,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2023-11-23 08:50:55,357 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 57 [2023-11-23 08:50:55,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:55,358 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2023-11-23 08:50:55,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 08:50:55,358 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2023-11-23 08:50:55,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 08:50:55,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:55,359 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 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] [2023-11-23 08:50:55,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 08:50:55,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:55,571 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:55,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:55,572 INFO L85 PathProgramCache]: Analyzing trace with hash -715585824, now seen corresponding path program 1 times [2023-11-23 08:50:55,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:55,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663693522] [2023-11-23 08:50:55,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:55,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:56,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:56,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:50:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:56,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:50:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:56,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:50:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:56,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:50:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:56,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:50:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:57,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:50:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:57,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:50:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:57,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:50:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:57,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:50:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 08:50:57,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:57,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663693522] [2023-11-23 08:50:57,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663693522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:50:57,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:50:57,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 08:50:57,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876124145] [2023-11-23 08:50:57,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:50:57,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 08:50:57,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:50:57,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 08:50:57,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:50:57,182 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 13 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-23 08:50:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:50:57,473 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2023-11-23 08:50:57,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 08:50:57,473 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 70 [2023-11-23 08:50:57,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:50:57,474 INFO L225 Difference]: With dead ends: 71 [2023-11-23 08:50:57,474 INFO L226 Difference]: Without dead ends: 69 [2023-11-23 08:50:57,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2023-11-23 08:50:57,475 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:50:57,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 264 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:50:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-23 08:50:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-11-23 08:50:57,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 46 states have internal predecessors, (47), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2023-11-23 08:50:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2023-11-23 08:50:57,485 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 70 [2023-11-23 08:50:57,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:50:57,486 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2023-11-23 08:50:57,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-23 08:50:57,486 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2023-11-23 08:50:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 08:50:57,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:50:57,486 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 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] [2023-11-23 08:50:57,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 08:50:57,487 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:50:57,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:50:57,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1059421538, now seen corresponding path program 1 times [2023-11-23 08:50:57,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:50:57,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987738440] [2023-11-23 08:50:57,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:57,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:50:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:57,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:50:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:58,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:50:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:58,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:50:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:58,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:50:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:58,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:50:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:58,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:50:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:58,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:50:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:58,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:50:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:58,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:50:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:58,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:50:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-23 08:50:58,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:50:58,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987738440] [2023-11-23 08:50:58,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987738440] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:50:58,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926856167] [2023-11-23 08:50:58,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:50:58,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:50:58,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:50:58,164 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:50:58,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 08:50:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:50:58,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-23 08:50:58,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:50:58,304 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 18 treesize of output 12 [2023-11-23 08:50:58,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-11-23 08:50:58,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 112 treesize of output 93 [2023-11-23 08:50:58,318 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 63 treesize of output 1 [2023-11-23 08:51:00,347 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_20| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_20|) 0))) (and (<= |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_20| (select (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_20|) 0) 8))) (not (= |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_20| .cse0)) (<= 2 |v_ULTIMATE.start_aws_linked_list_next_~node#1.base_BEFORE_CALL_20|)))) is different from true [2023-11-23 08:51:17,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-23 08:51:19,837 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_19| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_19|) 0))) (and (<= |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_19| (select (select |c_#memory_$Pointer$.base| .cse0) (+ |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_7| 8))) (not (= |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_19| .cse0)) (<= 2 |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_19|)))) is different from true [2023-11-23 08:51:23,938 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_8| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_20|) 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_20|) (<= |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_20| (select (select |c_#memory_$Pointer$.base| .cse0) (+ |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_8| 8))) (not (= |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_20| .cse0))))) is different from true [2023-11-23 08:51:26,337 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_21|) 0))) (and (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_21|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_21|) (<= |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_21| (select (select |c_#memory_$Pointer$.base| .cse0) (+ |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_9| 8)))))) is different from true [2023-11-23 08:51:50,374 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_11| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_23|) 0))) (and (<= |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_23| (select (select |c_#memory_$Pointer$.base| .cse0) (+ |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_11| 8))) (<= 2 |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_23|) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_23|))))) is different from true [2023-11-23 08:52:17,198 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| Int) (|v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0))) (and (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse0)) (<= 2 |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (<= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ |v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset_BEFORE_CALL_2| 8)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_22| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_22|) 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_22|) (not (= |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_22| .cse1)) (<= |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$.base| .cse1) (+ |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_10| 8))))))) is different from true [2023-11-23 08:52:19,339 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| Int) (|v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0))) (and (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse0)) (<= 2 |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (<= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ |v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset_BEFORE_CALL_3| 8)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_22| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_22|) 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_22|) (not (= |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_22| .cse1)) (<= |v_ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$.base| .cse1) (+ |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_10| 8))))))) is different from true [2023-11-23 08:52:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 48 not checked. [2023-11-23 08:52:27,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:52:55,978 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 08:52:55,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926856167] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 08:52:55,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:52:55,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 18] total 37 [2023-11-23 08:52:55,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425676209] [2023-11-23 08:52:55,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:52:55,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:52:55,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:55,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:52:55,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=751, Unknown=44, NotChecked=434, Total=1332 [2023-11-23 08:52:55,980 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 08:53:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:05,803 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2023-11-23 08:53:05,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:53:05,804 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 70 [2023-11-23 08:53:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:05,804 INFO L225 Difference]: With dead ends: 79 [2023-11-23 08:53:05,804 INFO L226 Difference]: Without dead ends: 68 [2023-11-23 08:53:05,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 124 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 126.6s TimeCoverageRelationStatistics Valid=121, Invalid=915, Unknown=48, NotChecked=476, Total=1560 [2023-11-23 08:53:05,805 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:05,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 120 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:53:05,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-23 08:53:05,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-23 08:53:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.069767441860465) internal successors, (46), 46 states have internal predecessors, (46), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2023-11-23 08:53:05,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2023-11-23 08:53:05,812 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 70 [2023-11-23 08:53:05,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:05,812 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2023-11-23 08:53:05,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 08:53:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2023-11-23 08:53:05,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 08:53:05,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:05,813 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 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] [2023-11-23 08:53:05,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-23 08:53:06,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:06,024 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:06,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:06,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1739479908, now seen corresponding path program 1 times [2023-11-23 08:53:06,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:06,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594358145] [2023-11-23 08:53:06,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:06,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:53:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:53:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:53:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:53:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:53:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:53:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:53:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:53:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-23 08:53:06,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:06,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594358145] [2023-11-23 08:53:06,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594358145] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:06,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220527830] [2023-11-23 08:53:06,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:06,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:06,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:06,412 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:53:06,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 08:53:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-23 08:53:06,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:06,552 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 08:53:06,558 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 08:53:06,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2023-11-23 08:53:06,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 12 [2023-11-23 08:53:12,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-23 08:53:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-23 08:53:12,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:53:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 08:53:14,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220527830] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:14,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:53:14,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 9] total 19 [2023-11-23 08:53:14,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659332242] [2023-11-23 08:53:14,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:14,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:53:14,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:14,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:53:14,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=292, Unknown=2, NotChecked=0, Total=342 [2023-11-23 08:53:14,889 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 08:53:15,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:15,447 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2023-11-23 08:53:15,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:53:15,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 70 [2023-11-23 08:53:15,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:15,452 INFO L225 Difference]: With dead ends: 81 [2023-11-23 08:53:15,452 INFO L226 Difference]: Without dead ends: 59 [2023-11-23 08:53:15,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=54, Invalid=324, Unknown=2, NotChecked=0, Total=380 [2023-11-23 08:53:15,453 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:15,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 220 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:53:15,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-23 08:53:15,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-23 08:53:15,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.0) internal successors, (38), 38 states have internal predecessors, (38), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 08:53:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2023-11-23 08:53:15,458 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 70 [2023-11-23 08:53:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:15,459 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2023-11-23 08:53:15,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 08:53:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2023-11-23 08:53:15,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-23 08:53:15,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:15,474 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 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] [2023-11-23 08:53:15,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:15,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 08:53:15,687 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:15,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:15,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1288524813, now seen corresponding path program 1 times [2023-11-23 08:53:15,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:15,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557708972] [2023-11-23 08:53:15,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:15,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:53:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:53:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:53:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:53:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:53:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:53:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:53:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:53:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 08:53:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-23 08:53:16,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:16,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557708972] [2023-11-23 08:53:16,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557708972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:16,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:16,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 08:53:16,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529540204] [2023-11-23 08:53:16,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:16,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:53:16,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:16,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:53:16,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:53:16,092 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 10 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2023-11-23 08:53:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:16,211 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2023-11-23 08:53:16,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:53:16,211 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 76 [2023-11-23 08:53:16,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:16,213 INFO L225 Difference]: With dead ends: 59 [2023-11-23 08:53:16,213 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 08:53:16,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:53:16,217 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:16,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 228 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:53:16,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 08:53:16,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 08:53:16,218 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 08:53:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 08:53:16,218 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2023-11-23 08:53:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:16,219 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 08:53:16,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2023-11-23 08:53:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 08:53:16,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 08:53:16,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 08:53:16,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 08:53:16,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 08:53:16,875 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4717 4721) no Hoare annotation was computed. [2023-11-23 08:53:16,875 INFO L899 garLoopResultBuilder]: For program point L4720-2(line 4720) no Hoare annotation was computed. [2023-11-23 08:53:16,876 INFO L899 garLoopResultBuilder]: For program point L4720(line 4720) no Hoare annotation was computed. [2023-11-23 08:53:16,876 INFO L899 garLoopResultBuilder]: For program point L4720-5(line 4720) no Hoare annotation was computed. [2023-11-23 08:53:16,876 INFO L899 garLoopResultBuilder]: For program point L4720-3(line 4720) no Hoare annotation was computed. [2023-11-23 08:53:16,876 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4717 4721) the Hoare annotation is: true [2023-11-23 08:53:16,876 INFO L899 garLoopResultBuilder]: For program point L4731(line 4731) no Hoare annotation was computed. [2023-11-23 08:53:16,876 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4728 4732) no Hoare annotation was computed. [2023-11-23 08:53:16,876 INFO L899 garLoopResultBuilder]: For program point L4731-5(line 4731) no Hoare annotation was computed. [2023-11-23 08:53:16,876 INFO L899 garLoopResultBuilder]: For program point L4731-2(line 4731) no Hoare annotation was computed. [2023-11-23 08:53:16,876 INFO L899 garLoopResultBuilder]: For program point L4731-3(line 4731) no Hoare annotation was computed. [2023-11-23 08:53:16,876 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4728 4732) the Hoare annotation is: true [2023-11-23 08:53:16,876 INFO L899 garLoopResultBuilder]: For program point L7391-1(line 7391) no Hoare annotation was computed. [2023-11-23 08:53:16,876 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 08:53:16,876 INFO L895 garLoopResultBuilder]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (and (<= 2 |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (<= 2 .cse0) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$.base| .cse0) 8)) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| .cse1) .cse2) 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse0)) (= (select (select |#memory_$Pointer$.offset| .cse0) 8) 0) (<= 1 .cse1))) [2023-11-23 08:53:16,876 INFO L899 garLoopResultBuilder]: For program point L7389-2(line 7389) no Hoare annotation was computed. [2023-11-23 08:53:16,876 INFO L895 garLoopResultBuilder]: At program point L7389-1(line 7389) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (and (<= 2 |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (<= 2 .cse0) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$.base| .cse0) 8)) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| .cse1) .cse2) 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_#t~ret680#1| 1) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse0)) (= (select (select |#memory_$Pointer$.offset| .cse0) 8) 0) (<= 1 .cse1))) [2023-11-23 08:53:16,877 INFO L895 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (and (<= 2 |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (<= 2 .cse0) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$.base| .cse0) 8)) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| .cse1) .cse2) 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse0)) (= (select (select |#memory_$Pointer$.offset| .cse0) 8) 0) (<= 1 .cse1))) [2023-11-23 08:53:16,877 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 08:53:16,877 INFO L895 garLoopResultBuilder]: At program point L4840-1(line 4840) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= 2 .cse0) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_#t~ret339#1| 1) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse1)) (= (select (select |#memory_$Pointer$.offset| .cse1) 8) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2023-11-23 08:53:16,880 INFO L899 garLoopResultBuilder]: For program point L4840-2(line 4840) no Hoare annotation was computed. [2023-11-23 08:53:16,880 INFO L895 garLoopResultBuilder]: At program point L4840(line 4840) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= 2 .cse0) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse1)) (= (select (select |#memory_$Pointer$.offset| .cse1) 8) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2023-11-23 08:53:16,880 INFO L895 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (and (<= 2 |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (<= 2 .cse0) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$.base| .cse0) 8)) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| .cse1) .cse2) 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse0)) (= (select (select |#memory_$Pointer$.offset| .cse0) 8) 0) (<= 1 .cse1))) [2023-11-23 08:53:16,880 INFO L899 garLoopResultBuilder]: For program point L7390-2(line 7390) no Hoare annotation was computed. [2023-11-23 08:53:16,880 INFO L895 garLoopResultBuilder]: At program point L7390-1(line 7390) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (and (<= 2 |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (<= 2 .cse0) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$.base| .cse0) 8)) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| .cse1) .cse2) 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_#t~ret681#1| 1) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse0)) (= (select (select |#memory_$Pointer$.offset| .cse0) 8) 0) (<= 1 .cse1))) [2023-11-23 08:53:16,880 INFO L895 garLoopResultBuilder]: At program point L4839(line 4839) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= 2 .cse0) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse1)) (= (select (select |#memory_$Pointer$.offset| .cse1) 8) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2023-11-23 08:53:16,880 INFO L895 garLoopResultBuilder]: At program point L4839-1(line 4839) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= 2 .cse0) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_#t~ret338#1| 1) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse1)) (= (select (select |#memory_$Pointer$.offset| .cse1) 8) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2023-11-23 08:53:16,880 INFO L895 garLoopResultBuilder]: At program point L4841(line 4841) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= 2 .cse0) (= |ULTIMATE.start_aws_linked_list_next_#t~mem340#1.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_#t~mem340#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse1)) (= (select (select |#memory_$Pointer$.offset| .cse1) 8) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2023-11-23 08:53:16,880 INFO L899 garLoopResultBuilder]: For program point L4841-1(line 4841) no Hoare annotation was computed. [2023-11-23 08:53:16,880 INFO L899 garLoopResultBuilder]: For program point L4837-2(line 4837) no Hoare annotation was computed. [2023-11-23 08:53:16,881 INFO L895 garLoopResultBuilder]: At program point L4837(line 4837) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= 2 .cse0) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse0) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse1)) (= (select (select |#memory_$Pointer$.offset| .cse1) 8) 0))) [2023-11-23 08:53:16,881 INFO L899 garLoopResultBuilder]: For program point L4839-2(line 4839) no Hoare annotation was computed. [2023-11-23 08:53:16,881 INFO L895 garLoopResultBuilder]: At program point L4837-1(line 4837) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= 2 .cse0) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse0) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse1)) (= (select (select |#memory_$Pointer$.offset| .cse1) 8) 0))) [2023-11-23 08:53:16,881 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-23 08:53:16,881 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-23 08:53:16,881 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-23 08:53:16,881 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-23 08:53:16,881 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-23 08:53:16,881 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-23 08:53:16,881 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-23 08:53:16,881 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-23 08:53:16,881 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-23 08:53:16,881 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-23 08:53:16,883 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:16,885 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 08:53:16,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:53:16 BoogieIcfgContainer [2023-11-23 08:53:16,887 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 08:53:16,887 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 08:53:16,887 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 08:53:16,887 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 08:53:16,888 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:49:43" (3/4) ... [2023-11-23 08:53:16,889 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 08:53:16,891 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2023-11-23 08:53:16,891 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:53:16,892 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-23 08:53:16,892 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-23 08:53:16,894 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2023-11-23 08:53:16,894 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-23 08:53:16,894 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 08:53:16,894 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 08:53:16,952 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 08:53:16,952 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 08:53:16,952 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 08:53:16,953 INFO L158 Benchmark]: Toolchain (without parser) took 216428.57ms. Allocated memory was 176.2MB in the beginning and 358.6MB in the end (delta: 182.5MB). Free memory was 135.3MB in the beginning and 161.6MB in the end (delta: -26.3MB). Peak memory consumption was 156.1MB. Max. memory is 16.1GB. [2023-11-23 08:53:16,953 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 121.6MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 08:53:16,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1620.39ms. Allocated memory is still 176.2MB. Free memory was 135.3MB in the beginning and 87.9MB in the end (delta: 47.3MB). Peak memory consumption was 107.3MB. Max. memory is 16.1GB. [2023-11-23 08:53:16,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 178.82ms. Allocated memory is still 176.2MB. Free memory was 87.9MB in the beginning and 82.5MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 08:53:16,953 INFO L158 Benchmark]: Boogie Preprocessor took 56.25ms. Allocated memory is still 176.2MB. Free memory was 82.5MB in the beginning and 79.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 08:53:16,954 INFO L158 Benchmark]: RCFGBuilder took 832.54ms. Allocated memory is still 176.2MB. Free memory was 79.6MB in the beginning and 127.6MB in the end (delta: -48.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2023-11-23 08:53:16,954 INFO L158 Benchmark]: TraceAbstraction took 213671.24ms. Allocated memory was 176.2MB in the beginning and 358.6MB in the end (delta: 182.5MB). Free memory was 126.6MB in the beginning and 166.9MB in the end (delta: -40.3MB). Peak memory consumption was 143.2MB. Max. memory is 16.1GB. [2023-11-23 08:53:16,954 INFO L158 Benchmark]: Witness Printer took 65.04ms. Allocated memory is still 358.6MB. Free memory was 166.9MB in the beginning and 161.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 08:53:16,955 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 121.6MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1620.39ms. Allocated memory is still 176.2MB. Free memory was 135.3MB in the beginning and 87.9MB in the end (delta: 47.3MB). Peak memory consumption was 107.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 178.82ms. Allocated memory is still 176.2MB. Free memory was 87.9MB in the beginning and 82.5MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.25ms. Allocated memory is still 176.2MB. Free memory was 82.5MB in the beginning and 79.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 832.54ms. Allocated memory is still 176.2MB. Free memory was 79.6MB in the beginning and 127.6MB in the end (delta: -48.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * TraceAbstraction took 213671.24ms. Allocated memory was 176.2MB in the beginning and 358.6MB in the end (delta: 182.5MB). Free memory was 126.6MB in the beginning and 166.9MB in the end (delta: -40.3MB). Peak memory consumption was 143.2MB. Max. memory is 16.1GB. * Witness Printer took 65.04ms. Allocated memory is still 358.6MB. Free memory was 166.9MB in the beginning and 161.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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 5 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 213.6s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187 mSDsluCounter, 2784 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2162 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1807 IncrementalHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 622 mSDtfsCounter, 1807 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 935 GetRequests, 676 SyntacticMatches, 32 SemanticMatches, 227 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 197.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=9, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 14 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 87 PreInvPairs, 98 NumberOfFragments, 1046 HoareAnnotationTreeSize, 87 FomulaSimplifications, 286 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 1034 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 190.0s InterpolantComputationTime, 1095 NumberOfCodeBlocks, 1095 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1284 ConstructedInterpolants, 166 QuantifiedInterpolants, 10967 SizeOfPredicates, 107 NumberOfNonLiveVariables, 2068 ConjunctsInSsa, 248 ConjunctsInUnsatCore, 27 InterpolantComputations, 15 PerfectInterpolantSequences, 622/752 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 RESULT: Ultimate proved your program to be correct! [2023-11-23 08:53:17,067 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