./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_byte_buf_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_byte_buf_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 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 06:54:39,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 06:54:39,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 06:54:39,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 06:54:39,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 06:54:40,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 06:54:40,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 06:54:40,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 06:54:40,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 06:54:40,026 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 06:54:40,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 06:54:40,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 06:54:40,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 06:54:40,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 06:54:40,029 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 06:54:40,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 06:54:40,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 06:54:40,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 06:54:40,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 06:54:40,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 06:54:40,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 06:54:40,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 06:54:40,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 06:54:40,032 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 06:54:40,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 06:54:40,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 06:54:40,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 06:54:40,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 06:54:40,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 06:54:40,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 06:54:40,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 06:54:40,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 06:54:40,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 06:54:40,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 06:54:40,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 06:54:40,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 06:54:40,039 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 06:54:40,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 06:54:40,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 06:54:40,052 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 -> 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 06:54:40,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 06:54:40,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 06:54:40,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 06:54:40,526 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 06:54:40,540 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 06:54:40,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_byte_buf_init_harness.i [2023-11-23 06:54:42,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 06:54:42,958 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 06:54:42,958 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_init_harness.i [2023-11-23 06:54:43,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662c212c0/89188cbf0aa94ec1ad19c357b59b3392/FLAG6d7aab653 [2023-11-23 06:54:43,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662c212c0/89188cbf0aa94ec1ad19c357b59b3392 [2023-11-23 06:54:43,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 06:54:43,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 06:54:43,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 06:54:43,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 06:54:43,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 06:54:43,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:54:43" (1/1) ... [2023-11-23 06:54:43,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33181cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:43, skipping insertion in model container [2023-11-23 06:54:43,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:54:43" (1/1) ... [2023-11-23 06:54:43,131 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 06:54:43,410 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_byte_buf_init_harness.i[4491,4504] [2023-11-23 06:54:43,418 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_byte_buf_init_harness.i[4551,4564] [2023-11-23 06:54:44,022 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,023 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,024 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,024 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,025 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,037 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,037 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,039 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,039 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,320 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 06:54:44,322 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 06:54:44,323 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 06:54:44,325 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 06:54:44,329 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 06:54:44,329 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 06:54:44,330 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 06:54:44,332 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 06:54:44,333 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 06:54:44,336 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 06:54:44,556 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,557 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,638 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 06:54:44,697 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 06:54:44,716 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_byte_buf_init_harness.i[4491,4504] [2023-11-23 06:54:44,717 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_byte_buf_init_harness.i[4551,4564] [2023-11-23 06:54:44,759 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,759 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,761 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,762 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,763 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,767 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,767 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,768 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,769 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,811 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 06:54:44,812 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 06:54:44,813 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 06:54:44,813 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 06:54:44,814 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 06:54:44,814 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 06:54:44,815 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 06:54:44,815 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 06:54:44,816 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 06:54:44,817 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 06:54:44,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8051] [2023-11-23 06:54:44,888 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,888 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:54:44,899 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8537-8548] [2023-11-23 06:54:44,922 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 06:54:45,138 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,138 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,138 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,138 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,138 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,138 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,139 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,139 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,139 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,139 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,139 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,139 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,139 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,139 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,139 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,139 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,139 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,139 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:54:45,148 INFO L206 MainTranslator]: Completed translation [2023-11-23 06:54:45,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:45 WrapperNode [2023-11-23 06:54:45,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 06:54:45,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 06:54:45,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 06:54:45,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 06:54:45,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:45" (1/1) ... [2023-11-23 06:54:45,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:45" (1/1) ... [2023-11-23 06:54:45,332 INFO L138 Inliner]: procedures = 689, calls = 2499, calls flagged for inlining = 54, calls inlined = 5, statements flattened = 777 [2023-11-23 06:54:45,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 06:54:45,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 06:54:45,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 06:54:45,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 06:54:45,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:45" (1/1) ... [2023-11-23 06:54:45,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:45" (1/1) ... [2023-11-23 06:54:45,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:45" (1/1) ... [2023-11-23 06:54:45,468 INFO L188 MemorySlicer]: Split 518 memory accesses to 6 slices as follows [2, 256, 236, 16, 5, 3]. 49 percent of accesses are in the largest equivalence class. The 502 initializations are split as follows [2, 256, 236, 0, 5, 3]. The 4 writes are split as follows [0, 0, 0, 4, 0, 0]. [2023-11-23 06:54:45,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:45" (1/1) ... [2023-11-23 06:54:45,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:45" (1/1) ... [2023-11-23 06:54:45,513 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:45" (1/1) ... [2023-11-23 06:54:45,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:45" (1/1) ... [2023-11-23 06:54:45,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:45" (1/1) ... [2023-11-23 06:54:45,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:45" (1/1) ... [2023-11-23 06:54:45,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 06:54:45,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 06:54:45,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 06:54:45,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 06:54:45,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:45" (1/1) ... [2023-11-23 06:54:45,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 06:54:45,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 06:54:45,601 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 06:54:45,632 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 06:54:45,662 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2023-11-23 06:54:45,663 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2023-11-23 06:54:45,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 06:54:45,663 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-23 06:54:45,663 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-23 06:54:45,664 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2023-11-23 06:54:45,664 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2023-11-23 06:54:45,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 06:54:45,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 06:54:45,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 06:54:45,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 06:54:45,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-23 06:54:45,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-23 06:54:45,666 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2023-11-23 06:54:45,666 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2023-11-23 06:54:45,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 06:54:45,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 06:54:45,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 06:54:45,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 06:54:45,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 06:54:45,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 06:54:45,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 06:54:45,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-23 06:54:45,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-23 06:54:45,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-23 06:54:45,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 06:54:45,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 06:54:45,669 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 06:54:45,669 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 06:54:45,669 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2023-11-23 06:54:45,669 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2023-11-23 06:54:45,669 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 06:54:45,670 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 06:54:45,670 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2023-11-23 06:54:45,670 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2023-11-23 06:54:45,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 06:54:45,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 06:54:45,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 06:54:45,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 06:54:45,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-23 06:54:45,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-23 06:54:45,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-23 06:54:45,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 06:54:45,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 06:54:45,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 06:54:45,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-23 06:54:45,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-23 06:54:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-23 06:54:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-23 06:54:45,673 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-23 06:54:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 06:54:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 06:54:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 06:54:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-23 06:54:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-23 06:54:45,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-23 06:54:45,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 06:54:45,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 06:54:45,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 06:54:45,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 06:54:45,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-23 06:54:45,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-23 06:54:45,962 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 06:54:45,963 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 06:54:46,799 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 06:54:46,934 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 06:54:46,934 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 06:54:46,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:54:46 BoogieIcfgContainer [2023-11-23 06:54:46,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 06:54:46,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 06:54:46,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 06:54:46,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 06:54:46,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:54:43" (1/3) ... [2023-11-23 06:54:46,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678fca5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:54:46, skipping insertion in model container [2023-11-23 06:54:46,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:54:45" (2/3) ... [2023-11-23 06:54:46,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678fca5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:54:46, skipping insertion in model container [2023-11-23 06:54:46,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:54:46" (3/3) ... [2023-11-23 06:54:46,953 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_init_harness.i [2023-11-23 06:54:47,024 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 06:54:47,024 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 06:54:47,074 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 06:54:47,085 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;@3dbf1633, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 06:54:47,085 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 06:54:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 55 states have internal predecessors, (70), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-23 06:54:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-23 06:54:47,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:54:47,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:54:47,103 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:54:47,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:54:47,110 INFO L85 PathProgramCache]: Analyzing trace with hash -836795630, now seen corresponding path program 1 times [2023-11-23 06:54:47,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:54:47,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803018340] [2023-11-23 06:54:47,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:47,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:54:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:47,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:47,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:54:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:47,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:54:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:47,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:54:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 06:54:47,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:54:47,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803018340] [2023-11-23 06:54:47,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803018340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:54:47,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:54:47,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 06:54:47,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330242615] [2023-11-23 06:54:47,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:54:47,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 06:54:47,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:54:47,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 06:54:47,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 06:54:47,882 INFO L87 Difference]: Start difference. First operand has 86 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 55 states have internal predecessors, (70), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:54:48,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:54:48,061 INFO L93 Difference]: Finished difference Result 168 states and 227 transitions. [2023-11-23 06:54:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 06:54:48,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-11-23 06:54:48,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:54:48,070 INFO L225 Difference]: With dead ends: 168 [2023-11-23 06:54:48,070 INFO L226 Difference]: Without dead ends: 83 [2023-11-23 06:54:48,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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 06:54:48,080 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 06:54:48,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 06:54:48,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-23 06:54:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-23 06:54:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.25) internal successors, (65), 53 states have internal predecessors, (65), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-23 06:54:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 104 transitions. [2023-11-23 06:54:48,158 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 104 transitions. Word has length 28 [2023-11-23 06:54:48,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:54:48,159 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 104 transitions. [2023-11-23 06:54:48,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:54:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2023-11-23 06:54:48,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-23 06:54:48,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:54:48,162 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:54:48,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 06:54:48,162 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:54:48,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:54:48,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1435162158, now seen corresponding path program 1 times [2023-11-23 06:54:48,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:54:48,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332494110] [2023-11-23 06:54:48,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:48,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:54:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:48,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:49,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:54:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:49,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:54:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:49,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:54:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 06:54:49,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:54:49,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332494110] [2023-11-23 06:54:49,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332494110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:54:49,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:54:49,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 06:54:49,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492566763] [2023-11-23 06:54:49,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:54:49,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 06:54:49,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:54:49,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 06:54:49,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 06:54:49,073 INFO L87 Difference]: Start difference. First operand 83 states and 104 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:54:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:54:49,457 INFO L93 Difference]: Finished difference Result 127 states and 165 transitions. [2023-11-23 06:54:49,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 06:54:49,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-11-23 06:54:49,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:54:49,460 INFO L225 Difference]: With dead ends: 127 [2023-11-23 06:54:49,462 INFO L226 Difference]: Without dead ends: 91 [2023-11-23 06:54:49,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 06:54:49,477 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 5 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 06:54:49,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 269 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 06:54:49,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-23 06:54:49,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2023-11-23 06:54:49,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 56 states have internal predecessors, (68), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-23 06:54:49,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2023-11-23 06:54:49,498 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 28 [2023-11-23 06:54:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:54:49,499 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2023-11-23 06:54:49,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:54:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2023-11-23 06:54:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-23 06:54:49,516 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:54:49,516 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:54:49,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 06:54:49,517 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:54:49,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:54:49,517 INFO L85 PathProgramCache]: Analyzing trace with hash -734097580, now seen corresponding path program 1 times [2023-11-23 06:54:49,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:54:49,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111911744] [2023-11-23 06:54:49,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:49,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:54:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:50,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:50,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:54:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:50,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:54:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:50,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:54:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 06:54:50,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:54:50,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111911744] [2023-11-23 06:54:50,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111911744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:54:50,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:54:50,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 06:54:50,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406218019] [2023-11-23 06:54:50,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:54:50,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 06:54:50,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:54:50,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 06:54:50,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 06:54:50,969 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:54:51,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:54:51,277 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2023-11-23 06:54:51,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 06:54:51,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-11-23 06:54:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:54:51,279 INFO L225 Difference]: With dead ends: 122 [2023-11-23 06:54:51,279 INFO L226 Difference]: Without dead ends: 86 [2023-11-23 06:54:51,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 06:54:51,280 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 06:54:51,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 310 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 06:54:51,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-23 06:54:51,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-23 06:54:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 56 states have internal predecessors, (67), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-23 06:54:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2023-11-23 06:54:51,294 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 28 [2023-11-23 06:54:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:54:51,295 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2023-11-23 06:54:51,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:54:51,295 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2023-11-23 06:54:51,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-23 06:54:51,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:54:51,297 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:54:51,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 06:54:51,298 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:54:51,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:54:51,298 INFO L85 PathProgramCache]: Analyzing trace with hash 139977351, now seen corresponding path program 1 times [2023-11-23 06:54:51,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:54:51,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056530738] [2023-11-23 06:54:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:51,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:54:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:51,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:51,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:54:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:51,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:54:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:51,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:54:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 06:54:51,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:54:51,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056530738] [2023-11-23 06:54:51,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056530738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:54:51,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:54:51,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 06:54:51,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465986571] [2023-11-23 06:54:51,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:54:51,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 06:54:51,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:54:51,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 06:54:51,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 06:54:51,672 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 06:54:51,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:54:51,931 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2023-11-23 06:54:51,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 06:54:51,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2023-11-23 06:54:51,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:54:51,935 INFO L225 Difference]: With dead ends: 130 [2023-11-23 06:54:51,937 INFO L226 Difference]: Without dead ends: 96 [2023-11-23 06:54:51,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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 06:54:51,939 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 29 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:54:51,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 264 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:54:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-23 06:54:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2023-11-23 06:54:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 58 states have internal predecessors, (69), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-23 06:54:51,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2023-11-23 06:54:51,956 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 34 [2023-11-23 06:54:51,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:54:51,956 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2023-11-23 06:54:51,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 06:54:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2023-11-23 06:54:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-23 06:54:51,958 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:54:51,958 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:54:51,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 06:54:51,959 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:54:51,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:54:51,959 INFO L85 PathProgramCache]: Analyzing trace with hash 533004361, now seen corresponding path program 1 times [2023-11-23 06:54:51,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:54:51,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524463043] [2023-11-23 06:54:51,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:51,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:54:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:52,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:52,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:54:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:52,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:54:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:52,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:54:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:52,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 06:54:52,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:54:52,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524463043] [2023-11-23 06:54:52,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524463043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:54:52,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:54:52,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 06:54:52,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704408122] [2023-11-23 06:54:52,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:54:52,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 06:54:52,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:54:52,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 06:54:52,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 06:54:52,648 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 8 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 06:54:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:54:52,971 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2023-11-23 06:54:52,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 06:54:52,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2023-11-23 06:54:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:54:52,974 INFO L225 Difference]: With dead ends: 99 [2023-11-23 06:54:52,974 INFO L226 Difference]: Without dead ends: 97 [2023-11-23 06:54:52,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-23 06:54:52,975 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 23 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 06:54:52,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 600 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 06:54:52,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-23 06:54:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2023-11-23 06:54:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 64 states have internal predecessors, (74), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2023-11-23 06:54:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2023-11-23 06:54:52,984 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 34 [2023-11-23 06:54:52,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:54:52,984 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2023-11-23 06:54:52,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 06:54:52,985 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2023-11-23 06:54:52,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 06:54:52,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:54:52,986 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:54:52,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 06:54:52,986 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:54:52,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:54:52,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1503721089, now seen corresponding path program 1 times [2023-11-23 06:54:52,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:54:52,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47052870] [2023-11-23 06:54:52,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:52,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:54:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:53,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:53,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:54:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:53,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:54:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:53,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:54:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:54,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 06:54:54,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:54:54,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47052870] [2023-11-23 06:54:54,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47052870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:54:54,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:54:54,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 06:54:54,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199755463] [2023-11-23 06:54:54,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:54:54,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 06:54:54,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:54:54,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 06:54:54,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 06:54:54,146 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:54:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:54:54,601 INFO L93 Difference]: Finished difference Result 161 states and 200 transitions. [2023-11-23 06:54:54,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 06:54:54,601 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2023-11-23 06:54:54,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:54:54,602 INFO L225 Difference]: With dead ends: 161 [2023-11-23 06:54:54,603 INFO L226 Difference]: Without dead ends: 122 [2023-11-23 06:54:54,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-23 06:54:54,604 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 97 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 06:54:54,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 449 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 06:54:54,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-23 06:54:54,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 109. [2023-11-23 06:54:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 77 states have internal predecessors, (90), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2023-11-23 06:54:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2023-11-23 06:54:54,614 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 38 [2023-11-23 06:54:54,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:54:54,614 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2023-11-23 06:54:54,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:54:54,614 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2023-11-23 06:54:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 06:54:54,616 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:54:54,616 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:54:54,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 06:54:54,616 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:54:54,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:54:54,617 INFO L85 PathProgramCache]: Analyzing trace with hash -492603839, now seen corresponding path program 1 times [2023-11-23 06:54:54,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:54:54,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594234947] [2023-11-23 06:54:54,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:54,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:54:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:55,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:55,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:54:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:55,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:54:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:55,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:54:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 06:54:56,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:54:56,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594234947] [2023-11-23 06:54:56,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594234947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:54:56,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:54:56,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 06:54:56,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846288970] [2023-11-23 06:54:56,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:54:56,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 06:54:56,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:54:56,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 06:54:56,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-23 06:54:56,358 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:54:57,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:54:57,085 INFO L93 Difference]: Finished difference Result 184 states and 227 transitions. [2023-11-23 06:54:57,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 06:54:57,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2023-11-23 06:54:57,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:54:57,086 INFO L225 Difference]: With dead ends: 184 [2023-11-23 06:54:57,086 INFO L226 Difference]: Without dead ends: 132 [2023-11-23 06:54:57,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-11-23 06:54:57,088 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 60 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 06:54:57,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 444 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 06:54:57,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-23 06:54:57,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 111. [2023-11-23 06:54:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 79 states have internal predecessors, (93), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2023-11-23 06:54:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 137 transitions. [2023-11-23 06:54:57,104 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 137 transitions. Word has length 38 [2023-11-23 06:54:57,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:54:57,105 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 137 transitions. [2023-11-23 06:54:57,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:54:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2023-11-23 06:54:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 06:54:57,122 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:54:57,122 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:54:57,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 06:54:57,123 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:54:57,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:54:57,123 INFO L85 PathProgramCache]: Analyzing trace with hash 208460739, now seen corresponding path program 1 times [2023-11-23 06:54:57,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:54:57,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734077951] [2023-11-23 06:54:57,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:57,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:54:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:59,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:59,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:54:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:59,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:54:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:59,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:54:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 06:54:59,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:54:59,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734077951] [2023-11-23 06:54:59,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734077951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:54:59,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:54:59,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 06:54:59,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396073181] [2023-11-23 06:54:59,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:54:59,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 06:54:59,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:54:59,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 06:54:59,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-23 06:54:59,665 INFO L87 Difference]: Start difference. First operand 111 states and 137 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 06:55:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:00,556 INFO L93 Difference]: Finished difference Result 186 states and 236 transitions. [2023-11-23 06:55:00,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 06:55:00,557 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2023-11-23 06:55:00,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:00,558 INFO L225 Difference]: With dead ends: 186 [2023-11-23 06:55:00,558 INFO L226 Difference]: Without dead ends: 132 [2023-11-23 06:55:00,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2023-11-23 06:55:00,559 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 79 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:00,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 632 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 06:55:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-23 06:55:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2023-11-23 06:55:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 92 states have internal predecessors, (108), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2023-11-23 06:55:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 157 transitions. [2023-11-23 06:55:00,571 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 157 transitions. Word has length 38 [2023-11-23 06:55:00,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:00,571 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 157 transitions. [2023-11-23 06:55:00,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 06:55:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2023-11-23 06:55:00,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 06:55:00,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:00,572 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:55:00,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 06:55:00,573 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:00,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:00,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1823724865, now seen corresponding path program 1 times [2023-11-23 06:55:00,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:00,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059458705] [2023-11-23 06:55:00,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:00,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:01,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:01,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:01,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:01,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 06:55:01,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:01,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059458705] [2023-11-23 06:55:01,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059458705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:01,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:01,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 06:55:01,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001753166] [2023-11-23 06:55:01,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:01,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 06:55:01,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:01,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 06:55:01,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 06:55:01,207 INFO L87 Difference]: Start difference. First operand 124 states and 157 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 06:55:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:01,350 INFO L93 Difference]: Finished difference Result 205 states and 267 transitions. [2023-11-23 06:55:01,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 06:55:01,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2023-11-23 06:55:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:01,352 INFO L225 Difference]: With dead ends: 205 [2023-11-23 06:55:01,352 INFO L226 Difference]: Without dead ends: 140 [2023-11-23 06:55:01,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-23 06:55:01,353 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 26 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:01,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 283 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 06:55:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-23 06:55:01,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 125. [2023-11-23 06:55:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 93 states have internal predecessors, (108), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2023-11-23 06:55:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 157 transitions. [2023-11-23 06:55:01,361 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 157 transitions. Word has length 38 [2023-11-23 06:55:01,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:01,362 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 157 transitions. [2023-11-23 06:55:01,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 06:55:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 157 transitions. [2023-11-23 06:55:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-23 06:55:01,364 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:01,364 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:55:01,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 06:55:01,364 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:01,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:01,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2090641480, now seen corresponding path program 1 times [2023-11-23 06:55:01,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:01,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206226368] [2023-11-23 06:55:01,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:01,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:01,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:01,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:01,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:01,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:02,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 06:55:02,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:02,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206226368] [2023-11-23 06:55:02,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206226368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:02,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:02,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 06:55:02,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672433903] [2023-11-23 06:55:02,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:02,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 06:55:02,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:02,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 06:55:02,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-23 06:55:02,094 INFO L87 Difference]: Start difference. First operand 125 states and 157 transitions. Second operand has 10 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 06:55:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:02,587 INFO L93 Difference]: Finished difference Result 148 states and 183 transitions. [2023-11-23 06:55:02,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 06:55:02,588 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2023-11-23 06:55:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:02,590 INFO L225 Difference]: With dead ends: 148 [2023-11-23 06:55:02,590 INFO L226 Difference]: Without dead ends: 146 [2023-11-23 06:55:02,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-23 06:55:02,590 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 31 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:02,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 763 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 06:55:02,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-23 06:55:02,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 132. [2023-11-23 06:55:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 94 states have (on average 1.2127659574468086) internal successors, (114), 100 states have internal predecessors, (114), 22 states have call successors, (22), 11 states have call predecessors, (22), 15 states have return successors, (29), 20 states have call predecessors, (29), 21 states have call successors, (29) [2023-11-23 06:55:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 165 transitions. [2023-11-23 06:55:02,601 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 165 transitions. Word has length 40 [2023-11-23 06:55:02,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:02,601 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 165 transitions. [2023-11-23 06:55:02,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 06:55:02,602 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 165 transitions. [2023-11-23 06:55:02,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-23 06:55:02,602 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:02,603 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:55:02,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 06:55:02,603 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:02,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1811298806, now seen corresponding path program 1 times [2023-11-23 06:55:02,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:02,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682879780] [2023-11-23 06:55:02,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:02,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:03,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:03,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:03,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:03,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:03,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 06:55:03,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:03,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682879780] [2023-11-23 06:55:03,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682879780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:03,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:03,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 06:55:03,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160088639] [2023-11-23 06:55:03,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:03,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 06:55:03,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:03,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 06:55:03,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 06:55:03,521 INFO L87 Difference]: Start difference. First operand 132 states and 165 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:55:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:03,959 INFO L93 Difference]: Finished difference Result 220 states and 271 transitions. [2023-11-23 06:55:03,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 06:55:03,959 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2023-11-23 06:55:03,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:03,961 INFO L225 Difference]: With dead ends: 220 [2023-11-23 06:55:03,961 INFO L226 Difference]: Without dead ends: 147 [2023-11-23 06:55:03,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-23 06:55:03,962 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 32 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:03,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 379 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 06:55:03,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-23 06:55:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 126. [2023-11-23 06:55:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 94 states have internal predecessors, (109), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2023-11-23 06:55:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 157 transitions. [2023-11-23 06:55:03,970 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 157 transitions. Word has length 40 [2023-11-23 06:55:03,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:03,971 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 157 transitions. [2023-11-23 06:55:03,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:55:03,971 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 157 transitions. [2023-11-23 06:55:03,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-23 06:55:03,972 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:03,972 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 06:55:03,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 06:55:03,972 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:03,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:03,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2104477033, now seen corresponding path program 1 times [2023-11-23 06:55:03,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:03,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189353221] [2023-11-23 06:55:03,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:03,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:04,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:04,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:04,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:04,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:04,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 06:55:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:04,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 06:55:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 06:55:04,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:04,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189353221] [2023-11-23 06:55:04,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189353221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:04,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:04,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 06:55:04,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313119643] [2023-11-23 06:55:04,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:04,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 06:55:04,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:04,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 06:55:04,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 06:55:04,677 INFO L87 Difference]: Start difference. First operand 126 states and 157 transitions. Second operand has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 06:55:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:05,329 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2023-11-23 06:55:05,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 06:55:05,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2023-11-23 06:55:05,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:05,331 INFO L225 Difference]: With dead ends: 137 [2023-11-23 06:55:05,331 INFO L226 Difference]: Without dead ends: 135 [2023-11-23 06:55:05,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-23 06:55:05,332 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 23 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:05,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 617 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 06:55:05,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-23 06:55:05,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2023-11-23 06:55:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 94 states have (on average 1.2127659574468086) internal successors, (114), 100 states have internal predecessors, (114), 23 states have call successors, (23), 12 states have call predecessors, (23), 16 states have return successors, (30), 21 states have call predecessors, (30), 22 states have call successors, (30) [2023-11-23 06:55:05,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2023-11-23 06:55:05,343 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 167 transitions. Word has length 53 [2023-11-23 06:55:05,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:05,344 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 167 transitions. [2023-11-23 06:55:05,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 06:55:05,344 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 167 transitions. [2023-11-23 06:55:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 06:55:05,346 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:05,346 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 06:55:05,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 06:55:05,346 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:05,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:05,347 INFO L85 PathProgramCache]: Analyzing trace with hash -252957491, now seen corresponding path program 1 times [2023-11-23 06:55:05,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:05,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271860575] [2023-11-23 06:55:05,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:05,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:06,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:06,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:07,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:07,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:07,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 06:55:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:07,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 06:55:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 06:55:07,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:07,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271860575] [2023-11-23 06:55:07,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271860575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:07,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:07,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 06:55:07,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880347062] [2023-11-23 06:55:07,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:07,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 06:55:07,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:07,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 06:55:07,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-23 06:55:07,348 INFO L87 Difference]: Start difference. First operand 134 states and 167 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 06:55:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:07,998 INFO L93 Difference]: Finished difference Result 176 states and 223 transitions. [2023-11-23 06:55:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 06:55:07,999 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2023-11-23 06:55:07,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:08,000 INFO L225 Difference]: With dead ends: 176 [2023-11-23 06:55:08,000 INFO L226 Difference]: Without dead ends: 163 [2023-11-23 06:55:08,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-23 06:55:08,001 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 103 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:08,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 465 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 06:55:08,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-23 06:55:08,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 142. [2023-11-23 06:55:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 100 states have (on average 1.2) internal successors, (120), 108 states have internal predecessors, (120), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (36), 21 states have call predecessors, (36), 23 states have call successors, (36) [2023-11-23 06:55:08,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 180 transitions. [2023-11-23 06:55:08,013 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 180 transitions. Word has length 57 [2023-11-23 06:55:08,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:08,013 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 180 transitions. [2023-11-23 06:55:08,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 06:55:08,014 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 180 transitions. [2023-11-23 06:55:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 06:55:08,015 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:08,015 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 06:55:08,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 06:55:08,015 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:08,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash 758159759, now seen corresponding path program 1 times [2023-11-23 06:55:08,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:08,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010509360] [2023-11-23 06:55:08,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:08,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:08,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:08,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:08,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:08,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:08,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 06:55:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:08,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 06:55:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 06:55:09,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:09,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010509360] [2023-11-23 06:55:09,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010509360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:09,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:09,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 06:55:09,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288651195] [2023-11-23 06:55:09,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:09,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 06:55:09,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:09,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 06:55:09,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-23 06:55:09,241 INFO L87 Difference]: Start difference. First operand 142 states and 180 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 06:55:09,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:09,841 INFO L93 Difference]: Finished difference Result 187 states and 235 transitions. [2023-11-23 06:55:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 06:55:09,842 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2023-11-23 06:55:09,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:09,843 INFO L225 Difference]: With dead ends: 187 [2023-11-23 06:55:09,843 INFO L226 Difference]: Without dead ends: 174 [2023-11-23 06:55:09,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-23 06:55:09,844 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 47 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:09,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 454 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 06:55:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-23 06:55:09,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 142. [2023-11-23 06:55:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 100 states have (on average 1.2) internal successors, (120), 108 states have internal predecessors, (120), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (36), 21 states have call predecessors, (36), 23 states have call successors, (36) [2023-11-23 06:55:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 180 transitions. [2023-11-23 06:55:09,854 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 180 transitions. Word has length 57 [2023-11-23 06:55:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:09,865 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 180 transitions. [2023-11-23 06:55:09,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 06:55:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 180 transitions. [2023-11-23 06:55:09,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 06:55:09,867 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:09,867 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 06:55:09,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 06:55:09,868 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:09,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1459224337, now seen corresponding path program 1 times [2023-11-23 06:55:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:09,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744246042] [2023-11-23 06:55:09,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:09,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:11,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:11,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:11,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:11,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:12,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 06:55:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:12,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 06:55:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 06:55:12,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:12,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744246042] [2023-11-23 06:55:12,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744246042] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 06:55:12,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624835942] [2023-11-23 06:55:12,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:12,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:55:12,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 06:55:12,235 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 06:55:12,242 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 06:55:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:12,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 2448 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-23 06:55:12,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 06:55:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 06:55:13,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 06:55:13,942 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-23 06:55:13,943 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 30 treesize of output 25 [2023-11-23 06:55:13,955 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-23 06:55:13,955 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 24 treesize of output 12 [2023-11-23 06:55:14,175 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-23 06:55:14,175 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 30 treesize of output 25 [2023-11-23 06:55:14,184 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-23 06:55:14,184 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 24 treesize of output 12 [2023-11-23 06:55:14,213 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 06:55:14,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624835942] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 06:55:14,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 06:55:14,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 30 [2023-11-23 06:55:14,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763856499] [2023-11-23 06:55:14,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 06:55:14,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-23 06:55:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:14,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-23 06:55:14,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2023-11-23 06:55:14,218 INFO L87 Difference]: Start difference. First operand 142 states and 180 transitions. Second operand has 30 states, 29 states have (on average 3.0) internal successors, (87), 29 states have internal predecessors, (87), 7 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-23 06:55:17,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:17,315 INFO L93 Difference]: Finished difference Result 249 states and 305 transitions. [2023-11-23 06:55:17,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-23 06:55:17,316 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.0) internal successors, (87), 29 states have internal predecessors, (87), 7 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 57 [2023-11-23 06:55:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:17,317 INFO L225 Difference]: With dead ends: 249 [2023-11-23 06:55:17,317 INFO L226 Difference]: Without dead ends: 200 [2023-11-23 06:55:17,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=290, Invalid=1516, Unknown=0, NotChecked=0, Total=1806 [2023-11-23 06:55:17,319 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 269 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:17,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1193 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-23 06:55:17,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-23 06:55:17,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 182. [2023-11-23 06:55:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 131 states have (on average 1.183206106870229) internal successors, (155), 139 states have internal predecessors, (155), 30 states have call successors, (30), 15 states have call predecessors, (30), 20 states have return successors, (42), 27 states have call predecessors, (42), 28 states have call successors, (42) [2023-11-23 06:55:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 227 transitions. [2023-11-23 06:55:17,332 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 227 transitions. Word has length 57 [2023-11-23 06:55:17,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:17,332 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 227 transitions. [2023-11-23 06:55:17,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.0) internal successors, (87), 29 states have internal predecessors, (87), 7 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-23 06:55:17,333 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 227 transitions. [2023-11-23 06:55:17,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-23 06:55:17,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:17,334 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] [2023-11-23 06:55:17,356 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 06:55:17,552 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 06:55:17,553 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:17,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:17,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1178380617, now seen corresponding path program 1 times [2023-11-23 06:55:17,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:17,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439247745] [2023-11-23 06:55:17,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:17,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:18,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:18,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:18,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:18,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:18,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 06:55:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:18,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 06:55:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:18,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 06:55:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-23 06:55:18,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:18,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439247745] [2023-11-23 06:55:18,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439247745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:18,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:18,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 06:55:18,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788042138] [2023-11-23 06:55:18,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:18,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 06:55:18,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:18,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 06:55:18,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-23 06:55:18,840 INFO L87 Difference]: Start difference. First operand 182 states and 227 transitions. Second operand has 9 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 06:55:19,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:19,532 INFO L93 Difference]: Finished difference Result 206 states and 256 transitions. [2023-11-23 06:55:19,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 06:55:19,533 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2023-11-23 06:55:19,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:19,534 INFO L225 Difference]: With dead ends: 206 [2023-11-23 06:55:19,534 INFO L226 Difference]: Without dead ends: 204 [2023-11-23 06:55:19,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-23 06:55:19,535 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 20 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:19,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 606 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 06:55:19,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-11-23 06:55:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196. [2023-11-23 06:55:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 139 states have (on average 1.1726618705035972) internal successors, (163), 147 states have internal predecessors, (163), 34 states have call successors, (34), 17 states have call predecessors, (34), 22 states have return successors, (46), 31 states have call predecessors, (46), 32 states have call successors, (46) [2023-11-23 06:55:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 243 transitions. [2023-11-23 06:55:19,551 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 243 transitions. Word has length 59 [2023-11-23 06:55:19,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:19,551 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 243 transitions. [2023-11-23 06:55:19,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 06:55:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 243 transitions. [2023-11-23 06:55:19,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-23 06:55:19,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:19,553 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 06:55:19,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 06:55:19,553 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:19,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:19,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2063417466, now seen corresponding path program 1 times [2023-11-23 06:55:19,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:19,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405874318] [2023-11-23 06:55:19,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:19,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:20,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:20,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:20,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:20,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:20,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 06:55:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:20,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 06:55:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 06:55:20,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:20,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405874318] [2023-11-23 06:55:20,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405874318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:20,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:20,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 06:55:20,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749995864] [2023-11-23 06:55:20,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:20,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 06:55:20,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:20,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 06:55:20,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-23 06:55:20,639 INFO L87 Difference]: Start difference. First operand 196 states and 243 transitions. Second operand has 10 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 06:55:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:21,078 INFO L93 Difference]: Finished difference Result 222 states and 271 transitions. [2023-11-23 06:55:21,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 06:55:21,079 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 59 [2023-11-23 06:55:21,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:21,080 INFO L225 Difference]: With dead ends: 222 [2023-11-23 06:55:21,080 INFO L226 Difference]: Without dead ends: 220 [2023-11-23 06:55:21,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-23 06:55:21,081 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 31 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:21,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 786 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 06:55:21,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-23 06:55:21,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2023-11-23 06:55:21,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 153 states have (on average 1.1568627450980393) internal successors, (177), 163 states have internal predecessors, (177), 37 states have call successors, (37), 19 states have call predecessors, (37), 26 states have return successors, (51), 34 states have call predecessors, (51), 35 states have call successors, (51) [2023-11-23 06:55:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 265 transitions. [2023-11-23 06:55:21,101 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 265 transitions. Word has length 59 [2023-11-23 06:55:21,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:21,101 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 265 transitions. [2023-11-23 06:55:21,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 06:55:21,102 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 265 transitions. [2023-11-23 06:55:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-23 06:55:21,103 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:21,103 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 06:55:21,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 06:55:21,103 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:21,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:21,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1838522820, now seen corresponding path program 1 times [2023-11-23 06:55:21,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:21,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713039807] [2023-11-23 06:55:21,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:21,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:21,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:21,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:21,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:21,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:21,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 06:55:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:21,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 06:55:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 06:55:22,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:22,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713039807] [2023-11-23 06:55:22,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713039807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:22,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:22,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 06:55:22,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221794717] [2023-11-23 06:55:22,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:22,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 06:55:22,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:22,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 06:55:22,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-23 06:55:22,015 INFO L87 Difference]: Start difference. First operand 217 states and 265 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 06:55:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:22,570 INFO L93 Difference]: Finished difference Result 260 states and 312 transitions. [2023-11-23 06:55:22,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 06:55:22,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2023-11-23 06:55:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:22,572 INFO L225 Difference]: With dead ends: 260 [2023-11-23 06:55:22,573 INFO L226 Difference]: Without dead ends: 223 [2023-11-23 06:55:22,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-23 06:55:22,574 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 39 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:22,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 470 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 06:55:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-11-23 06:55:22,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2023-11-23 06:55:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 145 states have (on average 1.1586206896551725) internal successors, (168), 153 states have internal predecessors, (168), 36 states have call successors, (36), 19 states have call predecessors, (36), 24 states have return successors, (47), 33 states have call predecessors, (47), 34 states have call successors, (47) [2023-11-23 06:55:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 251 transitions. [2023-11-23 06:55:22,590 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 251 transitions. Word has length 59 [2023-11-23 06:55:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:22,590 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 251 transitions. [2023-11-23 06:55:22,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 06:55:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 251 transitions. [2023-11-23 06:55:22,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 06:55:22,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:22,592 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 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] [2023-11-23 06:55:22,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 06:55:22,592 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:22,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1300210645, now seen corresponding path program 1 times [2023-11-23 06:55:22,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:22,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724253292] [2023-11-23 06:55:22,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:22,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:23,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:23,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:23,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:23,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:23,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 06:55:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:23,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 06:55:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:23,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 06:55:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:23,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 06:55:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 06:55:23,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:23,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724253292] [2023-11-23 06:55:23,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724253292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:23,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:23,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 06:55:23,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238019652] [2023-11-23 06:55:23,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:23,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 06:55:23,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:23,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 06:55:23,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 06:55:23,572 INFO L87 Difference]: Start difference. First operand 206 states and 251 transitions. Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 06:55:24,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:24,257 INFO L93 Difference]: Finished difference Result 224 states and 270 transitions. [2023-11-23 06:55:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 06:55:24,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 65 [2023-11-23 06:55:24,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:24,274 INFO L225 Difference]: With dead ends: 224 [2023-11-23 06:55:24,274 INFO L226 Difference]: Without dead ends: 222 [2023-11-23 06:55:24,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-23 06:55:24,274 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 12 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:24,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 549 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 06:55:24,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-23 06:55:24,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 218. [2023-11-23 06:55:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 153 states have (on average 1.1503267973856208) internal successors, (176), 161 states have internal predecessors, (176), 38 states have call successors, (38), 21 states have call predecessors, (38), 26 states have return successors, (49), 35 states have call predecessors, (49), 36 states have call successors, (49) [2023-11-23 06:55:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 263 transitions. [2023-11-23 06:55:24,306 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 263 transitions. Word has length 65 [2023-11-23 06:55:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:24,306 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 263 transitions. [2023-11-23 06:55:24,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 06:55:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 263 transitions. [2023-11-23 06:55:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-23 06:55:24,309 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:24,309 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 06:55:24,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 06:55:24,309 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:24,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:24,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1915307326, now seen corresponding path program 1 times [2023-11-23 06:55:24,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:24,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065933390] [2023-11-23 06:55:24,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:24,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:26,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:26,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:26,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:26,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:26,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 06:55:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:26,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 06:55:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 06:55:26,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:26,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065933390] [2023-11-23 06:55:26,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065933390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:26,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:26,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 06:55:26,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139204741] [2023-11-23 06:55:26,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:26,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 06:55:26,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:26,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 06:55:26,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-23 06:55:26,427 INFO L87 Difference]: Start difference. First operand 218 states and 263 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 06:55:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:27,142 INFO L93 Difference]: Finished difference Result 274 states and 334 transitions. [2023-11-23 06:55:27,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 06:55:27,143 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2023-11-23 06:55:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:27,144 INFO L225 Difference]: With dead ends: 274 [2023-11-23 06:55:27,144 INFO L226 Difference]: Without dead ends: 248 [2023-11-23 06:55:27,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2023-11-23 06:55:27,151 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 86 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:27,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 597 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 06:55:27,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-23 06:55:27,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 223. [2023-11-23 06:55:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 156 states have (on average 1.1474358974358974) internal successors, (179), 164 states have internal predecessors, (179), 40 states have call successors, (40), 21 states have call predecessors, (40), 26 states have return successors, (52), 37 states have call predecessors, (52), 38 states have call successors, (52) [2023-11-23 06:55:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 271 transitions. [2023-11-23 06:55:27,180 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 271 transitions. Word has length 63 [2023-11-23 06:55:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:27,180 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 271 transitions. [2023-11-23 06:55:27,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 06:55:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 271 transitions. [2023-11-23 06:55:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-23 06:55:27,181 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:27,182 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:55:27,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-23 06:55:27,182 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:27,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:27,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1659352122, now seen corresponding path program 1 times [2023-11-23 06:55:27,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:27,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191877082] [2023-11-23 06:55:27,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:27,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:27,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:27,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:27,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:27,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:55:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:27,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:27,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:27,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 06:55:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:27,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 06:55:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:27,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:27,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:27,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 06:55:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 06:55:27,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:27,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191877082] [2023-11-23 06:55:27,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191877082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:27,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:27,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 06:55:27,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486987773] [2023-11-23 06:55:27,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:27,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 06:55:27,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:27,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 06:55:27,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 06:55:27,571 INFO L87 Difference]: Start difference. First operand 223 states and 271 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-23 06:55:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:28,493 INFO L93 Difference]: Finished difference Result 405 states and 490 transitions. [2023-11-23 06:55:28,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 06:55:28,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 71 [2023-11-23 06:55:28,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:28,496 INFO L225 Difference]: With dead ends: 405 [2023-11-23 06:55:28,496 INFO L226 Difference]: Without dead ends: 233 [2023-11-23 06:55:28,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-23 06:55:28,497 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 51 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:28,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 232 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 06:55:28,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-11-23 06:55:28,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2023-11-23 06:55:28,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 159 states have (on average 1.1446540880503144) internal successors, (182), 167 states have internal predecessors, (182), 40 states have call successors, (40), 21 states have call predecessors, (40), 27 states have return successors, (53), 38 states have call predecessors, (53), 38 states have call successors, (53) [2023-11-23 06:55:28,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 275 transitions. [2023-11-23 06:55:28,516 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 275 transitions. Word has length 71 [2023-11-23 06:55:28,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:28,517 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 275 transitions. [2023-11-23 06:55:28,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-23 06:55:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 275 transitions. [2023-11-23 06:55:28,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-23 06:55:28,519 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:28,519 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2023-11-23 06:55:28,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-23 06:55:28,519 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:28,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:28,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1701844111, now seen corresponding path program 1 times [2023-11-23 06:55:28,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:28,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304794864] [2023-11-23 06:55:28,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:28,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:31,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:31,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:31,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:31,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:31,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 06:55:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:31,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 06:55:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:31,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 06:55:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:31,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 06:55:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:31,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 06:55:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:31,601 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 06:55:31,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:31,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304794864] [2023-11-23 06:55:31,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304794864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:31,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:31,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 06:55:31,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78905456] [2023-11-23 06:55:31,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:31,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 06:55:31,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:31,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 06:55:31,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-23 06:55:31,605 INFO L87 Difference]: Start difference. First operand 227 states and 275 transitions. Second operand has 10 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-23 06:55:32,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:32,452 INFO L93 Difference]: Finished difference Result 241 states and 288 transitions. [2023-11-23 06:55:32,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 06:55:32,453 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 71 [2023-11-23 06:55:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:32,454 INFO L225 Difference]: With dead ends: 241 [2023-11-23 06:55:32,454 INFO L226 Difference]: Without dead ends: 158 [2023-11-23 06:55:32,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-11-23 06:55:32,457 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 43 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:32,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 404 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 06:55:32,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-23 06:55:32,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 149. [2023-11-23 06:55:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 107 states have internal predecessors, (119), 28 states have call successors, (28), 14 states have call predecessors, (28), 19 states have return successors, (31), 27 states have call predecessors, (31), 25 states have call successors, (31) [2023-11-23 06:55:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 178 transitions. [2023-11-23 06:55:32,475 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 178 transitions. Word has length 71 [2023-11-23 06:55:32,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:32,475 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 178 transitions. [2023-11-23 06:55:32,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-23 06:55:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 178 transitions. [2023-11-23 06:55:32,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-23 06:55:32,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:32,477 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:55:32,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-23 06:55:32,477 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:32,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:32,478 INFO L85 PathProgramCache]: Analyzing trace with hash -219523926, now seen corresponding path program 1 times [2023-11-23 06:55:32,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:32,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456900593] [2023-11-23 06:55:32,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:32,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:33,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:33,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:33,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:33,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:55:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:33,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:33,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:33,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 06:55:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:33,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 06:55:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:33,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:33,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:33,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 06:55:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:33,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 06:55:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 06:55:33,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:33,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456900593] [2023-11-23 06:55:33,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456900593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:33,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:33,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 06:55:33,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765189291] [2023-11-23 06:55:33,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:33,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 06:55:33,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:33,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 06:55:33,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-23 06:55:33,788 INFO L87 Difference]: Start difference. First operand 149 states and 178 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-23 06:55:35,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:35,162 INFO L93 Difference]: Finished difference Result 232 states and 278 transitions. [2023-11-23 06:55:35,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 06:55:35,163 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 75 [2023-11-23 06:55:35,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:35,164 INFO L225 Difference]: With dead ends: 232 [2023-11-23 06:55:35,164 INFO L226 Difference]: Without dead ends: 166 [2023-11-23 06:55:35,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-11-23 06:55:35,165 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 102 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:35,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 250 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-23 06:55:35,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-11-23 06:55:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 155. [2023-11-23 06:55:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 106 states have (on average 1.179245283018868) internal successors, (125), 112 states have internal predecessors, (125), 28 states have call successors, (28), 14 states have call predecessors, (28), 20 states have return successors, (32), 28 states have call predecessors, (32), 25 states have call successors, (32) [2023-11-23 06:55:35,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 185 transitions. [2023-11-23 06:55:35,175 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 185 transitions. Word has length 75 [2023-11-23 06:55:35,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:35,175 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 185 transitions. [2023-11-23 06:55:35,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-23 06:55:35,175 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 185 transitions. [2023-11-23 06:55:35,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-23 06:55:35,176 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:35,176 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:55:35,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-23 06:55:35,176 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:35,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:35,177 INFO L85 PathProgramCache]: Analyzing trace with hash 203177900, now seen corresponding path program 1 times [2023-11-23 06:55:35,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:35,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231437561] [2023-11-23 06:55:35,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:35,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:35,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:35,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:35,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:35,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:55:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:35,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:35,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:35,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 06:55:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:35,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 06:55:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:35,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:35,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:35,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 06:55:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:35,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 06:55:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 06:55:35,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:35,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231437561] [2023-11-23 06:55:35,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231437561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:35,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:35,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 06:55:35,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071317163] [2023-11-23 06:55:35,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:35,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 06:55:35,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:35,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 06:55:35,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 06:55:35,440 INFO L87 Difference]: Start difference. First operand 155 states and 185 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-23 06:55:35,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:35,941 INFO L93 Difference]: Finished difference Result 225 states and 266 transitions. [2023-11-23 06:55:35,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 06:55:35,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 75 [2023-11-23 06:55:35,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:35,943 INFO L225 Difference]: With dead ends: 225 [2023-11-23 06:55:35,943 INFO L226 Difference]: Without dead ends: 158 [2023-11-23 06:55:35,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 06:55:35,944 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 100 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:35,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 128 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 06:55:35,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-23 06:55:35,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2023-11-23 06:55:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 105 states have (on average 1.161904761904762) internal successors, (122), 111 states have internal predecessors, (122), 28 states have call successors, (28), 14 states have call predecessors, (28), 20 states have return successors, (32), 28 states have call predecessors, (32), 25 states have call successors, (32) [2023-11-23 06:55:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2023-11-23 06:55:35,952 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 75 [2023-11-23 06:55:35,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:35,953 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2023-11-23 06:55:35,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-23 06:55:35,953 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2023-11-23 06:55:35,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 06:55:35,956 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:35,956 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:55:35,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-23 06:55:35,957 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:35,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:35,957 INFO L85 PathProgramCache]: Analyzing trace with hash -2047349911, now seen corresponding path program 1 times [2023-11-23 06:55:35,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:35,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706563509] [2023-11-23 06:55:35,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:35,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:36,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:36,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:36,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:36,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:55:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:36,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:36,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:36,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 06:55:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:36,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 06:55:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:36,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:36,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:36,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 06:55:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:36,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 06:55:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 06:55:36,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:36,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706563509] [2023-11-23 06:55:36,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706563509] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:36,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:36,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 06:55:36,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193148714] [2023-11-23 06:55:36,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:36,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 06:55:36,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:36,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 06:55:36,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 06:55:36,205 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 06:55:36,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:36,537 INFO L93 Difference]: Finished difference Result 212 states and 247 transitions. [2023-11-23 06:55:36,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 06:55:36,538 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 77 [2023-11-23 06:55:36,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:36,539 INFO L225 Difference]: With dead ends: 212 [2023-11-23 06:55:36,539 INFO L226 Difference]: Without dead ends: 91 [2023-11-23 06:55:36,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 06:55:36,540 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 96 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:36,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 120 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 06:55:36,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-23 06:55:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2023-11-23 06:55:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 62 states have internal predecessors, (65), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2023-11-23 06:55:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2023-11-23 06:55:36,546 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 77 [2023-11-23 06:55:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:36,547 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2023-11-23 06:55:36,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 06:55:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2023-11-23 06:55:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 06:55:36,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:36,548 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:55:36,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-23 06:55:36,548 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:36,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:36,549 INFO L85 PathProgramCache]: Analyzing trace with hash -609841976, now seen corresponding path program 1 times [2023-11-23 06:55:36,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:36,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122575236] [2023-11-23 06:55:36,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:36,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:38,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:38,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:38,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:38,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:55:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:38,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:38,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:38,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 06:55:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:38,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 06:55:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:38,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:38,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:38,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:38,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:38,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 06:55:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-23 06:55:38,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:38,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122575236] [2023-11-23 06:55:38,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122575236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:38,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:38,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 06:55:38,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188373980] [2023-11-23 06:55:38,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:38,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 06:55:38,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:38,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 06:55:38,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-11-23 06:55:38,555 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 13 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-23 06:55:39,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:39,451 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2023-11-23 06:55:39,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 06:55:39,451 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 81 [2023-11-23 06:55:39,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:39,452 INFO L225 Difference]: With dead ends: 140 [2023-11-23 06:55:39,452 INFO L226 Difference]: Without dead ends: 86 [2023-11-23 06:55:39,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2023-11-23 06:55:39,453 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 175 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:39,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 161 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 06:55:39,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-23 06:55:39,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-23 06:55:39,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-23 06:55:39,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2023-11-23 06:55:39,458 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 81 [2023-11-23 06:55:39,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:39,459 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2023-11-23 06:55:39,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-23 06:55:39,459 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2023-11-23 06:55:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-23 06:55:39,464 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:55:39,464 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 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 06:55:39,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-23 06:55:39,464 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:55:39,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:55:39,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1819593053, now seen corresponding path program 1 times [2023-11-23 06:55:39,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:55:39,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133512005] [2023-11-23 06:55:39,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:55:39,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:55:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:41,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:41,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:41,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:55:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:41,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:55:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:41,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:41,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:41,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 06:55:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:41,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 06:55:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:41,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 06:55:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:41,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:41,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:55:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:41,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:55:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:41,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 06:55:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:41,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 06:55:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:41,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 06:55:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:55:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 06:55:41,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:55:41,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133512005] [2023-11-23 06:55:41,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133512005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:55:41,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:55:41,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-23 06:55:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101919628] [2023-11-23 06:55:41,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:55:41,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 06:55:41,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:55:41,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 06:55:41,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-23 06:55:41,431 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 14 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 7 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2023-11-23 06:55:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:55:42,594 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2023-11-23 06:55:42,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 06:55:42,594 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 7 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 106 [2023-11-23 06:55:42,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:55:42,595 INFO L225 Difference]: With dead ends: 86 [2023-11-23 06:55:42,595 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 06:55:42,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2023-11-23 06:55:42,596 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 133 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 06:55:42,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 154 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 06:55:42,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 06:55:42,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 06:55:42,596 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 06:55:42,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 06:55:42,597 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2023-11-23 06:55:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:55:42,597 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 06:55:42,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 7 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2023-11-23 06:55:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 06:55:42,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 06:55:42,599 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 06:55:42,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-23 06:55:42,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 06:55:43,584 INFO L899 garLoopResultBuilder]: For program point L6877-1(lines 6877 6879) no Hoare annotation was computed. [2023-11-23 06:55:43,584 INFO L895 garLoopResultBuilder]: At program point L6877(lines 6877 6879) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2023-11-23 06:55:43,584 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6876 6881) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2023-11-23 06:55:43,584 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6876 6881) no Hoare annotation was computed. [2023-11-23 06:55:43,584 INFO L899 garLoopResultBuilder]: For program point aws_mem_acquireEXIT(lines 6922 6932) no Hoare annotation was computed. [2023-11-23 06:55:43,584 INFO L899 garLoopResultBuilder]: For program point L6928-2(lines 6928 6930) no Hoare annotation was computed. [2023-11-23 06:55:43,584 INFO L899 garLoopResultBuilder]: For program point L6927(line 6927) no Hoare annotation was computed. [2023-11-23 06:55:43,584 INFO L899 garLoopResultBuilder]: For program point L6928(lines 6928 6930) no Hoare annotation was computed. [2023-11-23 06:55:43,585 INFO L899 garLoopResultBuilder]: For program point L6929-1(line 6929) no Hoare annotation was computed. [2023-11-23 06:55:43,585 INFO L895 garLoopResultBuilder]: At program point L6929(line 6929) the Hoare annotation is: (and (= aws_mem_acquire_~mem~0.base 0) (= aws_mem_acquire_~mem~0.offset 0) (= ~tl_last_error~0 |old(~tl_last_error~0)|)) [2023-11-23 06:55:43,585 INFO L895 garLoopResultBuilder]: At program point L6923-1(line 6923) the Hoare annotation is: (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) [2023-11-23 06:55:43,585 INFO L895 garLoopResultBuilder]: At program point L6923(line 6923) the Hoare annotation is: (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) [2023-11-23 06:55:43,585 INFO L895 garLoopResultBuilder]: At program point L6925-1(line 6925) the Hoare annotation is: (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) [2023-11-23 06:55:43,585 INFO L895 garLoopResultBuilder]: At program point L6925(line 6925) the Hoare annotation is: (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) [2023-11-23 06:55:43,585 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6922 6932) the Hoare annotation is: (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) [2023-11-23 06:55:43,585 INFO L899 garLoopResultBuilder]: For program point L6923-2(line 6923) no Hoare annotation was computed. [2023-11-23 06:55:43,585 INFO L895 garLoopResultBuilder]: At program point L6894(line 6894) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2023-11-23 06:55:43,585 INFO L899 garLoopResultBuilder]: For program point L6896-1(line 6896) no Hoare annotation was computed. [2023-11-23 06:55:43,586 INFO L895 garLoopResultBuilder]: At program point L6896(line 6896) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2023-11-23 06:55:43,586 INFO L899 garLoopResultBuilder]: For program point L6894-3(lines 6894 6896) no Hoare annotation was computed. [2023-11-23 06:55:43,586 INFO L899 garLoopResultBuilder]: For program point L6894-1(lines 6894 6896) no Hoare annotation was computed. [2023-11-23 06:55:43,586 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6893 6897) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2023-11-23 06:55:43,586 INFO L899 garLoopResultBuilder]: For program point can_fail_mallocEXIT(lines 6893 6897) no Hoare annotation was computed. [2023-11-23 06:55:43,586 INFO L899 garLoopResultBuilder]: For program point L7162(line 7162) no Hoare annotation was computed. [2023-11-23 06:55:43,586 INFO L899 garLoopResultBuilder]: For program point L7162-4(line 7162) no Hoare annotation was computed. [2023-11-23 06:55:43,586 INFO L899 garLoopResultBuilder]: For program point L7162-3(line 7162) no Hoare annotation was computed. [2023-11-23 06:55:43,586 INFO L899 garLoopResultBuilder]: For program point L7162-2(line 7162) no Hoare annotation was computed. [2023-11-23 06:55:43,586 INFO L899 garLoopResultBuilder]: For program point L7162-8(line 7162) no Hoare annotation was computed. [2023-11-23 06:55:43,586 INFO L899 garLoopResultBuilder]: For program point L7162-6(line 7162) no Hoare annotation was computed. [2023-11-23 06:55:43,586 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7157 7163) the Hoare annotation is: true [2023-11-23 06:55:43,587 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7157 7163) no Hoare annotation was computed. [2023-11-23 06:55:43,587 INFO L899 garLoopResultBuilder]: For program point L7159-1(line 7159) no Hoare annotation was computed. [2023-11-23 06:55:43,587 INFO L899 garLoopResultBuilder]: For program point L7159(lines 7159 7162) no Hoare annotation was computed. [2023-11-23 06:55:43,587 INFO L899 garLoopResultBuilder]: For program point L7159-4(lines 7159 7160) no Hoare annotation was computed. [2023-11-23 06:55:43,587 INFO L899 garLoopResultBuilder]: For program point L7159-3(line 7159) no Hoare annotation was computed. [2023-11-23 06:55:43,587 INFO L899 garLoopResultBuilder]: For program point L7159-9(lines 7159 7162) no Hoare annotation was computed. [2023-11-23 06:55:43,587 INFO L899 garLoopResultBuilder]: For program point L7159-7(lines 7159 7162) no Hoare annotation was computed. [2023-11-23 06:55:43,587 INFO L899 garLoopResultBuilder]: For program point L7159-6(lines 7159 7160) no Hoare annotation was computed. [2023-11-23 06:55:43,587 INFO L899 garLoopResultBuilder]: For program point L7159-11(lines 7159 7162) no Hoare annotation was computed. [2023-11-23 06:55:43,587 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1988 1999) the Hoare annotation is: (= ~tl_last_error~0 |old(~tl_last_error~0)|) [2023-11-23 06:55:43,587 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2023-11-23 06:55:43,587 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-23 06:55:43,588 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-23 06:55:43,588 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-23 06:55:43,597 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-23 06:55:43,597 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-23 06:55:43,597 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-23 06:55:43,598 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2023-11-23 06:55:43,598 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 261) the Hoare annotation is: true [2023-11-23 06:55:43,598 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6917 6920) the Hoare annotation is: true [2023-11-23 06:55:43,598 INFO L899 garLoopResultBuilder]: For program point L6919-1(line 6919) no Hoare annotation was computed. [2023-11-23 06:55:43,598 INFO L902 garLoopResultBuilder]: At program point L6919(line 6919) the Hoare annotation is: true [2023-11-23 06:55:43,598 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validEXIT(lines 6917 6920) no Hoare annotation was computed. [2023-11-23 06:55:43,599 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-23 06:55:43,599 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-23 06:55:43,599 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-23 06:55:43,599 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-23 06:55:43,599 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6883 6885) the Hoare annotation is: true [2023-11-23 06:55:43,608 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6883 6885) no Hoare annotation was computed. [2023-11-23 06:55:43,608 INFO L899 garLoopResultBuilder]: For program point L7117-2(lines 7117 7121) no Hoare annotation was computed. [2023-11-23 06:55:43,608 INFO L895 garLoopResultBuilder]: At program point L8752(line 8752) the Hoare annotation is: (let ((.cse0 (select |#memory_int#3| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|))) (and (= (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) 24) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) 24)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1156#1.offset|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= (select .cse0 16) |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1156#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= (select .cse0 0) 0))) [2023-11-23 06:55:43,609 INFO L899 garLoopResultBuilder]: For program point L8752-1(line 8752) no Hoare annotation was computed. [2023-11-23 06:55:43,609 INFO L899 garLoopResultBuilder]: For program point L7117(lines 7117 7118) no Hoare annotation was computed. [2023-11-23 06:55:43,609 INFO L895 garLoopResultBuilder]: At program point L7126(line 7126) the Hoare annotation is: (let ((.cse0 (= (select (select |#memory_int#3| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) 0) 0)) (.cse1 (= (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) 24) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse2 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) 24))) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse9 (= (select (select |#memory_int#3| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) 16) |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|))) (or (and .cse0 (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) 8) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) 8) 0) .cse10 .cse11) (and .cse0 .cse1 .cse2 (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)) 1) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2023-11-23 06:55:43,609 INFO L899 garLoopResultBuilder]: For program point L7126-2(line 7126) no Hoare annotation was computed. [2023-11-23 06:55:43,609 INFO L895 garLoopResultBuilder]: At program point L7126-1(line 7126) the Hoare annotation is: (let ((.cse0 (= (select (select |#memory_int#3| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) 0) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_#t~ret596#1| 1)) (.cse2 (= (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) 24) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse3 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) 24))) (.cse8 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse10 (= (select (select |#memory_int#3| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) 16) |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|))) (or (and .cse0 (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) 8) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) 8) 0) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)) 1) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2023-11-23 06:55:43,609 INFO L899 garLoopResultBuilder]: For program point L8749(lines 8749 8755) no Hoare annotation was computed. [2023-11-23 06:55:43,610 INFO L899 garLoopResultBuilder]: For program point L8749-2(lines 8749 8755) no Hoare annotation was computed. [2023-11-23 06:55:43,610 INFO L895 garLoopResultBuilder]: At program point L8753(line 8753) the Hoare annotation is: (let ((.cse0 (select |#memory_int#3| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|))) (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= (select .cse0 16) |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1157#1| 0) (= (select .cse0 0) 0))) [2023-11-23 06:55:43,610 INFO L899 garLoopResultBuilder]: For program point L8753-1(line 8753) no Hoare annotation was computed. [2023-11-23 06:55:43,610 INFO L899 garLoopResultBuilder]: For program point L7114-1(lines 7114 7116) no Hoare annotation was computed. [2023-11-23 06:55:43,610 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 06:55:43,610 INFO L895 garLoopResultBuilder]: At program point L8754(line 8754) the Hoare annotation is: (and (= (+ (* (div |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1158#1| 18446744073709551616) 18446744073709551616) |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1158#1|)) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= (select (select |#memory_int#3| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) 16) |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) [2023-11-23 06:55:43,611 INFO L895 garLoopResultBuilder]: At program point L8746(line 8746) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) [2023-11-23 06:55:43,611 INFO L899 garLoopResultBuilder]: For program point L8754-1(line 8754) no Hoare annotation was computed. [2023-11-23 06:55:43,611 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 06:55:43,611 INFO L895 garLoopResultBuilder]: At program point L7111-1(line 7111) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) [2023-11-23 06:55:43,611 INFO L895 garLoopResultBuilder]: At program point L7111(line 7111) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) [2023-11-23 06:55:43,611 INFO L899 garLoopResultBuilder]: For program point L8746-1(line 8746) no Hoare annotation was computed. [2023-11-23 06:55:43,611 INFO L899 garLoopResultBuilder]: For program point L8751-2(line 8751) no Hoare annotation was computed. [2023-11-23 06:55:43,612 INFO L899 garLoopResultBuilder]: For program point L7116-1(line 7116) no Hoare annotation was computed. [2023-11-23 06:55:43,612 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_init_returnLabel#1(lines 7110 7128) no Hoare annotation was computed. [2023-11-23 06:55:43,612 INFO L895 garLoopResultBuilder]: At program point L7116(line 7116) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (<= (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)) 1) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) [2023-11-23 06:55:43,612 INFO L895 garLoopResultBuilder]: At program point L8751(line 8751) the Hoare annotation is: (let ((.cse10 (select |#memory_int#3| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|))) (let ((.cse2 (select .cse10 16)) (.cse9 (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|)) (.cse8 (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|))) (let ((.cse0 (= (select .cse8 24) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse1 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select .cse9 24))) (.cse5 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse6 (= .cse2 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|)) (.cse7 (= (select .cse10 0) 0))) (or (and .cse0 .cse1 (or (< .cse2 (+ 18446744073709551616 (* 18446744073709551616 (div (+ .cse2 (- 36028797018963968)) 18446744073709551616)))) (< .cse2 (+ (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616)) 36028797018963968))) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 (= (select .cse8 8) 0) .cse1 .cse3 (= (select .cse9 8) 0) .cse4 .cse5 .cse6 .cse7))))) [2023-11-23 06:55:43,613 INFO L895 garLoopResultBuilder]: At program point L8751-1(line 8751) the Hoare annotation is: (let ((.cse0 (select |#memory_int#3| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|))) (and (= (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) 24) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) 24)) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= (select .cse0 16) |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1155#1| 1) (= (select .cse0 0) 0))) [2023-11-23 06:55:43,614 INFO L899 garLoopResultBuilder]: For program point L7112(lines 7110 7128) no Hoare annotation was computed. [2023-11-23 06:55:43,616 INFO L445 BasicCegarLoop]: Path program 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 06:55:43,618 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 06:55:43,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:55:43 BoogieIcfgContainer [2023-11-23 06:55:43,626 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 06:55:43,626 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 06:55:43,626 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 06:55:43,626 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 06:55:43,627 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:54:46" (3/4) ... [2023-11-23 06:55:43,628 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 06:55:43,634 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_allocator_is_valid [2023-11-23 06:55:43,635 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_malloc [2023-11-23 06:55:43,635 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2023-11-23 06:55:43,635 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_acquire [2023-11-23 06:55:43,635 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2023-11-23 06:55:43,635 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2023-11-23 06:55:43,635 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-23 06:55:43,636 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-23 06:55:43,636 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2023-11-23 06:55:43,636 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2023-11-23 06:55:43,669 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 132 nodes and edges [2023-11-23 06:55:43,681 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2023-11-23 06:55:43,682 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2023-11-23 06:55:43,684 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-23 06:55:43,684 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-23 06:55:43,685 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 06:55:43,686 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-23 06:55:43,687 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 06:55:44,108 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 06:55:44,108 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 06:55:44,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 06:55:44,109 INFO L158 Benchmark]: Toolchain (without parser) took 61085.19ms. Allocated memory was 182.5MB in the beginning and 1.1GB in the end (delta: 935.3MB). Free memory was 102.6MB in the beginning and 691.9MB in the end (delta: -589.3MB). Peak memory consumption was 346.4MB. Max. memory is 16.1GB. [2023-11-23 06:55:44,110 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 78.2MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 06:55:44,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2122.36ms. Allocated memory is still 182.5MB. Free memory was 102.3MB in the beginning and 76.8MB in the end (delta: 25.5MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2023-11-23 06:55:44,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 187.15ms. Allocated memory is still 182.5MB. Free memory was 76.8MB in the beginning and 65.5MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-23 06:55:44,111 INFO L158 Benchmark]: Boogie Preprocessor took 213.02ms. Allocated memory is still 182.5MB. Free memory was 65.5MB in the beginning and 114.3MB in the end (delta: -48.8MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2023-11-23 06:55:44,111 INFO L158 Benchmark]: RCFGBuilder took 1388.17ms. Allocated memory was 182.5MB in the beginning and 260.0MB in the end (delta: 77.6MB). Free memory was 114.3MB in the beginning and 109.6MB in the end (delta: 4.7MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2023-11-23 06:55:44,111 INFO L158 Benchmark]: TraceAbstraction took 56685.39ms. Allocated memory was 260.0MB in the beginning and 1.1GB in the end (delta: 857.7MB). Free memory was 108.6MB in the beginning and 824.0MB in the end (delta: -715.5MB). Peak memory consumption was 142.3MB. Max. memory is 16.1GB. [2023-11-23 06:55:44,112 INFO L158 Benchmark]: Witness Printer took 482.52ms. Allocated memory is still 1.1GB. Free memory was 824.0MB in the beginning and 691.9MB in the end (delta: 132.2MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2023-11-23 06:55:44,113 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.17ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 78.2MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2122.36ms. Allocated memory is still 182.5MB. Free memory was 102.3MB in the beginning and 76.8MB in the end (delta: 25.5MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 187.15ms. Allocated memory is still 182.5MB. Free memory was 76.8MB in the beginning and 65.5MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 213.02ms. Allocated memory is still 182.5MB. Free memory was 65.5MB in the beginning and 114.3MB in the end (delta: -48.8MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1388.17ms. Allocated memory was 182.5MB in the beginning and 260.0MB in the end (delta: 77.6MB). Free memory was 114.3MB in the beginning and 109.6MB in the end (delta: 4.7MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * TraceAbstraction took 56685.39ms. Allocated memory was 260.0MB in the beginning and 1.1GB in the end (delta: 857.7MB). Free memory was 108.6MB in the beginning and 824.0MB in the end (delta: -715.5MB). Peak memory consumption was 142.3MB. Max. memory is 16.1GB. * Witness Printer took 482.52ms. Allocated memory is still 1.1GB. Free memory was 824.0MB in the beginning and 691.9MB in the end (delta: 132.2MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 8051]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8051] - GenericResultAtLocation [Line: 8537]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8537-8548] * 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 11 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.6s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1861 SdHoareTripleChecker+Valid, 16.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1750 mSDsluCounter, 11677 SdHoareTripleChecker+Invalid, 15.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9606 mSDsCounter, 398 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6069 IncrementalHoareTripleChecker+Invalid, 6467 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 398 mSolverCounterUnsat, 2071 mSDtfsCounter, 6069 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 802 GetRequests, 506 SyntacticMatches, 2 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=21, InterpolantAutomatonStates: 239, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 267 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 201 PreInvPairs, 223 NumberOfFragments, 753 HoareAnnotationTreeSize, 201 FomulaSimplifications, 5923 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 30 FomulaSimplificationsInter, 1042 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 31.5s InterpolantComputationTime, 1526 NumberOfCodeBlocks, 1526 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1554 ConstructedInterpolants, 18 QuantifiedInterpolants, 7789 SizeOfPredicates, 20 NumberOfNonLiveVariables, 2448 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 29 InterpolantComputations, 26 PerfectInterpolantSequences, 479/496 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-23 06:55:44,138 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