./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness_negated.i --full-output --preprocessor.use.memory.slicer true --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 49ed7f3e9a0a6ed433709b0bb1effeae8bd9acd1921ce556b935c6a1999ca674 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:30:47,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:30:47,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:30:47,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:30:47,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:30:47,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:30:47,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:30:47,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:30:47,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:30:47,870 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:30:47,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:30:47,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:30:47,871 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:30:47,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:30:47,872 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:30:47,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:30:47,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:30:47,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:30:47,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:30:47,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:30:47,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:30:47,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:30:47,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:30:47,874 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:30:47,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:30:47,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:30:47,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:30:47,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:30:47,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:30:47,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:30:47,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:30:47,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:30:47,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:30:47,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:30:47,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:30:47,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:30:47,878 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:30:47,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:30:47,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:30:47,878 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 49ed7f3e9a0a6ed433709b0bb1effeae8bd9acd1921ce556b935c6a1999ca674 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:30:48,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:30:48,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:30:48,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:30:48,129 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:30:48,129 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:30:48,130 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_rbegin_harness_negated.i [2023-11-23 07:30:49,204 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:30:49,594 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:30:49,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness_negated.i [2023-11-23 07:30:49,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3cf21a85/3bd321a38f8a412a887fcdc0549cfe2d/FLAG9b0ddcb58 [2023-11-23 07:30:49,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3cf21a85/3bd321a38f8a412a887fcdc0549cfe2d [2023-11-23 07:30:49,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:30:49,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:30:49,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:30:49,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:30:49,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:30:49,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:30:49" (1/1) ... [2023-11-23 07:30:49,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488dab9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:49, skipping insertion in model container [2023-11-23 07:30:49,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:30:49" (1/1) ... [2023-11-23 07:30:49,745 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:30:49,923 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4496,4509] [2023-11-23 07:30:49,930 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4556,4569] [2023-11-23 07:30:50,399 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,400 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,401 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,402 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,404 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,421 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,424 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,428 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,430 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,434 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,435 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,435 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,436 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,642 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:30:50,643 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:30:50,644 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:30:50,645 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:30:50,648 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:30:50,649 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:30:50,649 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:30:50,650 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:30:50,650 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:30:50,654 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:30:50,739 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:30:50,752 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:30:50,768 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4496,4509] [2023-11-23 07:30:50,769 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4556,4569] [2023-11-23 07:30:50,813 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,819 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,820 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,820 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,821 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,828 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,830 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,831 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,831 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,832 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,832 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,832 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,833 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:30:50,864 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:30:50,865 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:30:50,866 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:30:50,866 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:30:50,867 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:30:50,867 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:30:50,868 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:30:50,868 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:30:50,868 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:30:50,869 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:30:50,904 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:30:51,001 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:51,002 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:51,002 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:51,002 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:51,002 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:51,003 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:51,003 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:51,004 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:51,004 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:51,004 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:51,004 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:51,005 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:51,005 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:51,005 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:51,005 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:51,005 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:30:51,013 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:30:51,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:51 WrapperNode [2023-11-23 07:30:51,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:30:51,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:30:51,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:30:51,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:30:51,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:51" (1/1) ... [2023-11-23 07:30:51,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:51" (1/1) ... [2023-11-23 07:30:51,148 INFO L138 Inliner]: procedures = 678, calls = 1041, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 141 [2023-11-23 07:30:51,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:30:51,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:30:51,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:30:51,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:30:51,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:51" (1/1) ... [2023-11-23 07:30:51,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:51" (1/1) ... [2023-11-23 07:30:51,197 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:51" (1/1) ... [2023-11-23 07:30:51,223 INFO L188 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 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]. [2023-11-23 07:30:51,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:51" (1/1) ... [2023-11-23 07:30:51,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:51" (1/1) ... [2023-11-23 07:30:51,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:51" (1/1) ... [2023-11-23 07:30:51,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:51" (1/1) ... [2023-11-23 07:30:51,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:51" (1/1) ... [2023-11-23 07:30:51,265 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:51" (1/1) ... [2023-11-23 07:30:51,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:30:51,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:30:51,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:30:51,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:30:51,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:51" (1/1) ... [2023-11-23 07:30:51,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:30:51,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:30:51,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 07:30:51,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 07:30:51,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:30:51,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:30:51,361 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:30:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:30:51,361 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:30:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 07:30:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 07:30:51,361 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 07:30:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:30:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:30:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:30:51,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:30:51,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:30:51,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:30:51,362 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:30:51,362 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:30:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:30:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:30:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:30:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:30:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:30:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:30:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:30:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 07:30:51,363 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 07:30:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:30:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:30:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:30:51,532 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:30:51,534 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:30:51,693 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:30:51,717 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:30:51,718 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 07:30:51,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:30:51 BoogieIcfgContainer [2023-11-23 07:30:51,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:30:51,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:30:51,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:30:51,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:30:51,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:30:49" (1/3) ... [2023-11-23 07:30:51,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ede4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:30:51, skipping insertion in model container [2023-11-23 07:30:51,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:51" (2/3) ... [2023-11-23 07:30:51,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ede4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:30:51, skipping insertion in model container [2023-11-23 07:30:51,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:30:51" (3/3) ... [2023-11-23 07:30:51,724 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness_negated.i [2023-11-23 07:30:51,736 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:30:51,737 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:30:51,770 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:30:51,781 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4245d0ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:30:51,781 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:30:51,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 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) [2023-11-23 07:30:51,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:30:51,794 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:51,795 INFO L195 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] [2023-11-23 07:30:51,795 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:51,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:51,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1769392804, now seen corresponding path program 1 times [2023-11-23 07:30:51,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:51,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972753487] [2023-11-23 07:30:51,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:52,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:30:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:52,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:30:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:52,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:30:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:52,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:30:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:52,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:30:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:52,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:30:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:52,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:30:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-23 07:30:52,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:52,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972753487] [2023-11-23 07:30:52,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972753487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:30:52,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:30:52,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 07:30:52,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516917491] [2023-11-23 07:30:52,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:30:52,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 07:30:52,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:52,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 07:30:52,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:30:52,336 INFO L87 Difference]: Start difference. First operand has 60 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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) [2023-11-23 07:30:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:30:52,385 INFO L93 Difference]: Finished difference Result 114 states and 170 transitions. [2023-11-23 07:30:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 07:30:52,388 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 65 [2023-11-23 07:30:52,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:30:52,394 INFO L225 Difference]: With dead ends: 114 [2023-11-23 07:30:52,395 INFO L226 Difference]: Without dead ends: 58 [2023-11-23 07:30:52,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:30:52,405 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:30:52,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:30:52,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-23 07:30:52,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-23 07:30:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 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) [2023-11-23 07:30:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2023-11-23 07:30:52,435 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 65 [2023-11-23 07:30:52,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:30:52,435 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2023-11-23 07:30:52,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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) [2023-11-23 07:30:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2023-11-23 07:30:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:30:52,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:52,437 INFO L195 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] [2023-11-23 07:30:52,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:30:52,438 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:52,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:52,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1112295830, now seen corresponding path program 1 times [2023-11-23 07:30:52,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:52,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127295600] [2023-11-23 07:30:52,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:52,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:52,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:30:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:52,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:30:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:52,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:30:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:52,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:30:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:52,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:30:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:52,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:30:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:52,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:30:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:30:52,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:52,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127295600] [2023-11-23 07:30:52,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127295600] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:30:52,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60805369] [2023-11-23 07:30:52,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:52,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:30:52,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:30:52,905 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:30:52,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 07:30:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:53,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-23 07:30:53,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:30:53,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 07:30:53,167 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 19 [2023-11-23 07:30:53,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:53,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:53,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2023-11-23 07:30:53,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:53,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:53,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:30:53,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2023-11-23 07:30:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 07:30:54,675 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:30:54,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60805369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:30:54,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:30:54,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2023-11-23 07:30:54,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829642956] [2023-11-23 07:30:54,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:30:54,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:30:54,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:54,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:30:54,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:30:54,678 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 07:30:55,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:30:55,190 INFO L93 Difference]: Finished difference Result 160 states and 217 transitions. [2023-11-23 07:30:55,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:30:55,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 07:30:55,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:30:55,192 INFO L225 Difference]: With dead ends: 160 [2023-11-23 07:30:55,192 INFO L226 Difference]: Without dead ends: 110 [2023-11-23 07:30:55,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:30:55,193 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 42 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:30:55,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 371 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 07:30:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-23 07:30:55,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2023-11-23 07:30:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 76 states have internal predecessors, (100), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 07:30:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2023-11-23 07:30:55,220 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 146 transitions. Word has length 65 [2023-11-23 07:30:55,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:30:55,220 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 146 transitions. [2023-11-23 07:30:55,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 07:30:55,221 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2023-11-23 07:30:55,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:30:55,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:30:55,222 INFO L195 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] [2023-11-23 07:30:55,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 07:30:55,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:30:55,434 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:30:55,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:30:55,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1684399024, now seen corresponding path program 1 times [2023-11-23 07:30:55,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:30:55,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534978823] [2023-11-23 07:30:55,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:55,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:30:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:55,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:30:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:55,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:30:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:55,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:30:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:55,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:30:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:55,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:30:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:55,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:30:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:55,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:30:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:30:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:30:55,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534978823] [2023-11-23 07:30:55,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534978823] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:30:55,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106175576] [2023-11-23 07:30:55,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:30:55,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:30:55,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:30:55,689 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:30:55,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 07:30:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:30:55,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-23 07:30:55,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:30:55,923 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2023-11-23 07:30:55,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2023-11-23 07:30:55,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-11-23 07:30:55,960 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:30:55,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-23 07:30:55,980 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 69 treesize of output 34 [2023-11-23 07:30:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:30:56,405 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:30:56,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106175576] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:30:56,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:30:56,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2023-11-23 07:30:56,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294993520] [2023-11-23 07:30:56,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:30:56,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:30:56,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:30:56,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:30:56,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:30:56,407 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 07:30:58,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:00,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:02,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:04,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:06,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:06,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:06,850 INFO L93 Difference]: Finished difference Result 172 states and 235 transitions. [2023-11-23 07:31:06,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 07:31:06,851 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2023-11-23 07:31:06,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:06,852 INFO L225 Difference]: With dead ends: 172 [2023-11-23 07:31:06,852 INFO L226 Difference]: Without dead ends: 113 [2023-11-23 07:31:06,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2023-11-23 07:31:06,853 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 90 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 23 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:06,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 406 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 303 Invalid, 5 Unknown, 0 Unchecked, 10.3s Time] [2023-11-23 07:31:06,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-23 07:31:06,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2023-11-23 07:31:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 78 states have internal predecessors, (102), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 07:31:06,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 148 transitions. [2023-11-23 07:31:06,866 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 148 transitions. Word has length 65 [2023-11-23 07:31:06,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:06,866 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 148 transitions. [2023-11-23 07:31:06,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 07:31:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2023-11-23 07:31:06,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:31:06,868 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:06,868 INFO L195 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] [2023-11-23 07:31:06,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 07:31:07,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-23 07:31:07,081 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:07,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:07,081 INFO L85 PathProgramCache]: Analyzing trace with hash -658626422, now seen corresponding path program 1 times [2023-11-23 07:31:07,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:07,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859189582] [2023-11-23 07:31:07,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:07,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:07,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:07,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:07,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:07,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:31:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:07,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:31:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:07,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:31:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:07,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:31:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:31:07,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:07,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859189582] [2023-11-23 07:31:07,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859189582] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:07,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499250148] [2023-11-23 07:31:07,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:07,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:07,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:07,325 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:31:07,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 07:31:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:07,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-23 07:31:07,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:07,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 07:31:07,488 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 19 [2023-11-23 07:31:07,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:07,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:07,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:07,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2023-11-23 07:31:07,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:07,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:07,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2023-11-23 07:31:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:31:08,389 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:31:08,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499250148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:31:08,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:31:08,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2023-11-23 07:31:08,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139488392] [2023-11-23 07:31:08,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:08,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:31:08,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:08,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:31:08,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:31:08,394 INFO L87 Difference]: Start difference. First operand 110 states and 148 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 07:31:09,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:09,087 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2023-11-23 07:31:09,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:31:09,088 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2023-11-23 07:31:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:09,091 INFO L225 Difference]: With dead ends: 181 [2023-11-23 07:31:09,091 INFO L226 Difference]: Without dead ends: 117 [2023-11-23 07:31:09,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-11-23 07:31:09,095 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 100 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:09,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 389 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 07:31:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-23 07:31:09,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2023-11-23 07:31:09,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 80 states have internal predecessors, (104), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 07:31:09,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 150 transitions. [2023-11-23 07:31:09,114 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 150 transitions. Word has length 65 [2023-11-23 07:31:09,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:09,114 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 150 transitions. [2023-11-23 07:31:09,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 07:31:09,115 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 150 transitions. [2023-11-23 07:31:09,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:31:09,116 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:09,117 INFO L195 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] [2023-11-23 07:31:09,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 07:31:09,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:09,330 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:09,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:09,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1561333316, now seen corresponding path program 1 times [2023-11-23 07:31:09,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:09,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767203554] [2023-11-23 07:31:09,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:09,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:09,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:09,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:09,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:31:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:09,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:31:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:09,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:31:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:09,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:31:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:31:09,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:09,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767203554] [2023-11-23 07:31:09,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767203554] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:09,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166177977] [2023-11-23 07:31:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:09,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:09,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:09,769 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:31:09,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 07:31:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:09,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-23 07:31:09,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:09,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 07:31:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:31:10,578 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:31:10,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166177977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:31:10,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:31:10,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2023-11-23 07:31:10,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428606609] [2023-11-23 07:31:10,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:10,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:31:10,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:10,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:31:10,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2023-11-23 07:31:10,580 INFO L87 Difference]: Start difference. First operand 112 states and 150 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 07:31:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:11,002 INFO L93 Difference]: Finished difference Result 191 states and 256 transitions. [2023-11-23 07:31:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 07:31:11,002 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2023-11-23 07:31:11,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:11,003 INFO L225 Difference]: With dead ends: 191 [2023-11-23 07:31:11,003 INFO L226 Difference]: Without dead ends: 121 [2023-11-23 07:31:11,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2023-11-23 07:31:11,004 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 93 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:11,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 381 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:31:11,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-23 07:31:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2023-11-23 07:31:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.325) internal successors, (106), 82 states have internal predecessors, (106), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 07:31:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 152 transitions. [2023-11-23 07:31:11,016 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 152 transitions. Word has length 65 [2023-11-23 07:31:11,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:11,022 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 152 transitions. [2023-11-23 07:31:11,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 07:31:11,023 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 152 transitions. [2023-11-23 07:31:11,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:31:11,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:11,024 INFO L195 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] [2023-11-23 07:31:11,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-23 07:31:11,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:11,227 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:11,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:11,227 INFO L85 PathProgramCache]: Analyzing trace with hash 343895422, now seen corresponding path program 1 times [2023-11-23 07:31:11,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:11,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626904142] [2023-11-23 07:31:11,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:11,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:11,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:11,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:11,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:31:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:11,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:31:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:11,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:31:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:11,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:31:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:11,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:31:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:31:11,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:11,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626904142] [2023-11-23 07:31:11,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626904142] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:11,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523875969] [2023-11-23 07:31:11,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:11,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:11,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:11,356 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:31:11,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 07:31:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:11,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 07:31:11,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:31:11,509 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:31:11,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523875969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:31:11,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:31:11,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-11-23 07:31:11,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909073529] [2023-11-23 07:31:11,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:31:11,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 07:31:11,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:11,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 07:31:11,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:31:11,511 INFO L87 Difference]: Start difference. First operand 114 states and 152 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) [2023-11-23 07:31:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:31:11,567 INFO L93 Difference]: Finished difference Result 245 states and 336 transitions. [2023-11-23 07:31:11,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:31:11,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 65 [2023-11-23 07:31:11,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:31:11,569 INFO L225 Difference]: With dead ends: 245 [2023-11-23 07:31:11,569 INFO L226 Difference]: Without dead ends: 144 [2023-11-23 07:31:11,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:31:11,570 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 34 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:31:11,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 214 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:31:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-23 07:31:11,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2023-11-23 07:31:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 110 states have internal predecessors, (144), 26 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2023-11-23 07:31:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 198 transitions. [2023-11-23 07:31:11,582 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 198 transitions. Word has length 65 [2023-11-23 07:31:11,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:31:11,582 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 198 transitions. [2023-11-23 07:31:11,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) [2023-11-23 07:31:11,583 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 198 transitions. [2023-11-23 07:31:11,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-23 07:31:11,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:31:11,584 INFO L195 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] [2023-11-23 07:31:11,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 07:31:11,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:11,796 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:31:11,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:31:11,796 INFO L85 PathProgramCache]: Analyzing trace with hash -879428092, now seen corresponding path program 1 times [2023-11-23 07:31:11,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:31:11,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163847700] [2023-11-23 07:31:11,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:11,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:31:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:11,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:31:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:11,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:31:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:11,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:31:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:11,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:31:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:11,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 07:31:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:11,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 07:31:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:11,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 07:31:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:11,981 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 07:31:11,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:31:11,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163847700] [2023-11-23 07:31:11,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163847700] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:31:11,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839986234] [2023-11-23 07:31:11,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:31:11,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:31:11,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:31:11,984 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:31:11,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 07:31:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:31:12,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-23 07:31:12,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:31:12,156 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 19 [2023-11-23 07:31:12,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 07:31:12,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:12,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:12,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-23 07:31:12,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:12,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-23 07:31:12,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:12,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-23 07:31:12,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:12,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-23 07:31:12,301 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2023-11-23 07:31:12,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 120 [2023-11-23 07:31:12,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:12,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:12,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 91 [2023-11-23 07:31:12,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:12,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:31:12,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2023-11-23 07:31:12,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-23 07:31:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 1 refuted. 33 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:31:38,626 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:31:39,025 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_485 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_485))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_484 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_484))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2023-11-23 07:31:39,056 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_23| Int)) (or (forall ((v_ArrVal_484 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_23|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_23| v_ArrVal_484))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_23|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_23| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_23| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_23| 1)) (forall ((v_ArrVal_478 Int) (v_ArrVal_485 (Array Int Int)) (v_subst_1 Int)) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_478)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_23| v_ArrVal_485))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_1))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2023-11-23 07:31:39,071 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:31:39,072 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:31:39,129 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 07:31:39,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 171 treesize of output 200 [2023-11-23 07:31:39,138 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:31:39,139 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:31:39,195 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 07:31:39,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 355 treesize of output 342 [2023-11-23 07:31:39,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:39,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 286 [2023-11-23 07:31:39,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 233 [2023-11-23 07:31:39,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:39,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 340 treesize of output 318 [2023-11-23 07:31:39,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 273 [2023-11-23 07:31:39,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-23 07:31:39,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-23 07:31:39,970 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:31:39,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:39,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 83 [2023-11-23 07:31:40,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:31:40,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 80 [2023-11-23 07:31:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2023-11-23 07:31:40,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839986234] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:31:40,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:31:40,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19, 10] total 31 [2023-11-23 07:31:40,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303048307] [2023-11-23 07:31:40,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:31:40,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-23 07:31:40,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:31:40,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-23 07:31:40,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=660, Unknown=58, NotChecked=110, Total=930 [2023-11-23 07:31:40,166 INFO L87 Difference]: Start difference. First operand 144 states and 198 transitions. Second operand has 31 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 12 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2023-11-23 07:31:42,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:49,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:56,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:31:58,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:00,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:03,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:06,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:08,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:11,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:13,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:15,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:17,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:19,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:21,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:23,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:26,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:31,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:33,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:35,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:43,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:48,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:50,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:53,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:32:58,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:00,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:02,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:04,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:07,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:09,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:11,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:14,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:19,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:23,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:25,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:27,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:29,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:31,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:34,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:36,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:38,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:40,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:42,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:44,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:51,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:33:53,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:34:05,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:34:12,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:34:14,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:34:16,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:34:18,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:34:21,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:34:24,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:34:26,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:34:28,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:34:30,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:34:34,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:34:37,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:34:50,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:34:52,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:34:54,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:34:56,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:34:58,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:35:00,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:35:02,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:35:05,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:35:07,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:35:08,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:35:08,858 INFO L93 Difference]: Finished difference Result 383 states and 557 transitions. [2023-11-23 07:35:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-23 07:35:08,859 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 12 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) Word has length 66 [2023-11-23 07:35:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:35:08,861 INFO L225 Difference]: With dead ends: 383 [2023-11-23 07:35:08,861 INFO L226 Difference]: Without dead ends: 285 [2023-11-23 07:35:08,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 79.6s TimeCoverageRelationStatistics Valid=313, Invalid=2593, Unknown=182, NotChecked=218, Total=3306 [2023-11-23 07:35:08,862 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 93 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 24 mSolverCounterUnsat, 484 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 151.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 484 IncrementalHoareTripleChecker+Unknown, 433 IncrementalHoareTripleChecker+Unchecked, 152.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:35:08,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1676 Invalid, 2143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1202 Invalid, 484 Unknown, 433 Unchecked, 152.3s Time] [2023-11-23 07:35:08,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-11-23 07:35:08,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 247. [2023-11-23 07:35:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 186 states have (on average 1.381720430107527) internal successors, (257), 195 states have internal predecessors, (257), 40 states have call successors, (40), 14 states have call predecessors, (40), 20 states have return successors, (62), 37 states have call predecessors, (62), 38 states have call successors, (62) [2023-11-23 07:35:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 359 transitions. [2023-11-23 07:35:08,928 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 359 transitions. Word has length 66 [2023-11-23 07:35:08,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:35:08,928 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 359 transitions. [2023-11-23 07:35:08,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 12 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2023-11-23 07:35:08,929 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 359 transitions. [2023-11-23 07:35:08,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-23 07:35:08,930 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:35:08,930 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:35:08,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 07:35:09,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:35:09,131 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:35:09,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:35:09,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1415332894, now seen corresponding path program 1 times [2023-11-23 07:35:09,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:35:09,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840508729] [2023-11-23 07:35:09,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:35:09,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:35:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:09,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:35:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:09,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:35:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:09,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:35:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:09,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:35:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:09,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 07:35:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:09,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 07:35:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:09,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 07:35:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:35:09,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:35:09,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840508729] [2023-11-23 07:35:09,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840508729] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:35:09,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735063965] [2023-11-23 07:35:09,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:35:09,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:35:09,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:35:09,282 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:35:09,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 07:35:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:09,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 07:35:09,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:35:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:35:09,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:35:09,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735063965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:35:09,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:35:09,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-23 07:35:09,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306884943] [2023-11-23 07:35:09,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:35:09,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:35:09,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:35:09,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:35:09,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:35:09,526 INFO L87 Difference]: Start difference. First operand 247 states and 359 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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) [2023-11-23 07:35:09,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:35:09,666 INFO L93 Difference]: Finished difference Result 480 states and 699 transitions. [2023-11-23 07:35:09,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:35:09,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 67 [2023-11-23 07:35:09,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:35:09,669 INFO L225 Difference]: With dead ends: 480 [2023-11-23 07:35:09,669 INFO L226 Difference]: Without dead ends: 265 [2023-11-23 07:35:09,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:35:09,670 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 33 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:35:09,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 236 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:35:09,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-11-23 07:35:09,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 248. [2023-11-23 07:35:09,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 187 states have (on average 1.374331550802139) internal successors, (257), 196 states have internal predecessors, (257), 40 states have call successors, (40), 14 states have call predecessors, (40), 20 states have return successors, (62), 37 states have call predecessors, (62), 38 states have call successors, (62) [2023-11-23 07:35:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 359 transitions. [2023-11-23 07:35:09,709 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 359 transitions. Word has length 67 [2023-11-23 07:35:09,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:35:09,710 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 359 transitions. [2023-11-23 07:35:09,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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) [2023-11-23 07:35:09,710 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 359 transitions. [2023-11-23 07:35:09,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 07:35:09,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:35:09,712 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:35:09,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 07:35:09,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:35:09,927 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:35:09,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:35:09,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1234342063, now seen corresponding path program 1 times [2023-11-23 07:35:09,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:35:09,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644740328] [2023-11-23 07:35:09,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:35:09,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:35:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:35:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:35:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:35:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:35:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:35:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 07:35:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 07:35:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 07:35:10,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:35:10,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644740328] [2023-11-23 07:35:10,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644740328] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:35:10,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039964608] [2023-11-23 07:35:10,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:35:10,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:35:10,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:35:10,066 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:35:10,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 07:35:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 07:35:10,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:35:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:35:10,264 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:35:10,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039964608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:35:10,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:35:10,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2023-11-23 07:35:10,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979559607] [2023-11-23 07:35:10,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:35:10,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:35:10,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:35:10,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:35:10,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:35:10,266 INFO L87 Difference]: Start difference. First operand 248 states and 359 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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) [2023-11-23 07:35:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:35:10,422 INFO L93 Difference]: Finished difference Result 524 states and 765 transitions. [2023-11-23 07:35:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:35:10,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 69 [2023-11-23 07:35:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:35:10,424 INFO L225 Difference]: With dead ends: 524 [2023-11-23 07:35:10,424 INFO L226 Difference]: Without dead ends: 307 [2023-11-23 07:35:10,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:35:10,425 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 57 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:35:10,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 278 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:35:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2023-11-23 07:35:10,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 252. [2023-11-23 07:35:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 200 states have internal predecessors, (263), 40 states have call successors, (40), 14 states have call predecessors, (40), 20 states have return successors, (62), 37 states have call predecessors, (62), 38 states have call successors, (62) [2023-11-23 07:35:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 365 transitions. [2023-11-23 07:35:10,449 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 365 transitions. Word has length 69 [2023-11-23 07:35:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:35:10,449 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 365 transitions. [2023-11-23 07:35:10,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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) [2023-11-23 07:35:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 365 transitions. [2023-11-23 07:35:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 07:35:10,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:35:10,450 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:35:10,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 07:35:10,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-23 07:35:10,663 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:35:10,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:35:10,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1920131848, now seen corresponding path program 1 times [2023-11-23 07:35:10,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:35:10,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853963585] [2023-11-23 07:35:10,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:35:10,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:35:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:35:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:35:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:35:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:35:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 07:35:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:35:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 07:35:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 07:35:10,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:35:10,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853963585] [2023-11-23 07:35:10,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853963585] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:35:10,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147266822] [2023-11-23 07:35:10,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:35:10,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:35:10,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:35:10,796 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:35:10,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 07:35:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:10,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 07:35:10,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:35:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 07:35:10,954 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:35:10,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147266822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:35:10,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:35:10,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-23 07:35:10,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833215517] [2023-11-23 07:35:10,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:35:10,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 07:35:10,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:35:10,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 07:35:10,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:35:10,956 INFO L87 Difference]: Start difference. First operand 252 states and 365 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) [2023-11-23 07:35:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:35:11,011 INFO L93 Difference]: Finished difference Result 427 states and 640 transitions. [2023-11-23 07:35:11,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 07:35:11,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 70 [2023-11-23 07:35:11,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:35:11,025 INFO L225 Difference]: With dead ends: 427 [2023-11-23 07:35:11,025 INFO L226 Difference]: Without dead ends: 206 [2023-11-23 07:35:11,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:35:11,027 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 4 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:35:11,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 130 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:35:11,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-11-23 07:35:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 187. [2023-11-23 07:35:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 137 states have (on average 1.3503649635036497) internal successors, (185), 144 states have internal predecessors, (185), 35 states have call successors, (35), 10 states have call predecessors, (35), 14 states have return successors, (50), 32 states have call predecessors, (50), 33 states have call successors, (50) [2023-11-23 07:35:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 270 transitions. [2023-11-23 07:35:11,045 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 270 transitions. Word has length 70 [2023-11-23 07:35:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:35:11,046 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 270 transitions. [2023-11-23 07:35:11,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) [2023-11-23 07:35:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 270 transitions. [2023-11-23 07:35:11,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 07:35:11,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:35:11,047 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2023-11-23 07:35:11,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-23 07:35:11,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 07:35:11,260 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:35:11,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:35:11,261 INFO L85 PathProgramCache]: Analyzing trace with hash 642463203, now seen corresponding path program 1 times [2023-11-23 07:35:11,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:35:11,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580757860] [2023-11-23 07:35:11,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:35:11,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:35:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:11,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:35:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:11,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:35:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:11,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:35:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:11,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:35:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:11,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:35:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:11,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:35:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:11,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:35:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:11,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:35:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:35:11,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:35:11,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580757860] [2023-11-23 07:35:11,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580757860] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:35:11,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325123902] [2023-11-23 07:35:11,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:35:11,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:35:11,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:35:11,597 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:35:11,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 07:35:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:11,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 07:35:11,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:35:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 07:35:11,872 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:35:11,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325123902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:35:11,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:35:11,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-11-23 07:35:11,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264757182] [2023-11-23 07:35:11,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:35:11,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:35:11,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:35:11,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:35:11,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:35:11,873 INFO L87 Difference]: Start difference. First operand 187 states and 270 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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) [2023-11-23 07:35:12,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:35:12,002 INFO L93 Difference]: Finished difference Result 346 states and 493 transitions. [2023-11-23 07:35:12,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:35:12,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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 77 [2023-11-23 07:35:12,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:35:12,004 INFO L225 Difference]: With dead ends: 346 [2023-11-23 07:35:12,004 INFO L226 Difference]: Without dead ends: 151 [2023-11-23 07:35:12,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:35:12,006 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 22 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:35:12,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 344 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:35:12,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-23 07:35:12,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2023-11-23 07:35:12,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 110 states have internal predecessors, (131), 33 states have call successors, (33), 10 states have call predecessors, (33), 13 states have return successors, (46), 30 states have call predecessors, (46), 31 states have call successors, (46) [2023-11-23 07:35:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 210 transitions. [2023-11-23 07:35:12,029 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 210 transitions. Word has length 77 [2023-11-23 07:35:12,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:35:12,030 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 210 transitions. [2023-11-23 07:35:12,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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) [2023-11-23 07:35:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 210 transitions. [2023-11-23 07:35:12,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-23 07:35:12,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:35:12,031 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:35:12,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-23 07:35:12,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 07:35:12,243 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:35:12,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:35:12,244 INFO L85 PathProgramCache]: Analyzing trace with hash -245035171, now seen corresponding path program 1 times [2023-11-23 07:35:12,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:35:12,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428772131] [2023-11-23 07:35:12,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:35:12,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:35:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:12,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:35:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:12,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:35:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:12,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:35:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:12,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:35:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:12,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 07:35:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:12,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 07:35:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:12,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:35:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:12,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 07:35:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 07:35:12,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:35:12,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428772131] [2023-11-23 07:35:12,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428772131] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:35:12,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502143274] [2023-11-23 07:35:12,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:35:12,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:35:12,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:35:12,438 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:35:12,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-23 07:35:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:12,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-23 07:35:12,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:35:12,702 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2023-11-23 07:35:12,702 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2023-11-23 07:35:12,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-11-23 07:35:12,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:35:12,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-23 07:35:12,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 26 [2023-11-23 07:35:12,836 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| .cse0)) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse2))) (and (not (= .cse1 0)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (and (= (select v_DerPreprocessor_11 .cse2) .cse1) (= v_DerPreprocessor_10 (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_10) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| v_DerPreprocessor_11) .cse1))))))))) is different from true [2023-11-23 07:35:13,166 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|) .cse1))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (and (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_10) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| v_DerPreprocessor_11) .cse0) v_DerPreprocessor_10) (= (select v_DerPreprocessor_11 .cse1) .cse0))) (not (= .cse0 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| .cse2)) (not (= .cse2 0)))))) is different from true [2023-11-23 07:35:13,338 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_14| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_15|) .cse1))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (and (= (select v_DerPreprocessor_11 .cse1) .cse0) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_10) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_15| v_DerPreprocessor_11) .cse0) v_DerPreprocessor_10))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_14| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_15|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_14| 24)))) (and (not (= .cse2 0)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_15|)))))) is different from true [2023-11-23 07:35:13,547 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) .cse1))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (and (= v_DerPreprocessor_10 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_10) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_11) .cse0)) (= (select v_DerPreprocessor_11 .cse1) .cse0))) (not (= .cse0 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)))) (and (not (= .cse2 0)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)))))) is different from true [2023-11-23 07:35:13,733 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24)))) (and (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|)) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) .cse2))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (and (= v_DerPreprocessor_10 (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_10) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| v_DerPreprocessor_11) .cse1)) (= .cse1 (select v_DerPreprocessor_11 .cse2)))) (not (= .cse1 0))))))) is different from true [2023-11-23 07:35:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 37 not checked. [2023-11-23 07:35:14,054 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:35:14,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:35:14,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 163 [2023-11-23 07:35:14,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 156 [2023-11-23 07:35:14,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-11-23 07:35:14,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-23 07:35:14,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-23 07:35:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:35:14,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502143274] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 07:35:14,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:35:14,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7, 15] total 26 [2023-11-23 07:35:14,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244928638] [2023-11-23 07:35:14,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:35:14,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:35:14,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:35:14,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:35:14,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=364, Unknown=10, NotChecked=210, Total=650 [2023-11-23 07:35:14,451 INFO L87 Difference]: Start difference. First operand 151 states and 210 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:35:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:35:14,922 INFO L93 Difference]: Finished difference Result 250 states and 369 transitions. [2023-11-23 07:35:14,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:35:14,923 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 78 [2023-11-23 07:35:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:35:14,923 INFO L225 Difference]: With dead ends: 250 [2023-11-23 07:35:14,923 INFO L226 Difference]: Without dead ends: 157 [2023-11-23 07:35:14,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 147 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=86, Invalid=473, Unknown=13, NotChecked=240, Total=812 [2023-11-23 07:35:14,928 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 65 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:35:14,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 429 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:35:14,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-23 07:35:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2023-11-23 07:35:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 108 states have (on average 1.25) internal successors, (135), 114 states have internal predecessors, (135), 33 states have call successors, (33), 10 states have call predecessors, (33), 13 states have return successors, (46), 30 states have call predecessors, (46), 31 states have call successors, (46) [2023-11-23 07:35:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 214 transitions. [2023-11-23 07:35:14,942 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 214 transitions. Word has length 78 [2023-11-23 07:35:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:35:14,942 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 214 transitions. [2023-11-23 07:35:14,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:35:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 214 transitions. [2023-11-23 07:35:14,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-23 07:35:14,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:35:14,945 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:35:14,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-23 07:35:15,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-23 07:35:15,157 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:35:15,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:35:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1147535271, now seen corresponding path program 1 times [2023-11-23 07:35:15,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:35:15,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766949142] [2023-11-23 07:35:15,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:35:15,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:35:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:15,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:35:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:15,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:35:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:15,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:35:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:15,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:35:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:15,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 07:35:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:15,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 07:35:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:15,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:35:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:15,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 07:35:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:15,418 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 07:35:15,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:35:15,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766949142] [2023-11-23 07:35:15,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766949142] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:35:15,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755765870] [2023-11-23 07:35:15,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:35:15,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:35:15,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:35:15,420 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:35:15,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-23 07:35:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:15,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-23 07:35:15,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:35:15,620 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 19 [2023-11-23 07:35:15,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2023-11-23 07:35:15,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:35:15,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:35:15,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-23 07:35:15,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:35:15,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-23 07:35:15,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:35:15,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-23 07:35:15,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:35:15,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-23 07:35:15,766 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2023-11-23 07:35:15,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 120 [2023-11-23 07:35:15,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:35:15,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:35:15,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 91 [2023-11-23 07:35:15,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:35:15,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:35:15,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2023-11-23 07:35:15,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-23 07:35:15,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:35:15,787 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 57 treesize of output 28 [2023-11-23 07:35:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:35:16,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:35:17,139 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_954 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_954))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_953 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_953))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2023-11-23 07:35:17,168 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_30| Int)) (or (forall ((v_ArrVal_953 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_30|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_30| v_ArrVal_953))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_30|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_30| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_30| 1)) (forall ((v_ArrVal_954 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_952 Int)) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_952)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_30| v_ArrVal_954))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_2))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2023-11-23 07:35:17,178 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:35:17,179 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:35:17,236 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2023-11-23 07:35:17,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 171 treesize of output 200 [2023-11-23 07:35:17,257 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:35:17,258 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:35:17,336 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2023-11-23 07:35:17,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 229 treesize of output 258 [2023-11-23 07:35:17,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:35:17,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 286 [2023-11-23 07:35:17,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 233 [2023-11-23 07:35:17,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:35:17,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 340 treesize of output 318 [2023-11-23 07:35:17,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 273 [2023-11-23 07:35:17,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-23 07:35:18,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-23 07:35:18,201 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:35:18,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:35:18,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 83 [2023-11-23 07:35:18,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:35:18,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 80 [2023-11-23 07:35:18,337 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2023-11-23 07:35:18,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755765870] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:35:18,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:35:18,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 11] total 26 [2023-11-23 07:35:18,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619786319] [2023-11-23 07:35:18,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:35:18,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 07:35:18,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:35:18,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 07:35:18,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=486, Unknown=2, NotChecked=90, Total=650 [2023-11-23 07:35:18,339 INFO L87 Difference]: Start difference. First operand 155 states and 214 transitions. Second operand has 26 states, 23 states have (on average 4.956521739130435) internal successors, (114), 25 states have internal predecessors, (114), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2023-11-23 07:35:20,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:35:20,978 INFO L93 Difference]: Finished difference Result 428 states and 601 transitions. [2023-11-23 07:35:20,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-23 07:35:20,979 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 4.956521739130435) internal successors, (114), 25 states have internal predecessors, (114), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) Word has length 78 [2023-11-23 07:35:20,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:35:20,980 INFO L225 Difference]: With dead ends: 428 [2023-11-23 07:35:20,980 INFO L226 Difference]: Without dead ends: 265 [2023-11-23 07:35:20,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 153 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=317, Invalid=2239, Unknown=2, NotChecked=198, Total=2756 [2023-11-23 07:35:20,982 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 146 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 479 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-23 07:35:20,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1351 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1449 Invalid, 0 Unknown, 479 Unchecked, 1.6s Time] [2023-11-23 07:35:20,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-11-23 07:35:20,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 205. [2023-11-23 07:35:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 158 states have internal predecessors, (188), 35 states have call successors, (35), 14 states have call predecessors, (35), 19 states have return successors, (47), 32 states have call predecessors, (47), 32 states have call successors, (47) [2023-11-23 07:35:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 270 transitions. [2023-11-23 07:35:20,999 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 270 transitions. Word has length 78 [2023-11-23 07:35:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:35:20,999 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 270 transitions. [2023-11-23 07:35:21,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 4.956521739130435) internal successors, (114), 25 states have internal predecessors, (114), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2023-11-23 07:35:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 270 transitions. [2023-11-23 07:35:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 07:35:21,001 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:35:21,001 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:35:21,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-23 07:35:21,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 07:35:21,213 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:35:21,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:35:21,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1919735650, now seen corresponding path program 1 times [2023-11-23 07:35:21,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:35:21,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666785038] [2023-11-23 07:35:21,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:35:21,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:35:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:21,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:35:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:21,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:35:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:35:21,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:35:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15