/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'cvc4 --incremental --print-success --lang smt' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_end_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-04 20:46:17,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-04 20:46:17,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-04 20:46:17,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-04 20:46:17,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-04 20:46:17,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-04 20:46:17,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-04 20:46:17,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-04 20:46:17,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-04 20:46:17,379 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-04 20:46:17,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-04 20:46:17,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-04 20:46:17,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-04 20:46:17,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-04 20:46:17,381 INFO L153 SettingsManager]: * Use SBE=true [2024-11-04 20:46:17,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-04 20:46:17,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-04 20:46:17,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-04 20:46:17,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-04 20:46:17,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-04 20:46:17,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-04 20:46:17,388 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-04 20:46:17,388 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-04 20:46:17,388 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-04 20:46:17,388 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-04 20:46:17,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-04 20:46:17,389 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-04 20:46:17,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-04 20:46:17,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-04 20:46:17,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-04 20:46:17,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-04 20:46:17,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 20:46:17,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-04 20:46:17,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-04 20:46:17,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-04 20:46:17,391 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-04 20:46:17,391 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:17,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-04 20:46:17,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-04 20:46:17,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-04 20:46:17,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-04 20:46:17,394 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:17,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-04 20:46:17,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-04 20:46:17,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-04 20:46:17,650 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-04 20:46:17,650 INFO L274 PluginConnector]: CDTParser initialized [2024-11-04 20:46:17,651 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_end_harness.i [2024-11-04 20:46:19,149 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-04 20:46:19,550 INFO L384 CDTParser]: Found 1 translation units. [2024-11-04 20:46:19,551 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_end_harness.i [2024-11-04 20:46:19,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f48466fe6/e1a81367658b49a78a98d56635049e87/FLAG9d624fa2b [2024-11-04 20:46:19,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f48466fe6/e1a81367658b49a78a98d56635049e87 [2024-11-04 20:46:19,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-04 20:46:19,739 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-04 20:46:19,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-04 20:46:19,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-04 20:46:19,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-04 20:46:19,749 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 08:46:19" (1/1) ... [2024-11-04 20:46:19,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e7f47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:19, skipping insertion in model container [2024-11-04 20:46:19,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 08:46:19" (1/1) ... [2024-11-04 20:46:19,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-04 20:46:20,132 WARN L250 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_end_harness.i[4493,4506] [2024-11-04 20:46:20,141 WARN L250 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_end_harness.i[4553,4566] [2024-11-04 20:46:20,620 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:20,717 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:20,718 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:20,718 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:20,727 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:20,729 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,730 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,730 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,731 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:20,731 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,732 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,735 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:20,735 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:20,737 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:20,738 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:20,754 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,754 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:20,755 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,755 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:20,757 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,757 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:20,758 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,758 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:20,760 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,761 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:20,761 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,762 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:20,762 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,762 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,040 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,041 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,041 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,042 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,229 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:46:21,276 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-04 20:46:21,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-04 20:46:21,322 WARN L250 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_end_harness.i[4493,4506] [2024-11-04 20:46:21,323 WARN L250 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_end_harness.i[4553,4566] [2024-11-04 20:46:21,355 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,377 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,378 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,378 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,385 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,391 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,391 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,392 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,392 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,392 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,393 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,399 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,399 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,404 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,405 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,409 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,409 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,409 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,410 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,411 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,411 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,411 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,412 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,412 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,413 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,413 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,413 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,414 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,414 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,460 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,460 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,461 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,461 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,501 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:21,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:46:21,520 INFO L200 MainTranslator]: Completed pre-run [2024-11-04 20:46:21,539 WARN L250 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_end_harness.i[4493,4506] [2024-11-04 20:46:21,540 WARN L250 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_end_harness.i[4553,4566] [2024-11-04 20:46:21,596 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,597 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,597 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,597 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,598 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,604 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,604 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,606 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,607 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,608 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,608 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,609 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,609 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:46:21,839 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-04 20:46:21,848 INFO L204 MainTranslator]: Completed translation [2024-11-04 20:46:21,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21 WrapperNode [2024-11-04 20:46:21,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-04 20:46:21,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-04 20:46:21,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-04 20:46:21,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-04 20:46:21,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:21,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:21,984 INFO L138 Inliner]: procedures = 687, calls = 1038, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 138 [2024-11-04 20:46:21,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-04 20:46:21,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-04 20:46:21,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-04 20:46:21,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-04 20:46:21,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,026 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 5, 14]. 67 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2024-11-04 20:46:22,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-04 20:46:22,089 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-04 20:46:22,089 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-04 20:46:22,089 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-04 20:46:22,090 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 20:46:22,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 20:46:22,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-04 20:46:22,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-04 20:46:22,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-04 20:46:22,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-04 20:46:22,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-04 20:46:22,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-04 20:46:22,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-04 20:46:22,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-04 20:46:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-04 20:46:22,151 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-04 20:46:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-04 20:46:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-04 20:46:22,152 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-04 20:46:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-04 20:46:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-04 20:46:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-04 20:46:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-04 20:46:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-04 20:46:22,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-04 20:46:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-04 20:46:22,153 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-04 20:46:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-04 20:46:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-04 20:46:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-04 20:46:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-04 20:46:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-04 20:46:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-04 20:46:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-04 20:46:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-04 20:46:22,154 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-04 20:46:22,405 INFO L238 CfgBuilder]: Building ICFG [2024-11-04 20:46:22,407 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-04 20:46:22,741 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-04 20:46:22,741 INFO L287 CfgBuilder]: Performing block encoding [2024-11-04 20:46:22,757 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-04 20:46:22,757 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-04 20:46:22,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 08:46:22 BoogieIcfgContainer [2024-11-04 20:46:22,758 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-04 20:46:22,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-04 20:46:22,761 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-04 20:46:22,764 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-04 20:46:22,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 08:46:19" (1/3) ... [2024-11-04 20:46:22,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b4c99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 08:46:22, skipping insertion in model container [2024-11-04 20:46:22,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (2/3) ... [2024-11-04 20:46:22,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b4c99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 08:46:22, skipping insertion in model container [2024-11-04 20:46:22,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 08:46:22" (3/3) ... [2024-11-04 20:46:22,767 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_end_harness.i [2024-11-04 20:46:22,783 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-04 20:46:22,783 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-04 20:46:22,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-04 20:46:22,862 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@144cdba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-04 20:46:22,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-04 20:46:22,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-04 20:46:22,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-04 20:46:22,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:22,874 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-11-04 20:46:22,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:22,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash -2107862704, now seen corresponding path program 1 times [2024-11-04 20:46:22,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:22,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [545582815] [2024-11-04 20:46:22,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:22,887 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:22,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:22,891 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:22,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Waiting until timeout for monitored process [2024-11-04 20:46:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:23,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-04 20:46:23,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-04 20:46:23,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-04 20:46:23,284 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:23,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [545582815] [2024-11-04 20:46:23,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [545582815] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-04 20:46:23,285 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-04 20:46:23,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-04 20:46:23,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818840804] [2024-11-04 20:46:23,290 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:23,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-04 20:46:23,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:23,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-04 20:46:23,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-04 20:46:23,313 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 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) [2024-11-04 20:46:23,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:23,335 INFO L93 Difference]: Finished difference Result 128 states and 184 transitions. [2024-11-04 20:46:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-04 20:46:23,337 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 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 68 [2024-11-04 20:46:23,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:23,344 INFO L225 Difference]: With dead ends: 128 [2024-11-04 20:46:23,344 INFO L226 Difference]: Without dead ends: 63 [2024-11-04 20:46:23,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-04 20:46:23,350 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:23,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:23,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-04 20:46:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-04 20:46:23,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-04 20:46:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2024-11-04 20:46:23,414 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 68 [2024-11-04 20:46:23,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:23,415 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2024-11-04 20:46:23,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 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) [2024-11-04 20:46:23,418 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2024-11-04 20:46:23,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-04 20:46:23,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:23,422 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-11-04 20:46:23,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Forceful destruction successful, exit code 0 [2024-11-04 20:46:23,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:23,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:23,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:23,624 INFO L85 PathProgramCache]: Analyzing trace with hash 900796622, now seen corresponding path program 1 times [2024-11-04 20:46:23,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:23,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [804611789] [2024-11-04 20:46:23,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:23,624 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:23,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:23,626 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:23,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-04 20:46:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:24,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-04 20:46:24,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-04 20:46:24,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-04 20:46:24,157 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:24,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [804611789] [2024-11-04 20:46:24,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [804611789] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:24,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:24,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-04 20:46:24,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778736441] [2024-11-04 20:46:24,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:24,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:46:24,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:24,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:46:24,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:46:24,162 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-04 20:46:24,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:24,231 INFO L93 Difference]: Finished difference Result 114 states and 152 transitions. [2024-11-04 20:46:24,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:46:24,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2024-11-04 20:46:24,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:24,235 INFO L225 Difference]: With dead ends: 114 [2024-11-04 20:46:24,235 INFO L226 Difference]: Without dead ends: 65 [2024-11-04 20:46:24,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:46:24,236 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:24,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 377 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:24,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-04 20:46:24,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-04 20:46:24,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.288888888888889) internal successors, (58), 47 states have internal predecessors, (58), 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) [2024-11-04 20:46:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2024-11-04 20:46:24,250 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 68 [2024-11-04 20:46:24,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:24,250 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2024-11-04 20:46:24,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-04 20:46:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2024-11-04 20:46:24,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-04 20:46:24,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:24,256 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-11-04 20:46:24,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-11-04 20:46:24,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:24,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:24,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:24,458 INFO L85 PathProgramCache]: Analyzing trace with hash 577933322, now seen corresponding path program 1 times [2024-11-04 20:46:24,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:24,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1872037804] [2024-11-04 20:46:24,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:24,458 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:24,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:24,460 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:24,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-04 20:46:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:24,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-04 20:46:24,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-04 20:46:24,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-04 20:46:24,929 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:24,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1872037804] [2024-11-04 20:46:24,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1872037804] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:24,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:24,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-11-04 20:46:24,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373871406] [2024-11-04 20:46:24,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:24,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:46:24,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:24,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:46:24,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:24,932 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-04 20:46:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:25,077 INFO L93 Difference]: Finished difference Result 121 states and 163 transitions. [2024-11-04 20:46:25,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:46:25,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2024-11-04 20:46:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:25,079 INFO L225 Difference]: With dead ends: 121 [2024-11-04 20:46:25,079 INFO L226 Difference]: Without dead ends: 70 [2024-11-04 20:46:25,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:25,080 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 20 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:25,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 300 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:46:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-04 20:46:25,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-11-04 20:46:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 50 states have internal predecessors, (60), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-04 20:46:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2024-11-04 20:46:25,100 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 70 [2024-11-04 20:46:25,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:25,100 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2024-11-04 20:46:25,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-04 20:46:25,100 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2024-11-04 20:46:25,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-04 20:46:25,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:25,104 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1] [2024-11-04 20:46:25,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-04 20:46:25,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:25,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:25,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash -34807881, now seen corresponding path program 1 times [2024-11-04 20:46:25,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:25,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1366294998] [2024-11-04 20:46:25,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:25,307 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:25,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:25,309 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:25,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-04 20:46:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:25,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-04 20:46:25,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-04 20:46:25,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-04 20:46:25,779 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:25,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1366294998] [2024-11-04 20:46:25,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1366294998] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:25,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:25,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2024-11-04 20:46:25,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022809550] [2024-11-04 20:46:25,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:25,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:46:25,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:25,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:46:25,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-04 20:46:25,781 INFO L87 Difference]: Start difference. First operand 68 states and 90 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-04 20:46:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:25,972 INFO L93 Difference]: Finished difference Result 133 states and 181 transitions. [2024-11-04 20:46:25,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-04 20:46:25,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2024-11-04 20:46:25,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:25,974 INFO L225 Difference]: With dead ends: 133 [2024-11-04 20:46:25,974 INFO L226 Difference]: Without dead ends: 79 [2024-11-04 20:46:25,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-04 20:46:25,976 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 29 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:25,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 354 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-04 20:46:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-04 20:46:25,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2024-11-04 20:46:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 52 states have internal predecessors, (63), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-04 20:46:25,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2024-11-04 20:46:25,988 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 72 [2024-11-04 20:46:25,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:25,988 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2024-11-04 20:46:25,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-04 20:46:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2024-11-04 20:46:25,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-04 20:46:25,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:25,992 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1] [2024-11-04 20:46:25,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-04 20:46:26,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:26,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:26,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:26,194 INFO L85 PathProgramCache]: Analyzing trace with hash 387052583, now seen corresponding path program 1 times [2024-11-04 20:46:26,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:26,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [598142406] [2024-11-04 20:46:26,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:26,194 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:26,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:26,197 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:26,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-04 20:46:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:26,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-04 20:46:26,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-04 20:46:26,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-04 20:46:26,551 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:26,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [598142406] [2024-11-04 20:46:26,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [598142406] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:26,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:26,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 7 [2024-11-04 20:46:26,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670452903] [2024-11-04 20:46:26,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:26,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:46:26,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:26,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:46:26,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:46:26,553 INFO L87 Difference]: Start difference. First operand 70 states and 93 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-04 20:46:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:26,672 INFO L93 Difference]: Finished difference Result 133 states and 183 transitions. [2024-11-04 20:46:26,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:46:26,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2024-11-04 20:46:26,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:26,675 INFO L225 Difference]: With dead ends: 133 [2024-11-04 20:46:26,675 INFO L226 Difference]: Without dead ends: 77 [2024-11-04 20:46:26,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:46:26,677 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 25 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:26,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 230 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:46:26,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-04 20:46:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2024-11-04 20:46:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-04 20:46:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-04 20:46:26,697 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 73 [2024-11-04 20:46:26,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:26,698 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-04 20:46:26,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-04 20:46:26,698 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-04 20:46:26,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-04 20:46:26,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:26,699 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:26,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-04 20:46:26,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:26,904 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:26,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:26,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1595103561, now seen corresponding path program 1 times [2024-11-04 20:46:26,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:26,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [678140197] [2024-11-04 20:46:26,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:26,905 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:26,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:26,908 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:26,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-04 20:46:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:27,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-04 20:46:27,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-04 20:46:27,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-04 20:46:27,416 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:27,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [678140197] [2024-11-04 20:46:27,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [678140197] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:27,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:27,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-04 20:46:27,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472196261] [2024-11-04 20:46:27,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:27,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:46:27,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:27,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:46:27,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:27,418 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:46:27,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:27,470 INFO L93 Difference]: Finished difference Result 134 states and 181 transitions. [2024-11-04 20:46:27,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-04 20:46:27,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2024-11-04 20:46:27,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:27,472 INFO L225 Difference]: With dead ends: 134 [2024-11-04 20:46:27,472 INFO L226 Difference]: Without dead ends: 77 [2024-11-04 20:46:27,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:27,474 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:27,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:27,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-04 20:46:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2024-11-04 20:46:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-04 20:46:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2024-11-04 20:46:27,488 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 81 [2024-11-04 20:46:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:27,489 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2024-11-04 20:46:27,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:46:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2024-11-04 20:46:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-04 20:46:27,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:27,490 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:27,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-04 20:46:27,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:27,691 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:27,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:27,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1786751690, now seen corresponding path program 1 times [2024-11-04 20:46:27,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:27,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [958109983] [2024-11-04 20:46:27,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:27,692 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:27,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:27,694 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:27,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-04 20:46:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:28,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-04 20:46:28,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-04 20:46:28,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-04 20:46:28,185 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:28,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [958109983] [2024-11-04 20:46:28,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [958109983] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:28,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:28,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-04 20:46:28,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457682579] [2024-11-04 20:46:28,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:28,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:46:28,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:28,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:46:28,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:46:28,187 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:46:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:28,228 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2024-11-04 20:46:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:46:28,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2024-11-04 20:46:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:28,230 INFO L225 Difference]: With dead ends: 125 [2024-11-04 20:46:28,230 INFO L226 Difference]: Without dead ends: 74 [2024-11-04 20:46:28,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:46:28,231 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 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 [2024-11-04 20:46:28,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-04 20:46:28,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-04 20:46:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 56 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (19), 12 states have call predecessors, (19), 12 states have call successors, (19) [2024-11-04 20:46:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2024-11-04 20:46:28,247 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 83 [2024-11-04 20:46:28,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:28,247 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2024-11-04 20:46:28,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:46:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2024-11-04 20:46:28,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-04 20:46:28,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:28,248 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:28,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-04 20:46:28,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:28,449 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:28,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:28,450 INFO L85 PathProgramCache]: Analyzing trace with hash -11292686, now seen corresponding path program 1 times [2024-11-04 20:46:28,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:28,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1512693847] [2024-11-04 20:46:28,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:28,450 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:28,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:28,451 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:28,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-04 20:46:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:28,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-04 20:46:28,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-04 20:46:28,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-04 20:46:28,898 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:28,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1512693847] [2024-11-04 20:46:28,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1512693847] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:28,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:28,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2024-11-04 20:46:28,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821891928] [2024-11-04 20:46:28,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:28,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:46:28,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:28,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:46:28,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-04 20:46:28,901 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-04 20:46:29,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:29,037 INFO L93 Difference]: Finished difference Result 136 states and 178 transitions. [2024-11-04 20:46:29,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-04 20:46:29,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 85 [2024-11-04 20:46:29,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:29,039 INFO L225 Difference]: With dead ends: 136 [2024-11-04 20:46:29,039 INFO L226 Difference]: Without dead ends: 76 [2024-11-04 20:46:29,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-04 20:46:29,040 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 23 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:29,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 364 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:46:29,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-04 20:46:29,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-04 20:46:29,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 52 states have (on average 1.25) internal successors, (65), 56 states have internal predecessors, (65), 13 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (19), 12 states have call predecessors, (19), 12 states have call successors, (19) [2024-11-04 20:46:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2024-11-04 20:46:29,057 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 85 [2024-11-04 20:46:29,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:29,057 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2024-11-04 20:46:29,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-04 20:46:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2024-11-04 20:46:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-04 20:46:29,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:29,059 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:29,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-04 20:46:29,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:29,263 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:29,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:29,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1015915871, now seen corresponding path program 2 times [2024-11-04 20:46:29,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:29,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [677680937] [2024-11-04 20:46:29,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:29,264 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:29,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:29,265 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:29,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-04 20:46:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:29,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-04 20:46:29,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:29,574 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-04 20:46:29,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:29,734 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-04 20:46:29,734 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:29,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [677680937] [2024-11-04 20:46:29,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [677680937] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:29,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:29,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2024-11-04 20:46:29,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875111115] [2024-11-04 20:46:29,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:29,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-04 20:46:29,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:29,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-04 20:46:29,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-04 20:46:29,736 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-04 20:46:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:29,938 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2024-11-04 20:46:29,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-04 20:46:29,939 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 87 [2024-11-04 20:46:29,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:29,941 INFO L225 Difference]: With dead ends: 136 [2024-11-04 20:46:29,941 INFO L226 Difference]: Without dead ends: 75 [2024-11-04 20:46:29,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-04 20:46:29,942 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 32 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:29,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 410 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-04 20:46:29,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-04 20:46:29,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2024-11-04 20:46:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-04 20:46:29,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2024-11-04 20:46:29,956 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 87 [2024-11-04 20:46:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:29,956 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2024-11-04 20:46:29,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-04 20:46:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2024-11-04 20:46:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-04 20:46:29,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:29,958 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:29,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2024-11-04 20:46:30,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:30,159 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:30,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:30,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1005701739, now seen corresponding path program 1 times [2024-11-04 20:46:30,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:30,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1824067532] [2024-11-04 20:46:30,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:30,160 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:30,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:30,161 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:30,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-04 20:46:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:30,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-04 20:46:30,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-04 20:46:30,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:30,814 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-04 20:46:30,815 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:30,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1824067532] [2024-11-04 20:46:30,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1824067532] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:30,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:30,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-04 20:46:30,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578700141] [2024-11-04 20:46:30,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:30,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:46:30,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:30,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:46:30,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:30,817 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:46:30,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:30,883 INFO L93 Difference]: Finished difference Result 119 states and 156 transitions. [2024-11-04 20:46:30,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-04 20:46:30,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 96 [2024-11-04 20:46:30,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:30,884 INFO L225 Difference]: With dead ends: 119 [2024-11-04 20:46:30,884 INFO L226 Difference]: Without dead ends: 70 [2024-11-04 20:46:30,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:30,886 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 440 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.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:30,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 440 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:46:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-04 20:46:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-11-04 20:46:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-04 20:46:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2024-11-04 20:46:30,895 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 96 [2024-11-04 20:46:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:30,896 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2024-11-04 20:46:30,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:46:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2024-11-04 20:46:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-04 20:46:30,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:30,897 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:30,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-11-04 20:46:31,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:31,098 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:31,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:31,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1128444350, now seen corresponding path program 3 times [2024-11-04 20:46:31,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:31,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [637699546] [2024-11-04 20:46:31,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:31,099 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:31,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:31,100 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:31,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-04 20:46:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:31,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-04 20:46:31,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:31,681 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 26 treesize of output 1 [2024-11-04 20:46:31,691 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 20 treesize of output 9 [2024-11-04 20:46:31,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-04 20:46:31,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-04 20:46:31,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2024-11-04 20:46:31,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2024-11-04 20:46:31,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-04 20:46:31,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-04 20:46:31,975 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31|)) (.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse1 (select .cse0 .cse2))) (and (= .cse0 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 .cse1)) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31|))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 (select .cse3 .cse2)))) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| .cse1))))))) is different from true [2024-11-04 20:46:33,445 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) (_ bv0 64)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31|)) (.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse1 (select .cse0 .cse2))) (and (= .cse0 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 .cse1)) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31|))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 (select .cse3 .cse2)))) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| .cse1)))))))) is different from true [2024-11-04 20:46:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 41 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-04 20:46:34,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-04 20:46:35,006 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:35,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [637699546] [2024-11-04 20:46:35,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [637699546] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 20:46:35,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 20:46:35,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2024-11-04 20:46:35,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588374443] [2024-11-04 20:46:35,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 20:46:35,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-04 20:46:35,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:35,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-04 20:46:35,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=8, NotChecked=62, Total=342 [2024-11-04 20:46:35,009 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 18 states have internal predecessors, (107), 6 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-04 20:46:35,891 WARN L873 $PredicateComparison]: unable to prove that (and (or (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |c_aws_linked_list_is_valid_~list#1.base|) |c_aws_linked_list_is_valid_~list#1.offset|))) (not |c_aws_linked_list_is_valid_#t~short295#1|) (not (= (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_~list#1.base|) |c_aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) (= |c_aws_linked_list_is_valid_#in~list#1.offset| |c_aws_linked_list_is_valid_~list#1.offset|) (= |c_aws_linked_list_is_valid_#in~list#1.base| |c_aws_linked_list_is_valid_~list#1.base|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)))) (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31|)) (.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse1 (select .cse0 .cse2))) (and (= .cse0 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 .cse1)) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31|))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 (select .cse3 .cse2)))) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_31| .cse1)))))))) is different from true [2024-11-04 20:46:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:39,585 INFO L93 Difference]: Finished difference Result 180 states and 244 transitions. [2024-11-04 20:46:39,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-04 20:46:39,586 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 18 states have internal predecessors, (107), 6 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 98 [2024-11-04 20:46:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:39,587 INFO L225 Difference]: With dead ends: 180 [2024-11-04 20:46:39,587 INFO L226 Difference]: Without dead ends: 120 [2024-11-04 20:46:39,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=69, Invalid=313, Unknown=10, NotChecked=114, Total=506 [2024-11-04 20:46:39,588 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 69 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 10 mSolverCounterUnsat, 81 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 81 IncrementalHoareTripleChecker+Unknown, 485 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:39,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 621 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 541 Invalid, 81 Unknown, 485 Unchecked, 4.3s Time] [2024-11-04 20:46:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-04 20:46:39,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 109. [2024-11-04 20:46:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 86 states have internal predecessors, (110), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-04 20:46:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 144 transitions. [2024-11-04 20:46:39,601 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 144 transitions. Word has length 98 [2024-11-04 20:46:39,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:39,601 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 144 transitions. [2024-11-04 20:46:39,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 18 states have internal predecessors, (107), 6 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-04 20:46:39,601 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 144 transitions. [2024-11-04 20:46:39,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-04 20:46:39,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:39,602 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:39,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2024-11-04 20:46:39,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:39,803 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:39,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:39,804 INFO L85 PathProgramCache]: Analyzing trace with hash 604075650, now seen corresponding path program 1 times [2024-11-04 20:46:39,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:39,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [841107546] [2024-11-04 20:46:39,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:39,804 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:39,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:39,805 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:39,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-04 20:46:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:40,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-04 20:46:40,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-04 20:46:40,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:40,082 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-04 20:46:40,083 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:40,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [841107546] [2024-11-04 20:46:40,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [841107546] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:40,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:40,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-04 20:46:40,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305295632] [2024-11-04 20:46:40,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:40,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-04 20:46:40,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:40,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-04 20:46:40,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-04 20:46:40,085 INFO L87 Difference]: Start difference. First operand 109 states and 144 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 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) [2024-11-04 20:46:40,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:40,118 INFO L93 Difference]: Finished difference Result 179 states and 242 transitions. [2024-11-04 20:46:40,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-04 20:46:40,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 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 98 [2024-11-04 20:46:40,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:40,119 INFO L225 Difference]: With dead ends: 179 [2024-11-04 20:46:40,120 INFO L226 Difference]: Without dead ends: 111 [2024-11-04 20:46:40,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-04 20:46:40,121 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:40,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:40,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-04 20:46:40,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-11-04 20:46:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 86 states have internal predecessors, (108), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-04 20:46:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 142 transitions. [2024-11-04 20:46:40,137 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 142 transitions. Word has length 98 [2024-11-04 20:46:40,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:40,138 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 142 transitions. [2024-11-04 20:46:40,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 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) [2024-11-04 20:46:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 142 transitions. [2024-11-04 20:46:40,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-04 20:46:40,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:40,140 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:40,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-11-04 20:46:40,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:40,340 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:40,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:40,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1924312770, now seen corresponding path program 1 times [2024-11-04 20:46:40,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:40,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1514090808] [2024-11-04 20:46:40,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:40,341 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:40,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:40,342 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:40,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-04 20:46:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:40,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-04 20:46:40,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-04 20:46:40,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-04 20:46:40,615 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:40,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1514090808] [2024-11-04 20:46:40,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1514090808] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:40,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:40,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-04 20:46:40,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899702936] [2024-11-04 20:46:40,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:40,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-04 20:46:40,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:40,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-04 20:46:40,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-04 20:46:40,617 INFO L87 Difference]: Start difference. First operand 109 states and 142 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 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) [2024-11-04 20:46:40,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:40,656 INFO L93 Difference]: Finished difference Result 195 states and 262 transitions. [2024-11-04 20:46:40,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-04 20:46:40,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 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 98 [2024-11-04 20:46:40,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:40,657 INFO L225 Difference]: With dead ends: 195 [2024-11-04 20:46:40,657 INFO L226 Difference]: Without dead ends: 104 [2024-11-04 20:46:40,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-04 20:46:40,658 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:40,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:40,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-04 20:46:40,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2024-11-04 20:46:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 78 states have internal predecessors, (94), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-04 20:46:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2024-11-04 20:46:40,674 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 98 [2024-11-04 20:46:40,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:40,674 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2024-11-04 20:46:40,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 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) [2024-11-04 20:46:40,675 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2024-11-04 20:46:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-04 20:46:40,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:40,676 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:40,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2024-11-04 20:46:40,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:40,877 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:40,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:40,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1438193982, now seen corresponding path program 1 times [2024-11-04 20:46:40,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:40,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [348096137] [2024-11-04 20:46:40,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:40,878 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:40,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:40,879 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:40,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-04 20:46:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:41,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-04 20:46:41,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:41,384 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 22 treesize of output 1 [2024-11-04 20:46:41,388 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 18 treesize of output 7 [2024-11-04 20:46:41,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-04 20:46:41,396 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 11 treesize of output 1 [2024-11-04 20:46:41,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-04 20:46:41,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-04 20:46:41,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 21 [2024-11-04 20:46:41,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-04 20:46:41,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-04 20:46:41,524 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35|))) (= (let ((.cse0 (select .cse1 (_ bv24 64)))) (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64) .cse0)) .cse1)))) is different from true [2024-11-04 20:46:41,558 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_aws_linked_list_is_valid_#in~list#1.offset| |c_aws_linked_list_is_valid_~list#1.offset|) (= |c_aws_linked_list_is_valid_#in~list#1.base| |c_aws_linked_list_is_valid_~list#1.base|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35|))) (= (let ((.cse0 (select .cse1 (_ bv24 64)))) (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64) .cse0)) .cse1))))) is different from true [2024-11-04 20:46:42,280 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|))) (and (let ((.cse1 (select .cse0 (_ bv24 64)))) (or (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| v_DerPreprocessor_5) .cse1 v_DerPreprocessor_6) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) (_ bv24 64) .cse1))) (= .cse1 |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) (_ bv16 64))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset|) (= (_ bv0 64) (select .cse0 (_ bv16 64))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35|))) (= (let ((.cse2 (select .cse3 (_ bv24 64)))) (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_5) .cse2 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64) .cse2)) .cse3)))))) is different from true [2024-11-04 20:46:42,330 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36|))) (and (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse0 (let ((.cse1 (select .cse0 (_ bv24 64)))) (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_5) .cse1 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64) .cse1)))) (= (_ bv0 64) (select .cse0 (_ bv16 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv16 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36|))) (and (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36| (select .cse2 (_ bv24 64))) (= (_ bv0 64) (select .cse2 (_ bv16 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv16 64))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35|))) (= (let ((.cse3 (select .cse4 (_ bv24 64)))) (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_5) .cse3 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64) .cse3)) .cse4))))) is different from true [2024-11-04 20:46:50,317 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_6| (_ BitVec 64))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_6|))) (and (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_6| (select .cse0 (_ bv24 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_6|) (_ bv16 64))) (= (_ bv0 64) (select .cse0 (_ bv16 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_6| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_6|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_6|) (_ bv16 64))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (= (let ((.cse1 (select .cse2 (_ bv24 64)))) (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_6| v_DerPreprocessor_5) .cse1 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_6|) (_ bv24 64) .cse1)) .cse2)) (= (_ bv0 64) (select .cse2 (_ bv16 64))))))) (= (_ bv0 64) (select .cse3 (_ bv16 64))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_5| (_ BitVec 64))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_5|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_5|) (_ bv16 64))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (= (let ((.cse4 (select .cse5 (_ bv24 64)))) (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_5| v_DerPreprocessor_5) .cse4 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_5|) (_ bv24 64) .cse4)) .cse5)) (= (select .cse5 (_ bv16 64)) (_ bv0 64))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_5| (_ BitVec 64))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_5|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_5|) (_ bv16 64))) (= (select .cse6 (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_5|) (= (select .cse6 (_ bv16 64)) (_ bv0 64)))))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_end_~list#1.offset|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36|))) (and (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse7 (let ((.cse8 (select .cse7 (_ bv24 64)))) (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_5) .cse8 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv24 64) .cse8)))) (= (_ bv0 64) (select .cse7 (_ bv16 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv16 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36|))) (and (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36| (select .cse9 (_ bv24 64))) (= (_ bv0 64) (select .cse9 (_ bv16 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv16 64))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|) (_ bv16 64)) (_ bv0 64)) (let ((.cse10 (select .cse3 (_ bv24 64)))) (or (= .cse10 |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| v_DerPreprocessor_5) .cse10 v_DerPreprocessor_6) |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|) (_ bv24 64) .cse10) .cse3)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35|))) (= (let ((.cse11 (select .cse12 (_ bv24 64)))) (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_5) .cse11 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64) .cse11)) .cse12)))))) is different from true [2024-11-04 20:47:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 27 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 20 not checked. [2024-11-04 20:47:02,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:47:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 10 proven. 33 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-04 20:47:04,119 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:47:04,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [348096137] [2024-11-04 20:47:04,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [348096137] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 20:47:04,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 20:47:04,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10] total 29 [2024-11-04 20:47:04,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882086761] [2024-11-04 20:47:04,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 20:47:04,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-04 20:47:04,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:47:04,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-04 20:47:04,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=435, Unknown=37, NotChecked=240, Total=812 [2024-11-04 20:47:04,121 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand has 29 states, 26 states have (on average 5.269230769230769) internal successors, (137), 23 states have internal predecessors, (137), 13 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-04 20:47:08,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:47:12,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:47:16,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:47:20,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:47:24,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:47:29,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:47:34,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:47:39,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:47:44,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:47:48,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:47:52,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]