./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_init_harness.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_init_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5b917a1c951859368fb2463a158063964361d86aeab261c924186dc34055576d --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:26:26,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:26:27,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:26:27,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:26:27,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:26:27,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:26:27,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:26:27,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:26:27,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:26:27,042 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:26:27,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:26:27,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:26:27,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:26:27,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:26:27,045 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:26:27,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:26:27,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:26:27,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:26:27,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:26:27,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:26:27,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:26:27,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:26:27,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:26:27,051 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:26:27,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:26:27,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:26:27,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:26:27,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:26:27,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:26:27,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:26:27,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:26:27,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:26:27,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:26:27,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:26:27,054 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:26:27,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:26:27,054 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:26:27,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:26:27,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:26:27,055 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 -> 5b917a1c951859368fb2463a158063964361d86aeab261c924186dc34055576d Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:26:27,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:26:27,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:26:27,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:26:27,305 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:26:27,305 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:26:27,306 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_init_harness.i [2023-11-23 07:26:28,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:26:28,696 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:26:28,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_init_harness.i [2023-11-23 07:26:28,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f7d3ca53/f77dfcf053fe432091512f4999956c49/FLAG5cb8184ce [2023-11-23 07:26:28,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f7d3ca53/f77dfcf053fe432091512f4999956c49 [2023-11-23 07:26:28,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:26:28,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:26:28,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:26:28,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:26:28,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:26:28,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:26:28" (1/1) ... [2023-11-23 07:26:28,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be64e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:28, skipping insertion in model container [2023-11-23 07:26:28,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:26:28" (1/1) ... [2023-11-23 07:26:28,828 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:26:29,062 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_init_harness.i[4494,4507] [2023-11-23 07:26:29,069 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_init_harness.i[4554,4567] [2023-11-23 07:26:29,614 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:29,615 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:29,616 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:29,618 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:29,619 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:29,628 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:29,629 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:29,630 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:29,631 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:29,635 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:29,635 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:29,636 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:29,636 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:29,857 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:26:29,858 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:26:29,858 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:26:29,859 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:26:29,860 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:26:29,860 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:26:29,860 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:26:29,861 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:26:29,864 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:26:29,865 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:26:29,986 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:26:29,999 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:26:30,016 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_init_harness.i[4494,4507] [2023-11-23 07:26:30,017 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_init_harness.i[4554,4567] [2023-11-23 07:26:30,062 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:30,064 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:30,064 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:30,064 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:30,065 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:30,077 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:30,079 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:30,081 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:30,081 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:30,082 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:30,082 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:30,083 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:30,084 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:30,124 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:26:30,127 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:26:30,128 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:26:30,128 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:26:30,133 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:26:30,134 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:26:30,134 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:26:30,135 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:26:30,135 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:26:30,136 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:26:30,165 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:26:30,297 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:30,298 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:30,298 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:30,298 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:30,298 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:30,298 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:30,298 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:30,298 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:30,299 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:30,299 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:30,299 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:30,299 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:30,299 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:30,299 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:30,299 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:30,299 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:30,305 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:26:30,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:30 WrapperNode [2023-11-23 07:26:30,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:26:30,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:26:30,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:26:30,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:26:30,312 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:26:30" (1/1) ... [2023-11-23 07:26:30,359 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:26:30" (1/1) ... [2023-11-23 07:26:30,388 INFO L138 Inliner]: procedures = 678, calls = 1036, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 91 [2023-11-23 07:26:30,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:26:30,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:26:30,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:26:30,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:26:30,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:30" (1/1) ... [2023-11-23 07:26:30,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:30" (1/1) ... [2023-11-23 07:26:30,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:30" (1/1) ... [2023-11-23 07:26:30,424 INFO L188 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 4 writes are split as follows [0, 0, 4]. [2023-11-23 07:26:30,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:30" (1/1) ... [2023-11-23 07:26:30,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:30" (1/1) ... [2023-11-23 07:26:30,438 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:30" (1/1) ... [2023-11-23 07:26:30,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:30" (1/1) ... [2023-11-23 07:26:30,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:30" (1/1) ... [2023-11-23 07:26:30,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:30" (1/1) ... [2023-11-23 07:26:30,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:26:30,476 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:26:30,476 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:26:30,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:26:30,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:30" (1/1) ... [2023-11-23 07:26:30,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:26:30,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:30,552 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:26:30,587 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:26:30,612 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2023-11-23 07:26:30,612 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2023-11-23 07:26:30,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:26:30,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:26:30,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:26:30,613 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:26:30,613 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:26:30,613 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 07:26:30,613 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 07:26:30,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:26:30,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:26:30,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:26:30,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:26:30,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:26:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:26:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2023-11-23 07:26:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2023-11-23 07:26:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:26:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:26:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:26:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:26:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:26:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:26:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:26:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:26:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:26:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:26:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:26:30,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:26:30,797 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:26:30,798 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:26:31,045 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:26:31,067 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:26:31,067 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 07:26:31,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:26:31 BoogieIcfgContainer [2023-11-23 07:26:31,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:26:31,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:26:31,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:26:31,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:26:31,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:26:28" (1/3) ... [2023-11-23 07:26:31,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9caeb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:26:31, skipping insertion in model container [2023-11-23 07:26:31,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:30" (2/3) ... [2023-11-23 07:26:31,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9caeb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:26:31, skipping insertion in model container [2023-11-23 07:26:31,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:26:31" (3/3) ... [2023-11-23 07:26:31,075 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_init_harness.i [2023-11-23 07:26:31,091 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:26:31,092 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:26:31,131 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:26:31,137 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;@7fd757a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:26:31,138 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:26:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-23 07:26:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 07:26:31,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:31,148 INFO L195 NwaCegarLoop]: trace histogram [1, 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:26:31,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:31,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:31,154 INFO L85 PathProgramCache]: Analyzing trace with hash 432604891, now seen corresponding path program 1 times [2023-11-23 07:26:31,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:31,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123161193] [2023-11-23 07:26:31,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:31,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:31,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:26:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:31,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:26:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:31,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:31,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123161193] [2023-11-23 07:26:31,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123161193] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:31,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:26:31,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 07:26:31,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696592448] [2023-11-23 07:26:31,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:31,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 07:26:31,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:31,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 07:26:31,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:26:31,544 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 07:26:31,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:31,576 INFO L93 Difference]: Finished difference Result 104 states and 145 transitions. [2023-11-23 07:26:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 07:26:31,579 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-11-23 07:26:31,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:31,585 INFO L225 Difference]: With dead ends: 104 [2023-11-23 07:26:31,585 INFO L226 Difference]: Without dead ends: 52 [2023-11-23 07:26:31,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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:26:31,592 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:31,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:26:31,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-23 07:26:31,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-23 07:26:31,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-23 07:26:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2023-11-23 07:26:31,624 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 25 [2023-11-23 07:26:31,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:31,625 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2023-11-23 07:26:31,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 07:26:31,625 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2023-11-23 07:26:31,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 07:26:31,626 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:31,626 INFO L195 NwaCegarLoop]: trace histogram [1, 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:26:31,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:26:31,627 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:31,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:31,628 INFO L85 PathProgramCache]: Analyzing trace with hash -385043559, now seen corresponding path program 1 times [2023-11-23 07:26:31,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:31,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833041052] [2023-11-23 07:26:31,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:31,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:32,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:26:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:32,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:26:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:32,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:32,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833041052] [2023-11-23 07:26:32,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833041052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:32,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:26:32,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 07:26:32,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902868815] [2023-11-23 07:26:32,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:32,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 07:26:32,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:32,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 07:26:32,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:26:32,442 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 07:26:32,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:32,647 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2023-11-23 07:26:32,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:26:32,648 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-11-23 07:26:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:32,652 INFO L225 Difference]: With dead ends: 101 [2023-11-23 07:26:32,652 INFO L226 Difference]: Without dead ends: 55 [2023-11-23 07:26:32,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:26:32,654 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 29 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:32,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 297 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:26:32,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-23 07:26:32,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-23 07:26:32,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 39 states have internal predecessors, (50), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-11-23 07:26:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2023-11-23 07:26:32,675 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 25 [2023-11-23 07:26:32,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:32,676 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2023-11-23 07:26:32,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 07:26:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2023-11-23 07:26:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 07:26:32,677 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:32,677 INFO L195 NwaCegarLoop]: trace histogram [1, 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:26:32,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 07:26:32,678 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:32,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:32,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1194390185, now seen corresponding path program 1 times [2023-11-23 07:26:32,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:32,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670747870] [2023-11-23 07:26:32,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:32,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:32,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:26:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:32,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:26:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:33,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:33,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670747870] [2023-11-23 07:26:33,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670747870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:33,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:26:33,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 07:26:33,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780572571] [2023-11-23 07:26:33,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:33,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:26:33,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:33,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:26:33,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:26:33,085 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 07:26:33,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:33,324 INFO L93 Difference]: Finished difference Result 136 states and 184 transitions. [2023-11-23 07:26:33,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 07:26:33,325 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-11-23 07:26:33,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:33,326 INFO L225 Difference]: With dead ends: 136 [2023-11-23 07:26:33,326 INFO L226 Difference]: Without dead ends: 87 [2023-11-23 07:26:33,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:26:33,328 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 97 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:33,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 401 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:26:33,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-23 07:26:33,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2023-11-23 07:26:33,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.42) internal successors, (71), 52 states have internal predecessors, (71), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-11-23 07:26:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2023-11-23 07:26:33,336 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 25 [2023-11-23 07:26:33,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:33,336 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2023-11-23 07:26:33,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 07:26:33,337 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2023-11-23 07:26:33,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 07:26:33,337 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:33,337 INFO L195 NwaCegarLoop]: trace histogram [1, 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:26:33,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 07:26:33,338 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:33,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:33,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1587417195, now seen corresponding path program 1 times [2023-11-23 07:26:33,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:33,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990280999] [2023-11-23 07:26:33,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:33,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:33,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:26:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:33,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:26:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:33,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:33,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990280999] [2023-11-23 07:26:33,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990280999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:33,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:26:33,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 07:26:33,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802756126] [2023-11-23 07:26:33,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:33,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:26:33,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:33,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:26:33,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:26:33,769 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 07:26:33,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:33,974 INFO L93 Difference]: Finished difference Result 158 states and 220 transitions. [2023-11-23 07:26:33,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:26:33,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-11-23 07:26:33,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:33,976 INFO L225 Difference]: With dead ends: 158 [2023-11-23 07:26:33,977 INFO L226 Difference]: Without dead ends: 95 [2023-11-23 07:26:33,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:26:33,978 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 67 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:33,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 349 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:26:33,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-23 07:26:33,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 75. [2023-11-23 07:26:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 58 states have internal predecessors, (80), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-11-23 07:26:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2023-11-23 07:26:33,987 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 25 [2023-11-23 07:26:33,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:33,988 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2023-11-23 07:26:33,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 07:26:33,988 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2023-11-23 07:26:33,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 07:26:33,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:33,989 INFO L195 NwaCegarLoop]: trace histogram [1, 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:26:33,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 07:26:33,989 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:33,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:33,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1329251757, now seen corresponding path program 1 times [2023-11-23 07:26:33,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:33,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633244695] [2023-11-23 07:26:33,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:33,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:34,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:26:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:34,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:26:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:34,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:34,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633244695] [2023-11-23 07:26:34,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633244695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:34,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:26:34,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 07:26:34,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761271765] [2023-11-23 07:26:34,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:34,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:26:34,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:34,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:26:34,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:26:34,308 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 07:26:34,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:34,509 INFO L93 Difference]: Finished difference Result 173 states and 244 transitions. [2023-11-23 07:26:34,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 07:26:34,509 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-11-23 07:26:34,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:34,510 INFO L225 Difference]: With dead ends: 173 [2023-11-23 07:26:34,510 INFO L226 Difference]: Without dead ends: 104 [2023-11-23 07:26:34,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:26:34,512 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 48 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:34,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 410 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:26:34,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-23 07:26:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2023-11-23 07:26:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 58 states have internal predecessors, (80), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-11-23 07:26:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2023-11-23 07:26:34,519 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 25 [2023-11-23 07:26:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:34,519 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2023-11-23 07:26:34,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 07:26:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2023-11-23 07:26:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 07:26:34,520 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:34,520 INFO L195 NwaCegarLoop]: trace histogram [1, 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:26:34,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 07:26:34,521 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:34,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2089459861, now seen corresponding path program 1 times [2023-11-23 07:26:34,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:34,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986508742] [2023-11-23 07:26:34,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:34,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:34,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:26:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:34,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:26:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:34,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:34,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:34,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986508742] [2023-11-23 07:26:34,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986508742] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:34,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:26:34,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 07:26:34,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028522136] [2023-11-23 07:26:34,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:34,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:26:34,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:34,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:26:34,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:26:34,584 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 07:26:34,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:34,610 INFO L93 Difference]: Finished difference Result 146 states and 203 transitions. [2023-11-23 07:26:34,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:26:34,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-23 07:26:34,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:34,611 INFO L225 Difference]: With dead ends: 146 [2023-11-23 07:26:34,611 INFO L226 Difference]: Without dead ends: 77 [2023-11-23 07:26:34,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:26:34,612 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 14 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:34,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 193 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:26:34,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-23 07:26:34,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2023-11-23 07:26:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 56 states have internal predecessors, (76), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-11-23 07:26:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2023-11-23 07:26:34,619 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 25 [2023-11-23 07:26:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:34,619 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2023-11-23 07:26:34,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 07:26:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2023-11-23 07:26:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 07:26:34,620 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:34,620 INFO L195 NwaCegarLoop]: trace histogram [1, 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:26:34,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 07:26:34,620 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:34,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:34,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1947341997, now seen corresponding path program 1 times [2023-11-23 07:26:34,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:34,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308722280] [2023-11-23 07:26:34,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:34,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:34,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:26:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:34,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:26:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:34,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:34,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308722280] [2023-11-23 07:26:34,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308722280] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:34,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:26:34,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 07:26:34,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015535965] [2023-11-23 07:26:34,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:34,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:26:34,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:34,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:26:34,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:26:34,725 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 07:26:34,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:34,756 INFO L93 Difference]: Finished difference Result 145 states and 200 transitions. [2023-11-23 07:26:34,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:26:34,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-23 07:26:34,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:34,758 INFO L225 Difference]: With dead ends: 145 [2023-11-23 07:26:34,759 INFO L226 Difference]: Without dead ends: 78 [2023-11-23 07:26:34,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:26:34,760 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 8 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:34,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 184 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:26:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-23 07:26:34,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2023-11-23 07:26:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 56 states have internal predecessors, (74), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-11-23 07:26:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2023-11-23 07:26:34,771 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 25 [2023-11-23 07:26:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:34,771 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2023-11-23 07:26:34,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 07:26:34,771 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2023-11-23 07:26:34,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 07:26:34,775 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:34,776 INFO L195 NwaCegarLoop]: trace histogram [1, 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:26:34,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 07:26:34,776 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:34,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:34,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1954598289, now seen corresponding path program 1 times [2023-11-23 07:26:34,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:34,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584115736] [2023-11-23 07:26:34,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:34,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:34,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:26:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:34,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:26:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:34,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:34,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584115736] [2023-11-23 07:26:34,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584115736] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:34,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:26:34,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 07:26:34,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970761910] [2023-11-23 07:26:34,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:34,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:26:34,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:34,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:26:34,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:26:34,885 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 07:26:34,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:34,947 INFO L93 Difference]: Finished difference Result 152 states and 203 transitions. [2023-11-23 07:26:34,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:26:34,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-23 07:26:34,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:34,948 INFO L225 Difference]: With dead ends: 152 [2023-11-23 07:26:34,948 INFO L226 Difference]: Without dead ends: 66 [2023-11-23 07:26:34,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:26:34,949 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 18 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:34,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 397 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:26:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-23 07:26:34,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-11-23 07:26:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 49 states have internal predecessors, (64), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-11-23 07:26:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2023-11-23 07:26:34,954 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 25 [2023-11-23 07:26:34,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:34,954 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2023-11-23 07:26:34,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 07:26:34,954 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2023-11-23 07:26:34,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-23 07:26:34,954 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:34,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 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:26:34,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 07:26:34,955 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:34,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:34,955 INFO L85 PathProgramCache]: Analyzing trace with hash 133984565, now seen corresponding path program 1 times [2023-11-23 07:26:34,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:34,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183916699] [2023-11-23 07:26:34,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:34,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:35,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:26:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:35,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:26:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:35,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:35,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:35,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183916699] [2023-11-23 07:26:35,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183916699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:35,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:26:35,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 07:26:35,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292761325] [2023-11-23 07:26:35,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:35,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 07:26:35,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:35,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 07:26:35,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:26:35,123 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 07:26:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:35,246 INFO L93 Difference]: Finished difference Result 132 states and 171 transitions. [2023-11-23 07:26:35,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:26:35,247 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2023-11-23 07:26:35,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:35,247 INFO L225 Difference]: With dead ends: 132 [2023-11-23 07:26:35,247 INFO L226 Difference]: Without dead ends: 66 [2023-11-23 07:26:35,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:26:35,248 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 32 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:35,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 291 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:26:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-23 07:26:35,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-11-23 07:26:35,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 49 states have internal predecessors, (62), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-11-23 07:26:35,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2023-11-23 07:26:35,252 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 27 [2023-11-23 07:26:35,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:35,252 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2023-11-23 07:26:35,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 07:26:35,252 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2023-11-23 07:26:35,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-23 07:26:35,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:35,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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:26:35,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 07:26:35,253 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:35,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:35,253 INFO L85 PathProgramCache]: Analyzing trace with hash 652102594, now seen corresponding path program 1 times [2023-11-23 07:26:35,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:35,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698230203] [2023-11-23 07:26:35,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:35,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:35,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:26:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:35,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:26:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:35,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:35,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:35,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698230203] [2023-11-23 07:26:35,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698230203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:35,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:26:35,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 07:26:35,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454706512] [2023-11-23 07:26:35,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:35,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:26:35,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:35,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:26:35,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 07:26:35,347 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 07:26:35,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:35,386 INFO L93 Difference]: Finished difference Result 132 states and 171 transitions. [2023-11-23 07:26:35,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:26:35,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-11-23 07:26:35,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:35,387 INFO L225 Difference]: With dead ends: 132 [2023-11-23 07:26:35,387 INFO L226 Difference]: Without dead ends: 72 [2023-11-23 07:26:35,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:26:35,388 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 11 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:35,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 245 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:26:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-23 07:26:35,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2023-11-23 07:26:35,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 51 states have internal predecessors, (64), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-11-23 07:26:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2023-11-23 07:26:35,393 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 29 [2023-11-23 07:26:35,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:35,393 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2023-11-23 07:26:35,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 07:26:35,394 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2023-11-23 07:26:35,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-23 07:26:35,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:35,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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:26:35,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 07:26:35,394 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:35,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:35,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1663723829, now seen corresponding path program 1 times [2023-11-23 07:26:35,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:35,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112407428] [2023-11-23 07:26:35,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:35,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:35,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:26:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:35,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:26:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:35,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:35,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:35,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112407428] [2023-11-23 07:26:35,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112407428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:35,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:26:35,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 07:26:35,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332328951] [2023-11-23 07:26:35,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:35,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:26:35,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:35,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:26:35,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 07:26:35,502 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 07:26:35,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:35,546 INFO L93 Difference]: Finished difference Result 138 states and 181 transitions. [2023-11-23 07:26:35,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:26:35,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-23 07:26:35,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:35,548 INFO L225 Difference]: With dead ends: 138 [2023-11-23 07:26:35,548 INFO L226 Difference]: Without dead ends: 76 [2023-11-23 07:26:35,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:26:35,549 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 8 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:35,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 251 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:26:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-23 07:26:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2023-11-23 07:26:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 53 states have internal predecessors, (66), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-11-23 07:26:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2023-11-23 07:26:35,555 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 30 [2023-11-23 07:26:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:35,556 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2023-11-23 07:26:35,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 07:26:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2023-11-23 07:26:35,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-23 07:26:35,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:35,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:35,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 07:26:35,557 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:35,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:35,557 INFO L85 PathProgramCache]: Analyzing trace with hash 853391152, now seen corresponding path program 1 times [2023-11-23 07:26:35,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:35,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082082689] [2023-11-23 07:26:35,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:35,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:36,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:26:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:36,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:26:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:36,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:36,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:36,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082082689] [2023-11-23 07:26:36,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082082689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:36,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:26:36,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-23 07:26:36,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527283967] [2023-11-23 07:26:36,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:36,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 07:26:36,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:36,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 07:26:36,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:26:36,568 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 07:26:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:36,956 INFO L93 Difference]: Finished difference Result 150 states and 194 transitions. [2023-11-23 07:26:36,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 07:26:36,956 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2023-11-23 07:26:36,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:36,957 INFO L225 Difference]: With dead ends: 150 [2023-11-23 07:26:36,957 INFO L226 Difference]: Without dead ends: 86 [2023-11-23 07:26:36,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2023-11-23 07:26:36,958 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 52 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:36,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 424 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:26:36,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-23 07:26:36,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2023-11-23 07:26:36,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 56 states have internal predecessors, (69), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2023-11-23 07:26:36,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2023-11-23 07:26:36,965 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 37 [2023-11-23 07:26:36,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:36,965 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2023-11-23 07:26:36,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 07:26:36,966 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2023-11-23 07:26:36,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-23 07:26:36,966 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:36,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:36,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 07:26:36,967 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:36,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:36,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1554455730, now seen corresponding path program 1 times [2023-11-23 07:26:36,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:36,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945828824] [2023-11-23 07:26:36,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:36,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:37,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:26:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:37,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:26:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:37,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:37,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:37,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945828824] [2023-11-23 07:26:37,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945828824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:37,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:26:37,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-23 07:26:37,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947239281] [2023-11-23 07:26:37,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:37,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 07:26:37,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:37,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 07:26:37,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:26:37,428 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 07:26:37,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:37,675 INFO L93 Difference]: Finished difference Result 172 states and 237 transitions. [2023-11-23 07:26:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 07:26:37,675 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2023-11-23 07:26:37,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:37,676 INFO L225 Difference]: With dead ends: 172 [2023-11-23 07:26:37,676 INFO L226 Difference]: Without dead ends: 104 [2023-11-23 07:26:37,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2023-11-23 07:26:37,677 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 60 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:37,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 425 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:26:37,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-23 07:26:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 78. [2023-11-23 07:26:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 60 states have internal predecessors, (73), 12 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2023-11-23 07:26:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2023-11-23 07:26:37,683 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 37 [2023-11-23 07:26:37,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:37,683 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2023-11-23 07:26:37,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 07:26:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2023-11-23 07:26:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-23 07:26:37,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:37,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:37,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 07:26:37,687 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:37,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:37,687 INFO L85 PathProgramCache]: Analyzing trace with hash 967649716, now seen corresponding path program 1 times [2023-11-23 07:26:37,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:37,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886939480] [2023-11-23 07:26:37,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:37,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:37,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:26:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:37,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:26:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:37,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:37,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:37,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886939480] [2023-11-23 07:26:37,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886939480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:37,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:26:37,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 07:26:37,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711138774] [2023-11-23 07:26:37,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:37,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:26:37,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:37,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:26:37,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:26:37,871 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 07:26:38,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:38,046 INFO L93 Difference]: Finished difference Result 172 states and 243 transitions. [2023-11-23 07:26:38,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:26:38,047 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2023-11-23 07:26:38,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:38,048 INFO L225 Difference]: With dead ends: 172 [2023-11-23 07:26:38,048 INFO L226 Difference]: Without dead ends: 83 [2023-11-23 07:26:38,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:26:38,049 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 46 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:38,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 461 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:26:38,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-23 07:26:38,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2023-11-23 07:26:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 61 states have internal predecessors, (73), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2023-11-23 07:26:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 105 transitions. [2023-11-23 07:26:38,059 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 105 transitions. Word has length 37 [2023-11-23 07:26:38,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:38,059 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 105 transitions. [2023-11-23 07:26:38,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 07:26:38,060 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 105 transitions. [2023-11-23 07:26:38,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-23 07:26:38,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:38,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:38,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 07:26:38,061 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:38,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:38,061 INFO L85 PathProgramCache]: Analyzing trace with hash 512098045, now seen corresponding path program 1 times [2023-11-23 07:26:38,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:38,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328563898] [2023-11-23 07:26:38,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:38,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:38,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:26:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:38,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:26:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:38,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:38,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:38,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:38,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328563898] [2023-11-23 07:26:38,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328563898] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:38,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928218311] [2023-11-23 07:26:38,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:38,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:38,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:38,401 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:26:38,429 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:26:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:38,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-23 07:26:38,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:38,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2023-11-23 07:26:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:39,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:26:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:26:39,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928218311] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:26:39,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:26:39,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 30 [2023-11-23 07:26:39,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193834081] [2023-11-23 07:26:39,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:26:39,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-23 07:26:39,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:39,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-23 07:26:39,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2023-11-23 07:26:39,388 INFO L87 Difference]: Start difference. First operand 79 states and 105 transitions. Second operand has 30 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 27 states have internal predecessors, (76), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-23 07:26:41,403 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:26:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:41,994 INFO L93 Difference]: Finished difference Result 178 states and 241 transitions. [2023-11-23 07:26:41,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 07:26:41,995 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 27 states have internal predecessors, (76), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Word has length 39 [2023-11-23 07:26:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:41,995 INFO L225 Difference]: With dead ends: 178 [2023-11-23 07:26:41,995 INFO L226 Difference]: Without dead ends: 105 [2023-11-23 07:26:41,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=1222, Unknown=0, NotChecked=0, Total=1406 [2023-11-23 07:26:41,997 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 175 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:41,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 739 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 617 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2023-11-23 07:26:41,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-23 07:26:42,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2023-11-23 07:26:42,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.3) internal successors, (78), 65 states have internal predecessors, (78), 13 states have call successors, (13), 7 states have call predecessors, (13), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2023-11-23 07:26:42,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2023-11-23 07:26:42,007 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 39 [2023-11-23 07:26:42,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:42,008 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2023-11-23 07:26:42,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 27 states have internal predecessors, (76), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-23 07:26:42,008 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2023-11-23 07:26:42,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-23 07:26:42,008 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:42,009 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:26:42,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:42,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-23 07:26:42,210 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:42,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:42,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1618550106, now seen corresponding path program 1 times [2023-11-23 07:26:42,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:42,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491734429] [2023-11-23 07:26:42,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:42,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:42,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:26:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:42,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:26:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:42,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 07:26:42,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:42,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491734429] [2023-11-23 07:26:42,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491734429] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:42,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:26:42,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 07:26:42,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383750037] [2023-11-23 07:26:42,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:42,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 07:26:42,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:42,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 07:26:42,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:26:42,355 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 07:26:42,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:42,407 INFO L93 Difference]: Finished difference Result 100 states and 127 transitions. [2023-11-23 07:26:42,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 07:26:42,407 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-11-23 07:26:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:42,408 INFO L225 Difference]: With dead ends: 100 [2023-11-23 07:26:42,408 INFO L226 Difference]: Without dead ends: 98 [2023-11-23 07:26:42,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:26:42,409 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 8 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:42,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 397 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:26:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-23 07:26:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2023-11-23 07:26:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 72 states have internal predecessors, (84), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (22), 12 states have call predecessors, (22), 13 states have call successors, (22) [2023-11-23 07:26:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 120 transitions. [2023-11-23 07:26:42,420 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 120 transitions. Word has length 40 [2023-11-23 07:26:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:42,421 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 120 transitions. [2023-11-23 07:26:42,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 07:26:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2023-11-23 07:26:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-23 07:26:42,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:42,422 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:42,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 07:26:42,422 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:42,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:42,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1729626261, now seen corresponding path program 1 times [2023-11-23 07:26:42,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:42,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482328862] [2023-11-23 07:26:42,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:42,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:42,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:26:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:42,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:26:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:42,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:42,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:26:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:26:43,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:43,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482328862] [2023-11-23 07:26:43,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482328862] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:43,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904566065] [2023-11-23 07:26:43,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:43,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:43,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:43,111 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:26:43,139 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:26:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-23 07:26:43,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:43,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 7 [2023-11-23 07:26:43,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 7 [2023-11-23 07:27:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:27:04,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:27:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 07:27:05,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904566065] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:27:05,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:27:05,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 10] total 38 [2023-11-23 07:27:05,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470033989] [2023-11-23 07:27:05,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:27:05,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-23 07:27:05,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:05,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-23 07:27:05,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1257, Unknown=10, NotChecked=0, Total=1406 [2023-11-23 07:27:05,305 INFO L87 Difference]: Start difference. First operand 93 states and 120 transitions. Second operand has 38 states, 32 states have (on average 2.8125) internal successors, (90), 33 states have internal predecessors, (90), 13 states have call successors, (14), 5 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 07:27:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:07,061 INFO L93 Difference]: Finished difference Result 220 states and 305 transitions. [2023-11-23 07:27:07,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-23 07:27:07,062 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 32 states have (on average 2.8125) internal successors, (90), 33 states have internal predecessors, (90), 13 states have call successors, (14), 5 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Word has length 47 [2023-11-23 07:27:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:07,063 INFO L225 Difference]: With dead ends: 220 [2023-11-23 07:27:07,063 INFO L226 Difference]: Without dead ends: 137 [2023-11-23 07:27:07,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=530, Invalid=3620, Unknown=10, NotChecked=0, Total=4160 [2023-11-23 07:27:07,065 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 239 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:07,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 689 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 07:27:07,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-23 07:27:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2023-11-23 07:27:07,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 66 states have internal predecessors, (77), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2023-11-23 07:27:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2023-11-23 07:27:07,078 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 47 [2023-11-23 07:27:07,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:07,078 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2023-11-23 07:27:07,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 32 states have (on average 2.8125) internal successors, (90), 33 states have internal predecessors, (90), 13 states have call successors, (14), 5 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 07:27:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2023-11-23 07:27:07,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-23 07:27:07,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:07,079 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:07,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-23 07:27:07,291 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,SelfDestructingSolverStorable16 [2023-11-23 07:27:07,292 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:07,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:07,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2111806986, now seen corresponding path program 1 times [2023-11-23 07:27:07,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:07,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711478647] [2023-11-23 07:27:07,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:07,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 07:27:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 07:27:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 07:27:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:27:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 07:27:07,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:07,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711478647] [2023-11-23 07:27:07,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711478647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:07,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:07,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 07:27:07,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768166012] [2023-11-23 07:27:07,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:07,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:27:07,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:07,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:27:07,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:27:07,791 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand has 11 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 07:27:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:07,925 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2023-11-23 07:27:07,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 07:27:07,925 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2023-11-23 07:27:07,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:07,926 INFO L225 Difference]: With dead ends: 91 [2023-11-23 07:27:07,926 INFO L226 Difference]: Without dead ends: 87 [2023-11-23 07:27:07,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:27:07,927 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 11 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:07,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 508 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:27:07,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-23 07:27:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-23 07:27:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 67 states have internal predecessors, (78), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2023-11-23 07:27:07,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2023-11-23 07:27:07,936 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 55 [2023-11-23 07:27:07,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:07,936 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2023-11-23 07:27:07,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 07:27:07,936 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2023-11-23 07:27:07,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-23 07:27:07,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:07,937 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:27:07,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 07:27:07,937 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:07,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:07,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1089622941, now seen corresponding path program 1 times [2023-11-23 07:27:07,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:07,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484717707] [2023-11-23 07:27:07,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:07,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:08,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:08,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:08,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 07:27:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:08,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:08,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:27:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:08,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:27:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:08,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:08,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:27:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:08,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:27:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 07:27:09,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:09,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484717707] [2023-11-23 07:27:09,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484717707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:09,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:09,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-23 07:27:09,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308813889] [2023-11-23 07:27:09,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:09,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 07:27:09,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:09,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 07:27:09,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:27:09,067 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand has 14 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-23 07:27:09,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:09,641 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2023-11-23 07:27:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:27:09,641 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 74 [2023-11-23 07:27:09,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:09,643 INFO L225 Difference]: With dead ends: 95 [2023-11-23 07:27:09,643 INFO L226 Difference]: Without dead ends: 88 [2023-11-23 07:27:09,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2023-11-23 07:27:09,644 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:09,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 59 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:27:09,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-23 07:27:09,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-23 07:27:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.21875) internal successors, (78), 68 states have internal predecessors, (78), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2023-11-23 07:27:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2023-11-23 07:27:09,653 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 74 [2023-11-23 07:27:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:09,654 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2023-11-23 07:27:09,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-23 07:27:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2023-11-23 07:27:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-23 07:27:09,655 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:09,655 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:27:09,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 07:27:09,655 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:09,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:09,655 INFO L85 PathProgramCache]: Analyzing trace with hash 280276315, now seen corresponding path program 1 times [2023-11-23 07:27:09,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:09,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632322923] [2023-11-23 07:27:09,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:09,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:09,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:10,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:10,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 07:27:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:10,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:10,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:27:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:10,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:27:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:10,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:10,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:27:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:10,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:27:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:10,866 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 07:27:10,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:10,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632322923] [2023-11-23 07:27:10,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632322923] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:27:10,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676850690] [2023-11-23 07:27:10,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:10,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:27:10,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:27:10,867 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:27:10,920 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:27:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:11,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-23 07:27:11,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:11,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 1 [2023-11-23 07:27:13,108 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_2| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2| (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_2| 24)))) is different from true [2023-11-23 07:27:15,392 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_2| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2| (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_2| 24)))) (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_3| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_3| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_3|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_3| 24))))) is different from true [2023-11-23 07:27:17,465 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_4| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_4| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_4| (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_4|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_4| 24)))) (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_2| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2| (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_2| 24))))) is different from true [2023-11-23 07:27:19,559 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_2| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2| (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_2| 24)))) (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_5| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_5| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_5| (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_5|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_5| 24))))) is different from true [2023-11-23 07:27:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-11-23 07:27:20,167 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:27:20,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12870 treesize of output 12678 [2023-11-23 07:27:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 07:27:20,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676850690] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 07:27:20,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:27:20,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [22, 19] total 46 [2023-11-23 07:27:20,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758533189] [2023-11-23 07:27:20,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:20,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:27:20,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:20,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:27:20,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1612, Unknown=4, NotChecked=332, Total=2070 [2023-11-23 07:27:20,761 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand has 10 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2023-11-23 07:27:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:21,027 INFO L93 Difference]: Finished difference Result 106 states and 132 transitions. [2023-11-23 07:27:21,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:27:21,028 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 74 [2023-11-23 07:27:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:21,029 INFO L225 Difference]: With dead ends: 106 [2023-11-23 07:27:21,029 INFO L226 Difference]: Without dead ends: 88 [2023-11-23 07:27:21,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 133 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=145, Invalid=1937, Unknown=4, NotChecked=364, Total=2450 [2023-11-23 07:27:21,031 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 52 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:21,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 311 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:27:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-23 07:27:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-23 07:27:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.203125) internal successors, (77), 68 states have internal predecessors, (77), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2023-11-23 07:27:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2023-11-23 07:27:21,043 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 74 [2023-11-23 07:27:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:21,043 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2023-11-23 07:27:21,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2023-11-23 07:27:21,043 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2023-11-23 07:27:21,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-23 07:27:21,044 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:21,044 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:27:21,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-23 07:27:21,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:27:21,258 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:21,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:21,259 INFO L85 PathProgramCache]: Analyzing trace with hash -112750695, now seen corresponding path program 1 times [2023-11-23 07:27:21,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:21,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976980892] [2023-11-23 07:27:21,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:21,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:21,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:21,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:21,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 07:27:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:21,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:27:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:21,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:27:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:21,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:21,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:27:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:21,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:27:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 07:27:21,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:21,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976980892] [2023-11-23 07:27:21,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976980892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:21,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:21,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 07:27:21,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304555943] [2023-11-23 07:27:21,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:21,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 07:27:21,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:21,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 07:27:21,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:27:21,982 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. Second operand has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 8 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-23 07:27:22,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:22,595 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2023-11-23 07:27:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:27:22,596 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 8 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 74 [2023-11-23 07:27:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:22,600 INFO L225 Difference]: With dead ends: 109 [2023-11-23 07:27:22,600 INFO L226 Difference]: Without dead ends: 88 [2023-11-23 07:27:22,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2023-11-23 07:27:22,601 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 116 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:22,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 54 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:27:22,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-23 07:27:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-23 07:27:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.1875) internal successors, (76), 68 states have internal predecessors, (76), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2023-11-23 07:27:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2023-11-23 07:27:22,617 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 74 [2023-11-23 07:27:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:22,617 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2023-11-23 07:27:22,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 8 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-23 07:27:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2023-11-23 07:27:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-23 07:27:22,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:22,618 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:27:22,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-23 07:27:22,619 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:22,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:22,619 INFO L85 PathProgramCache]: Analyzing trace with hash 145414743, now seen corresponding path program 1 times [2023-11-23 07:27:22,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:22,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655473521] [2023-11-23 07:27:22,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:22,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:22,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:22,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 07:27:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:23,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:23,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:27:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:23,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:27:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:23,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:23,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:27:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:23,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:27:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 07:27:23,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:23,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655473521] [2023-11-23 07:27:23,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655473521] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:27:23,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497812900] [2023-11-23 07:27:23,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:23,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:27:23,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:27:23,238 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:27:23,239 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:27:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:23,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-23 07:27:23,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:25,585 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_13| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_13| Int)) (<= (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_13| 16) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_13|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_13|))) is different from true [2023-11-23 07:27:27,626 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_14| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_14| Int)) (<= (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_14| 16) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_14|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_14|))) is different from true [2023-11-23 07:27:29,674 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_15| Int) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_15| Int)) (<= (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_15| 16) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_15|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_15|))) is different from true [2023-11-23 07:27:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-23 07:27:29,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:27:30,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-23 07:27:30,319 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-23 07:27:30,319 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 17 treesize of output 16 [2023-11-23 07:27:30,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:27:30,436 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 17 treesize of output 20 [2023-11-23 07:27:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 07:27:30,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497812900] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:27:30,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:27:30,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 15] total 42 [2023-11-23 07:27:30,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381796944] [2023-11-23 07:27:30,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:27:30,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-23 07:27:30,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:30,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-23 07:27:30,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1363, Unknown=3, NotChecked=228, Total=1722 [2023-11-23 07:27:30,615 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 42 states, 37 states have (on average 3.081081081081081) internal successors, (114), 37 states have internal predecessors, (114), 16 states have call successors, (25), 7 states have call predecessors, (25), 13 states have return successors, (25), 14 states have call predecessors, (25), 15 states have call successors, (25) [2023-11-23 07:27:32,632 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:27:34,819 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:27:36,825 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:27:51,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:51,984 INFO L93 Difference]: Finished difference Result 197 states and 265 transitions. [2023-11-23 07:27:51,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-23 07:27:51,984 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 37 states have (on average 3.081081081081081) internal successors, (114), 37 states have internal predecessors, (114), 16 states have call successors, (25), 7 states have call predecessors, (25), 13 states have return successors, (25), 14 states have call predecessors, (25), 15 states have call successors, (25) Word has length 74 [2023-11-23 07:27:51,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:51,985 INFO L225 Difference]: With dead ends: 197 [2023-11-23 07:27:51,985 INFO L226 Difference]: Without dead ends: 114 [2023-11-23 07:27:51,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 134 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=814, Invalid=3885, Unknown=5, NotChecked=408, Total=5112 [2023-11-23 07:27:51,986 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 460 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 2692 mSolverCounterSat, 111 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 3411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2692 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 605 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:51,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 119 Invalid, 3411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2692 Invalid, 3 Unknown, 605 Unchecked, 7.6s Time] [2023-11-23 07:27:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-23 07:27:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2023-11-23 07:27:51,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.095890410958904) internal successors, (80), 74 states have internal predecessors, (80), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-23 07:27:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2023-11-23 07:27:51,998 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 74 [2023-11-23 07:27:51,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:51,998 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2023-11-23 07:27:51,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 37 states have (on average 3.081081081081081) internal successors, (114), 37 states have internal predecessors, (114), 16 states have call successors, (25), 7 states have call predecessors, (25), 13 states have return successors, (25), 14 states have call predecessors, (25), 15 states have call successors, (25) [2023-11-23 07:27:51,999 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2023-11-23 07:27:51,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-23 07:27:51,999 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:51,999 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:27:52,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 07:27:52,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:27:52,211 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:52,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2086956748, now seen corresponding path program 1 times [2023-11-23 07:27:52,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:52,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571160076] [2023-11-23 07:27:52,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:52,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:52,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:53,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:53,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 07:27:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:53,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:53,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:27:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:53,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:27:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:53,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:53,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:27:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:53,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:27:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:53,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:27:53,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:53,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571160076] [2023-11-23 07:27:53,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571160076] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:27:53,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410755741] [2023-11-23 07:27:53,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:53,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:27:53,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:27:53,692 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:27:53,693 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:27:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:53,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 136 conjunts are in the unsatisfiable core [2023-11-23 07:27:53,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:53,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:53,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:53,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:53,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 19 [2023-11-23 07:27:53,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:53,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:53,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:53,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 9 [2023-11-23 07:27:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 07:27:57,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:28:21,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410755741] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:21,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:28:21,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 33] total 48 [2023-11-23 07:28:21,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508253528] [2023-11-23 07:28:21,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 07:28:21,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-23 07:28:21,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:21,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-23 07:28:21,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=3281, Unknown=6, NotChecked=0, Total=3540 [2023-11-23 07:28:21,424 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 48 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 39 states have internal predecessors, (99), 15 states have call successors, (19), 6 states have call predecessors, (19), 14 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19) [2023-11-23 07:28:29,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:29,343 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2023-11-23 07:28:29,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-23 07:28:29,344 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 39 states have internal predecessors, (99), 15 states have call successors, (19), 6 states have call predecessors, (19), 14 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19) Word has length 86 [2023-11-23 07:28:29,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:29,344 INFO L225 Difference]: With dead ends: 123 [2023-11-23 07:28:29,344 INFO L226 Difference]: Without dead ends: 114 [2023-11-23 07:28:29,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2168 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=859, Invalid=8641, Unknown=6, NotChecked=0, Total=9506 [2023-11-23 07:28:29,346 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 221 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 3116 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 3183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:29,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 138 Invalid, 3183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3116 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-23 07:28:29,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-23 07:28:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2023-11-23 07:28:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 77 states have internal predecessors, (84), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2023-11-23 07:28:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2023-11-23 07:28:29,366 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 86 [2023-11-23 07:28:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:29,367 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2023-11-23 07:28:29,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 39 states have internal predecessors, (99), 15 states have call successors, (19), 6 states have call predecessors, (19), 14 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19) [2023-11-23 07:28:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2023-11-23 07:28:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-23 07:28:29,369 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:29,369 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:29,384 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:28:29,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-23 07:28:29,583 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:29,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:29,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1385892170, now seen corresponding path program 1 times [2023-11-23 07:28:29,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:29,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869506015] [2023-11-23 07:28:29,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:29,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:29,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:29,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:29,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 07:28:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:28:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:28:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:28:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:28:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:28:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:28:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 07:28:30,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:30,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869506015] [2023-11-23 07:28:30,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869506015] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:30,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247403362] [2023-11-23 07:28:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:30,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:30,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:30,292 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:28:30,331 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:28:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-23 07:28:30,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:30,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:30,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:30,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:30,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 9 [2023-11-23 07:28:49,156 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 07:28:49,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:28:54,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 380 treesize of output 376 [2023-11-23 07:28:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 07:28:55,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247403362] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:55,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:28:55,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [19, 19] total 46 [2023-11-23 07:28:55,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561992803] [2023-11-23 07:28:55,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:55,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 07:28:55,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:55,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 07:28:55,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1895, Unknown=1, NotChecked=0, Total=2070 [2023-11-23 07:28:55,012 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2023-11-23 07:28:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:58,360 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2023-11-23 07:28:58,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 07:28:58,361 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 86 [2023-11-23 07:28:58,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:58,361 INFO L225 Difference]: With dead ends: 116 [2023-11-23 07:28:58,361 INFO L226 Difference]: Without dead ends: 101 [2023-11-23 07:28:58,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 157 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=217, Invalid=2434, Unknown=1, NotChecked=0, Total=2652 [2023-11-23 07:28:58,363 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 45 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:58,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 357 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:28:58,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-23 07:28:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2023-11-23 07:28:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.08) internal successors, (81), 75 states have internal predecessors, (81), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-23 07:28:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2023-11-23 07:28:58,379 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 86 [2023-11-23 07:28:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:58,379 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2023-11-23 07:28:58,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2023-11-23 07:28:58,380 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2023-11-23 07:28:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-23 07:28:58,380 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:58,380 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:58,393 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:28:58,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:58,590 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:58,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:58,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1048459862, now seen corresponding path program 1 times [2023-11-23 07:28:58,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:58,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051712583] [2023-11-23 07:28:58,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:58,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 07:28:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:28:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:28:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:28:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:28:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:28:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:28:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-23 07:28:58,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:58,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051712583] [2023-11-23 07:28:58,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051712583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:58,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:28:58,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 07:28:58,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030467920] [2023-11-23 07:28:58,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:58,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 07:28:58,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:58,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 07:28:58,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:28:58,799 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-23 07:28:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:59,153 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2023-11-23 07:28:59,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:28:59,154 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2023-11-23 07:28:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:59,155 INFO L225 Difference]: With dead ends: 108 [2023-11-23 07:28:59,155 INFO L226 Difference]: Without dead ends: 99 [2023-11-23 07:28:59,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:28:59,155 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 46 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:59,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 81 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:28:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-23 07:28:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-23 07:28:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-23 07:28:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2023-11-23 07:28:59,176 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 89 [2023-11-23 07:28:59,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:59,176 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2023-11-23 07:28:59,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-23 07:28:59,176 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2023-11-23 07:28:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-23 07:28:59,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:59,179 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:59,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-23 07:28:59,179 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:59,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1601858449, now seen corresponding path program 2 times [2023-11-23 07:28:59,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:59,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076413843] [2023-11-23 07:28:59,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:59,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:59,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:59,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 07:28:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:59,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:28:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:59,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:28:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:59,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:28:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:59,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:59,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:28:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:59,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:28:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:00,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:29:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:00,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:29:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 07:29:00,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:29:00,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076413843] [2023-11-23 07:29:00,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076413843] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:29:00,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124691871] [2023-11-23 07:29:00,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 07:29:00,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:29:00,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:29:00,228 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:29:00,229 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:29:00,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 07:29:00,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 07:29:00,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-23 07:29:00,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:29:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 07:29:19,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:29:20,254 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-23 07:29:20,255 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 28 treesize of output 27 [2023-11-23 07:29:20,260 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-23 07:29:20,261 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 22 treesize of output 14 [2023-11-23 07:29:20,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:29:20,329 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 28 treesize of output 31 [2023-11-23 07:29:20,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:29:20,341 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 22 treesize of output 25 [2023-11-23 07:29:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-23 07:29:20,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124691871] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:29:20,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:29:20,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 15] total 41 [2023-11-23 07:29:20,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612516104] [2023-11-23 07:29:20,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:29:20,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-23 07:29:20,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:29:20,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-23 07:29:20,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1481, Unknown=7, NotChecked=0, Total=1640 [2023-11-23 07:29:20,450 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 41 states, 36 states have (on average 3.4444444444444446) internal successors, (124), 37 states have internal predecessors, (124), 20 states have call successors, (29), 6 states have call predecessors, (29), 12 states have return successors, (28), 18 states have call predecessors, (28), 19 states have call successors, (28) [2023-11-23 07:29:22,464 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:29:24,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:29:28,531 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:29:30,560 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:29:33,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:29:35,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:29:39,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:29:39,772 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2023-11-23 07:29:39,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-23 07:29:39,772 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 36 states have (on average 3.4444444444444446) internal successors, (124), 37 states have internal predecessors, (124), 20 states have call successors, (29), 6 states have call predecessors, (29), 12 states have return successors, (28), 18 states have call predecessors, (28), 19 states have call successors, (28) Word has length 96 [2023-11-23 07:29:39,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:29:39,772 INFO L225 Difference]: With dead ends: 106 [2023-11-23 07:29:39,773 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 07:29:39,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 184 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=452, Invalid=3445, Unknown=9, NotChecked=0, Total=3906 [2023-11-23 07:29:39,774 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 120 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 31 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:29:39,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 112 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1836 Invalid, 6 Unknown, 0 Unchecked, 14.0s Time] [2023-11-23 07:29:39,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 07:29:39,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 07:29:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 07:29:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 07:29:39,775 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2023-11-23 07:29:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:29:39,775 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 07:29:39,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 36 states have (on average 3.4444444444444446) internal successors, (124), 37 states have internal predecessors, (124), 20 states have call successors, (29), 6 states have call predecessors, (29), 12 states have return successors, (28), 18 states have call predecessors, (28), 19 states have call successors, (28) [2023-11-23 07:29:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 07:29:39,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 07:29:39,777 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 07:29:39,790 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:29:39,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:29:39,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 07:29:47,218 WARN L293 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 274 DAG size of output: 353 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-23 07:30:11,497 WARN L293 SmtUtils]: Spent 19.90s on a formula simplification. DAG size of input: 380 DAG size of output: 90 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-23 07:30:32,012 WARN L293 SmtUtils]: Spent 20.12s on a formula simplification. DAG size of input: 194 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-23 07:30:47,971 WARN L293 SmtUtils]: Spent 15.90s on a formula simplification. DAG size of input: 418 DAG size of output: 88 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-23 07:30:48,015 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4715 4719) no Hoare annotation was computed. [2023-11-23 07:30:48,015 INFO L899 garLoopResultBuilder]: For program point L4718(line 4718) no Hoare annotation was computed. [2023-11-23 07:30:48,015 INFO L899 garLoopResultBuilder]: For program point L4718-3(line 4718) no Hoare annotation was computed. [2023-11-23 07:30:48,015 INFO L899 garLoopResultBuilder]: For program point L4718-2(line 4718) no Hoare annotation was computed. [2023-11-23 07:30:48,015 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4715 4719) the Hoare annotation is: true [2023-11-23 07:30:48,015 INFO L899 garLoopResultBuilder]: For program point L4718-5(line 4718) no Hoare annotation was computed. [2023-11-23 07:30:48,015 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-23 07:30:48,015 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-23 07:30:48,016 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-23 07:30:48,016 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-23 07:30:48,016 INFO L895 garLoopResultBuilder]: At program point L4780-1(line 4780) the Hoare annotation is: (or (let ((.cse0 (select |#memory_$Pointer$#2.offset| aws_linked_list_init_~list.base)) (.cse1 (select |#memory_$Pointer$#2.base| aws_linked_list_init_~list.base))) (and (= aws_linked_list_init_~list.offset 0) (= (select .cse0 16) 0) (= |aws_linked_list_init_#in~list.base| aws_linked_list_init_~list.base) (= (select .cse0 24) 0) (= (select .cse1 8) 0) (= (select .cse0 8) 0) (= (select .cse1 16) 0) (= (select .cse0 0) 16) (= (select .cse1 24) aws_linked_list_init_~list.base) (= aws_linked_list_init_~list.base (select .cse1 0)) (= |aws_linked_list_init_#t~ret326| 1))) (not (= |aws_linked_list_init_#in~list.offset| 0)) (< |aws_linked_list_init_#in~list.base| 2)) [2023-11-23 07:30:48,016 INFO L899 garLoopResultBuilder]: For program point L4781-2(line 4781) no Hoare annotation was computed. [2023-11-23 07:30:48,016 INFO L899 garLoopResultBuilder]: For program point L4780-2(line 4780) no Hoare annotation was computed. [2023-11-23 07:30:48,016 INFO L895 garLoopResultBuilder]: At program point L4781(line 4781) the Hoare annotation is: (or (not (= |aws_linked_list_init_#in~list.offset| 0)) (< |aws_linked_list_init_#in~list.base| 2) (let ((.cse0 (select |#memory_$Pointer$#2.offset| aws_linked_list_init_~list.base)) (.cse1 (select |#memory_$Pointer$#2.base| aws_linked_list_init_~list.base))) (and (= aws_linked_list_init_~list.offset 0) (= (select .cse0 16) 0) (= |aws_linked_list_init_#in~list.base| aws_linked_list_init_~list.base) (= (select .cse0 24) 0) (= (select .cse1 8) 0) (= (select .cse0 8) 0) (= (select .cse1 16) 0) (= (select .cse0 0) 16) (= (select .cse1 24) aws_linked_list_init_~list.base) (= aws_linked_list_init_~list.base (select .cse1 0))))) [2023-11-23 07:30:48,016 INFO L895 garLoopResultBuilder]: At program point L4780(line 4780) the Hoare annotation is: (or (not (= |aws_linked_list_init_#in~list.offset| 0)) (< |aws_linked_list_init_#in~list.base| 2) (let ((.cse0 (select |#memory_$Pointer$#2.offset| aws_linked_list_init_~list.base)) (.cse1 (select |#memory_$Pointer$#2.base| aws_linked_list_init_~list.base))) (and (= aws_linked_list_init_~list.offset 0) (= (select .cse0 16) 0) (= |aws_linked_list_init_#in~list.base| aws_linked_list_init_~list.base) (= (select .cse0 24) 0) (= (select .cse1 8) 0) (= (select .cse0 8) 0) (= (select .cse1 16) 0) (= (select .cse0 0) 16) (= (select .cse1 24) aws_linked_list_init_~list.base) (= aws_linked_list_init_~list.base (select .cse1 0))))) [2023-11-23 07:30:48,016 INFO L895 garLoopResultBuilder]: At program point L4781-1(line 4781) the Hoare annotation is: (or (not (= |aws_linked_list_init_#in~list.offset| 0)) (let ((.cse0 (select |#memory_$Pointer$#2.offset| aws_linked_list_init_~list.base)) (.cse1 (select |#memory_$Pointer$#2.base| aws_linked_list_init_~list.base))) (and (= |aws_linked_list_init_#t~ret327| 1) (= aws_linked_list_init_~list.offset 0) (= (select .cse0 16) 0) (= |aws_linked_list_init_#in~list.base| aws_linked_list_init_~list.base) (= (select .cse0 24) 0) (= (select .cse1 8) 0) (= (select .cse0 8) 0) (= (select .cse1 16) 0) (= (select .cse1 24) aws_linked_list_init_~list.base) (= 16 (select (select |#memory_$Pointer$#2.offset| |aws_linked_list_init_#in~list.base|) 0)) (= aws_linked_list_init_~list.base (select .cse1 0)))) (< |aws_linked_list_init_#in~list.base| 2)) [2023-11-23 07:30:48,016 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 4770 4782) the Hoare annotation is: (or (and (= |#memory_real#2| |old(#memory_real#2)|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_$Pointer$#0.base| |old(#memory_$Pointer$#0.base)|) (= |#memory_int#0| |old(#memory_int#0)|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |old(#memory_$Pointer$#0.offset)| |#memory_$Pointer$#0.offset|) (= |#memory_int#1| |old(#memory_int#1)|) (= |#memory_real#1| |old(#memory_real#1)|) (= |#memory_real#0| |old(#memory_real#0)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|)) (not (= |aws_linked_list_init_#in~list.offset| 0)) (< |aws_linked_list_init_#in~list.base| 2)) [2023-11-23 07:30:48,016 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_initEXIT(lines 4770 4782) no Hoare annotation was computed. [2023-11-23 07:30:48,016 INFO L895 garLoopResultBuilder]: At program point L4771(line 4771) the Hoare annotation is: (or (not (= |aws_linked_list_init_#in~list.offset| 0)) (< |aws_linked_list_init_#in~list.base| 2) (and (= |#memory_real#2| |old(#memory_real#2)|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= aws_linked_list_init_~list.offset 0) (= |aws_linked_list_init_#in~list.base| aws_linked_list_init_~list.base) (= |#memory_$Pointer$#0.base| |old(#memory_$Pointer$#0.base)|) (= |#memory_int#0| |old(#memory_int#0)|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |old(#memory_$Pointer$#0.offset)| |#memory_$Pointer$#0.offset|) (= |#memory_int#1| |old(#memory_int#1)|) (= |#memory_real#1| |old(#memory_real#1)|) (= |#memory_real#0| |old(#memory_real#0)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|))) [2023-11-23 07:30:48,016 INFO L899 garLoopResultBuilder]: For program point L4771-1(line 4771) no Hoare annotation was computed. [2023-11-23 07:30:48,016 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 07:30:48,016 INFO L895 garLoopResultBuilder]: At program point L7382(line 7382) the Hoare annotation is: (and (= |ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.offset| 0) (<= 2 |ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base|)) [2023-11-23 07:30:48,017 INFO L899 garLoopResultBuilder]: For program point L7385-1(line 7385) no Hoare annotation was computed. [2023-11-23 07:30:48,017 INFO L895 garLoopResultBuilder]: At program point L7385(line 7385) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base|)) (.cse0 (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base|))) (and (= (select .cse0 8) 0) (= |ULTIMATE.start_aws_linked_list_init_harness_#t~ret683#1| 1) (= (select .cse0 16) 0) (= (select .cse1 0) |ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base|) (= (select .cse1 8) 0) (= (select .cse0 24) 0) (= (select .cse1 16) 0) (= |ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.offset| 0) (= (select .cse1 24) |ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base|) (= 16 (select .cse0 0)) (<= 2 |ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base|))) [2023-11-23 07:30:48,017 INFO L895 garLoopResultBuilder]: At program point L7382-1(line 7382) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base|))) (let ((.cse0 (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base|)) (.cse1 (select .cse2 0))) (and (= (select .cse0 8) 0) (= .cse1 |ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base|) (= (select .cse2 8) 0) (= (select .cse0 24) 0) (= (select .cse2 16) 0) (= |ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.offset| 0) (= (select .cse2 24) |ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base|) (= 16 (select .cse0 0)) (= (select (select |#memory_$Pointer$#2.offset| .cse1) 16) 0) (<= 2 |ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base|)))) [2023-11-23 07:30:48,017 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 07:30:48,017 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-23 07:30:48,017 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-23 07:30:48,017 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-23 07:30:48,017 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-23 07:30:48,017 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-23 07:30:48,017 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-23 07:30:48,018 INFO L899 garLoopResultBuilder]: For program point L4734(lines 4734 4738) no Hoare annotation was computed. [2023-11-23 07:30:48,018 INFO L899 garLoopResultBuilder]: For program point L4751(lines 4751 4761) no Hoare annotation was computed. [2023-11-23 07:30:48,018 INFO L899 garLoopResultBuilder]: For program point L4694(line 4694) no Hoare annotation was computed. [2023-11-23 07:30:48,018 INFO L899 garLoopResultBuilder]: For program point L4694-3(lines 4694 4695) no Hoare annotation was computed. [2023-11-23 07:30:48,018 INFO L899 garLoopResultBuilder]: For program point L4756-1(lines 4756 4761) no Hoare annotation was computed. [2023-11-23 07:30:48,018 INFO L899 garLoopResultBuilder]: For program point L4694-2(line 4694) no Hoare annotation was computed. [2023-11-23 07:30:48,018 INFO L895 garLoopResultBuilder]: At program point L4756(line 4756) the Hoare annotation is: (let ((.cse12 (select (select |#memory_$Pointer$#2.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|))) (let ((.cse11 (select (select |#memory_$Pointer$#2.base| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (.cse13 (+ .cse12 8))) (let ((.cse0 (not (= (select (select |#memory_$Pointer$#2.offset| .cse11) .cse13) |aws_linked_list_is_valid_#in~list#1.offset|))) (.cse1 (not (= |aws_linked_list_is_valid_#in~list#1.base| (select (select |#memory_$Pointer$#2.base| .cse11) .cse13)))) (.cse3 (forall ((v_aws_linked_list_init_~list.base_BEFORE_CALL_6 Int)) (or (< v_aws_linked_list_init_~list.base_BEFORE_CALL_6 2) (not (= (select (select |#memory_$Pointer$#2.offset| v_aws_linked_list_init_~list.base_BEFORE_CALL_6) 0) 16)) (not (= (select (select |#memory_$Pointer$#2.base| v_aws_linked_list_init_~list.base_BEFORE_CALL_6) 0) v_aws_linked_list_init_~list.base_BEFORE_CALL_6))))) (.cse7 (not (= (+ 16 |aws_linked_list_is_valid_#in~list#1.offset|) .cse12))) (.cse6 (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|)) (.cse2 (= |aws_linked_list_is_valid_~list#1.offset| 0)) (.cse5 (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)) (.cse10 (not (= |aws_linked_list_is_valid_#in~list#1.base| .cse11)))) (and (let ((.cse4 (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|))) (or .cse0 .cse1 (and (= |aws_linked_list_is_valid_#in~list#1.base| 0) (or (= 0 |aws_linked_list_is_valid_~list#1.base|) (not .cse2))) .cse3 (and .cse4 .cse5 (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)) .cse6 (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| 0)) (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base| 0)))) .cse7 (forall ((|v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse8 (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10|)) (.cse9 (select |#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10|))) (or (not (= |v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse8 24))) (not (= (select .cse9 24) 0)) (not (= |v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse8 0))) (not (= 16 (select .cse9 0)))))) (and .cse4 .cse5 (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) .cse6 (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|)) .cse10)) (or .cse0 .cse1 .cse3 .cse7 .cse6 (and .cse2 .cse5) .cse10))))) [2023-11-23 07:30:48,018 INFO L899 garLoopResultBuilder]: For program point L4694-8(lines 4694 4696) no Hoare annotation was computed. [2023-11-23 07:30:48,018 INFO L899 garLoopResultBuilder]: For program point L4694-5(lines 4694 4695) no Hoare annotation was computed. [2023-11-23 07:30:48,018 INFO L899 garLoopResultBuilder]: For program point L4694-6(lines 4694 4696) no Hoare annotation was computed. [2023-11-23 07:30:48,019 INFO L899 garLoopResultBuilder]: For program point L4694-11(lines 4694 4704) no Hoare annotation was computed. [2023-11-23 07:30:48,019 INFO L899 garLoopResultBuilder]: For program point L4694-9(lines 4694 4697) no Hoare annotation was computed. [2023-11-23 07:30:48,019 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_is_validEXIT(lines 4691 4708) no Hoare annotation was computed. [2023-11-23 07:30:48,019 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_is_valid_deep_returnLabel#1(lines 4731 4765) no Hoare annotation was computed. [2023-11-23 07:30:48,019 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4691 4708) the Hoare annotation is: true [2023-11-23 07:30:48,019 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_is_validFINAL(lines 4691 4708) no Hoare annotation was computed. [2023-11-23 07:30:48,019 INFO L899 garLoopResultBuilder]: For program point L4750-3(lines 4750 4763) no Hoare annotation was computed. [2023-11-23 07:30:48,020 INFO L895 garLoopResultBuilder]: At program point L4750-2(lines 4750 4763) the Hoare annotation is: (let ((.cse13 (select (select |#memory_$Pointer$#2.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|))) (let ((.cse12 (select (select |#memory_$Pointer$#2.base| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (.cse14 (+ .cse13 8))) (let ((.cse0 (not (= (select (select |#memory_$Pointer$#2.offset| .cse12) .cse14) |aws_linked_list_is_valid_#in~list#1.offset|))) (.cse1 (not (= |aws_linked_list_is_valid_#in~list#1.base| (select (select |#memory_$Pointer$#2.base| .cse12) .cse14)))) (.cse5 (= |aws_linked_list_is_valid_~list#1.offset| 0)) (.cse2 (forall ((v_aws_linked_list_init_~list.base_BEFORE_CALL_6 Int)) (or (< v_aws_linked_list_init_~list.base_BEFORE_CALL_6 2) (not (= (select (select |#memory_$Pointer$#2.offset| v_aws_linked_list_init_~list.base_BEFORE_CALL_6) 0) 16)) (not (= (select (select |#memory_$Pointer$#2.base| v_aws_linked_list_init_~list.base_BEFORE_CALL_6) 0) v_aws_linked_list_init_~list.base_BEFORE_CALL_6))))) (.cse3 (not (= (+ 16 |aws_linked_list_is_valid_#in~list#1.offset|) .cse13))) (.cse6 (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)) (.cse4 (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|)) (.cse7 (not (= |aws_linked_list_is_valid_#in~list#1.base| .cse12)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6) .cse7) (let ((.cse9 (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|)) (.cse8 (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|))) (or .cse0 .cse1 (and (= |aws_linked_list_is_valid_#in~list#1.base| 0) (or (= 0 |aws_linked_list_is_valid_~list#1.base|) (not .cse5))) .cse2 (and (= (select (select |#memory_$Pointer$#2.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) .cse8 .cse6 .cse9 .cse4 (= (select (select |#memory_$Pointer$#2.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|)) (and .cse8 .cse6 .cse9 (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)) .cse4) .cse3 (forall ((|v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse10 (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10|)) (.cse11 (select |#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10|))) (or (not (= |v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse10 24))) (not (= (select .cse11 24) 0)) (not (= |v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10| (select .cse10 0))) (not (= 16 (select .cse11 0)))))) (and .cse8 .cse6 (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) .cse4 (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|)) .cse7)))))) [2023-11-23 07:30:48,020 INFO L899 garLoopResultBuilder]: For program point L4684-1(line 4684) no Hoare annotation was computed. [2023-11-23 07:30:48,020 INFO L895 garLoopResultBuilder]: At program point L4684(line 4684) the Hoare annotation is: (or (forall ((v_aws_linked_list_init_~list.base_BEFORE_CALL_6 Int)) (or (< v_aws_linked_list_init_~list.base_BEFORE_CALL_6 2) (not (= (select (select |#memory_$Pointer$#2.offset| v_aws_linked_list_init_~list.base_BEFORE_CALL_6) 0) 16)) (not (= (select (select |#memory_$Pointer$#2.base| v_aws_linked_list_init_~list.base_BEFORE_CALL_6) 0) v_aws_linked_list_init_~list.base_BEFORE_CALL_6)))) (forall ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_23| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_23| Int)) (let ((.cse1 (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_23| 24)) (.cse2 (select |#memory_$Pointer$#2.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_23|)) (.cse0 (select |#memory_$Pointer$#2.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_23|))) (or (not (= (select .cse0 .cse1) |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_23|)) (not (= |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_23| (select .cse2 .cse1))) (not (= (select .cse2 |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_23|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_23| 16))) (not (= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_23| (select .cse0 |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_23|)))))) (and (= |aws_linked_list_empty_#in~list.offset| aws_linked_list_empty_~list.offset) (= aws_linked_list_empty_~list.base |aws_linked_list_empty_#in~list.base|))) [2023-11-23 07:30:48,020 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_emptyEXIT(lines 4681 4686) no Hoare annotation was computed. [2023-11-23 07:30:48,020 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4681 4686) the Hoare annotation is: true [2023-11-23 07:30:48,023 INFO L445 BasicCegarLoop]: Path program histogram: [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] [2023-11-23 07:30:48,024 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 07:30:48,033 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#in~list!base][#in~list!offset]][#memory_$Pointer$#2.offset[#in~list!base][#in~list!offset] + 8] could not be translated [2023-11-23 07:30:48,034 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,035 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,035 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#in~list!base][#in~list!offset]][#memory_$Pointer$#2.offset[#in~list!base][#in~list!offset] + 8] could not be translated [2023-11-23 07:30:48,035 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_aws_linked_list_init_~list.base_BEFORE_CALL_6 : int :: (v_aws_linked_list_init_~list.base_BEFORE_CALL_6 < 2 || !(#memory_$Pointer$#2.offset[v_aws_linked_list_init_~list.base_BEFORE_CALL_6][0] == 16)) || !(#memory_$Pointer$#2.base[v_aws_linked_list_init_~list.base_BEFORE_CALL_6][0] == v_aws_linked_list_init_~list.base_BEFORE_CALL_6)) could not be translated [2023-11-23 07:30:48,037 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,037 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#in~list!base][#in~list!offset] could not be translated [2023-11-23 07:30:48,037 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,038 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,038 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,038 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,038 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,038 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,038 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#in~list!base][#in~list!offset] could not be translated [2023-11-23 07:30:48,038 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#in~list!base][#in~list!offset]][#memory_$Pointer$#2.offset[#in~list!base][#in~list!offset] + 8] could not be translated [2023-11-23 07:30:48,038 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,039 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,039 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#in~list!base][#in~list!offset]][#memory_$Pointer$#2.offset[#in~list!base][#in~list!offset] + 8] could not be translated [2023-11-23 07:30:48,039 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,039 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,039 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,039 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_aws_linked_list_init_~list.base_BEFORE_CALL_6 : int :: (v_aws_linked_list_init_~list.base_BEFORE_CALL_6 < 2 || !(#memory_$Pointer$#2.offset[v_aws_linked_list_init_~list.base_BEFORE_CALL_6][0] == 16)) || !(#memory_$Pointer$#2.base[v_aws_linked_list_init_~list.base_BEFORE_CALL_6][0] == v_aws_linked_list_init_~list.base_BEFORE_CALL_6)) could not be translated [2023-11-23 07:30:48,040 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~list!base][~list!offset] could not be translated [2023-11-23 07:30:48,040 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,040 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,040 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,040 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,040 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,040 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,041 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,041 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,041 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~list!base][~list!offset] could not be translated [2023-11-23 07:30:48,041 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,041 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,041 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,041 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,042 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,042 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,042 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,042 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,042 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,042 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,043 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#in~list!base][#in~list!offset] could not be translated [2023-11-23 07:30:48,043 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10 : int :: ((!(v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10 == #memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10][24]) || !(#memory_$Pointer$#2.offset[v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10][24] == 0)) || !(v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10 == #memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10][0])) || !(16 == #memory_$Pointer$#2.offset[v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10][0])) could not be translated [2023-11-23 07:30:48,043 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,044 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,044 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,044 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,044 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,044 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,044 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,044 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,045 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,045 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 07:30:48,045 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#in~list!base][#in~list!offset] could not be translated [2023-11-23 07:30:48,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 07:30:48 BoogieIcfgContainer [2023-11-23 07:30:48,046 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 07:30:48,046 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 07:30:48,046 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 07:30:48,046 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 07:30:48,047 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:26:31" (3/4) ... [2023-11-23 07:30:48,048 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 07:30:48,051 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2023-11-23 07:30:48,051 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-23 07:30:48,051 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-23 07:30:48,051 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_is_valid [2023-11-23 07:30:48,051 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_init [2023-11-23 07:30:48,051 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_empty [2023-11-23 07:30:48,054 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2023-11-23 07:30:48,054 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-23 07:30:48,055 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-23 07:30:48,055 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 07:30:48,118 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 07:30:48,119 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 07:30:48,119 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 07:30:48,119 INFO L158 Benchmark]: Toolchain (without parser) took 259370.83ms. Allocated memory was 192.9MB in the beginning and 796.9MB in the end (delta: 604.0MB). Free memory was 115.1MB in the beginning and 329.8MB in the end (delta: -214.7MB). Peak memory consumption was 391.2MB. Max. memory is 16.1GB. [2023-11-23 07:30:48,119 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory was 99.4MB in the beginning and 99.3MB in the end (delta: 73.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 07:30:48,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1557.07ms. Allocated memory is still 192.9MB. Free memory was 114.9MB in the beginning and 128.1MB in the end (delta: -13.2MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2023-11-23 07:30:48,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.03ms. Allocated memory is still 192.9MB. Free memory was 128.1MB in the beginning and 122.7MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 07:30:48,120 INFO L158 Benchmark]: Boogie Preprocessor took 83.48ms. Allocated memory is still 192.9MB. Free memory was 122.7MB in the beginning and 118.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 07:30:48,120 INFO L158 Benchmark]: RCFGBuilder took 592.34ms. Allocated memory is still 192.9MB. Free memory was 118.5MB in the beginning and 94.6MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-23 07:30:48,121 INFO L158 Benchmark]: TraceAbstraction took 256976.16ms. Allocated memory was 192.9MB in the beginning and 796.9MB in the end (delta: 604.0MB). Free memory was 94.6MB in the beginning and 336.1MB in the end (delta: -241.5MB). Peak memory consumption was 432.5MB. Max. memory is 16.1GB. [2023-11-23 07:30:48,123 INFO L158 Benchmark]: Witness Printer took 72.80ms. Allocated memory is still 796.9MB. Free memory was 336.1MB in the beginning and 329.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 07:30:48,126 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory was 99.4MB in the beginning and 99.3MB in the end (delta: 73.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1557.07ms. Allocated memory is still 192.9MB. Free memory was 114.9MB in the beginning and 128.1MB in the end (delta: -13.2MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.03ms. Allocated memory is still 192.9MB. Free memory was 128.1MB in the beginning and 122.7MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.48ms. Allocated memory is still 192.9MB. Free memory was 122.7MB in the beginning and 118.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 592.34ms. Allocated memory is still 192.9MB. Free memory was 118.5MB in the beginning and 94.6MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 256976.16ms. Allocated memory was 192.9MB in the beginning and 796.9MB in the end (delta: 604.0MB). Free memory was 94.6MB in the beginning and 336.1MB in the end (delta: -241.5MB). Peak memory consumption was 432.5MB. Max. memory is 16.1GB. * Witness Printer took 72.80ms. Allocated memory is still 796.9MB. Free memory was 336.1MB in the beginning and 329.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#in~list!base][#in~list!offset]][#memory_$Pointer$#2.offset[#in~list!base][#in~list!offset] + 8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#in~list!base][#in~list!offset]][#memory_$Pointer$#2.offset[#in~list!base][#in~list!offset] + 8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_aws_linked_list_init_~list.base_BEFORE_CALL_6 : int :: (v_aws_linked_list_init_~list.base_BEFORE_CALL_6 < 2 || !(#memory_$Pointer$#2.offset[v_aws_linked_list_init_~list.base_BEFORE_CALL_6][0] == 16)) || !(#memory_$Pointer$#2.base[v_aws_linked_list_init_~list.base_BEFORE_CALL_6][0] == v_aws_linked_list_init_~list.base_BEFORE_CALL_6)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#in~list!base][#in~list!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#in~list!base][#in~list!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#in~list!base][#in~list!offset]][#memory_$Pointer$#2.offset[#in~list!base][#in~list!offset] + 8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#in~list!base][#in~list!offset]][#memory_$Pointer$#2.offset[#in~list!base][#in~list!offset] + 8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_aws_linked_list_init_~list.base_BEFORE_CALL_6 : int :: (v_aws_linked_list_init_~list.base_BEFORE_CALL_6 < 2 || !(#memory_$Pointer$#2.offset[v_aws_linked_list_init_~list.base_BEFORE_CALL_6][0] == 16)) || !(#memory_$Pointer$#2.base[v_aws_linked_list_init_~list.base_BEFORE_CALL_6][0] == v_aws_linked_list_init_~list.base_BEFORE_CALL_6)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~list!base][~list!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~list!base][~list!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#in~list!base][#in~list!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10 : int :: ((!(v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10 == #memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10][24]) || !(#memory_$Pointer$#2.offset[v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10][24] == 0)) || !(v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10 == #memory_$Pointer$#2.base[v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10][0])) || !(16 == #memory_$Pointer$#2.offset[v_ULTIMATE.start_aws_linked_list_init_harness_~#list~0#1.base_BEFORE_CALL_10][0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~list!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#in~list!base][#in~list!offset] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 256.9s, OverallIterations: 26, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 60.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 68.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 2111 SdHoareTripleChecker+Valid, 30.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2053 mSDsluCounter, 7955 SdHoareTripleChecker+Invalid, 29.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 605 IncrementalHoareTripleChecker+Unchecked, 6764 mSDsCounter, 566 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13406 IncrementalHoareTripleChecker+Invalid, 14587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 566 mSolverCounterUnsat, 1191 mSDtfsCounter, 13406 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1659 GetRequests, 1001 SyntacticMatches, 24 SemanticMatches, 634 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 5944 ImplicationChecksByTransitivity, 136.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=23, InterpolantAutomatonStates: 354, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 237 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 231 PreInvPairs, 379 NumberOfFragments, 1126 HoareAnnotationTreeSize, 231 FomulaSimplifications, 668791 FormulaSimplificationTreeSizeReduction, 11.5s HoareSimplificationTime, 17 FomulaSimplificationsInter, 93944 FormulaSimplificationTreeSizeReductionInter, 56.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 124.3s InterpolantComputationTime, 1733 NumberOfCodeBlocks, 1733 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2110 ConstructedInterpolants, 340 QuantifiedInterpolants, 22844 SizeOfPredicates, 154 NumberOfNonLiveVariables, 2539 ConjunctsInSsa, 448 ConjunctsInUnsatCore, 39 InterpolantComputations, 21 PerfectInterpolantSequences, 486/667 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4750]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-23 07:30:48,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE