./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_byte_buf_append_dynamic_harness.i --full-output --preprocessor.use.memory.slicer false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_byte_buf_append_dynamic_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 b1e17fda858e874821809b4efef78fd91cf6fdf1723d3ff0faf91ee901e13b86 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:07:42,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:07:42,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:07:42,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:07:42,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:07:42,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:07:42,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:07:42,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:07:42,772 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:07:42,773 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:07:42,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:07:42,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:07:42,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:07:42,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:07:42,777 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:07:42,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:07:42,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:07:42,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:07:42,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:07:42,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:07:42,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:07:42,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:07:42,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:07:42,780 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:07:42,780 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:07:42,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:07:42,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:07:42,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:07:42,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:07:42,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:07:42,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:07:42,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:07:42,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:07:42,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:07:42,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:07:42,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:07:42,783 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:07:42,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:07:42,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:07:42,784 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 -> b1e17fda858e874821809b4efef78fd91cf6fdf1723d3ff0faf91ee901e13b86 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:07:42,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:07:42,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:07:42,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:07:42,961 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:07:42,961 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:07:42,962 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_append_dynamic_harness.i [2023-11-23 08:07:44,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:07:44,540 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:07:44,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_append_dynamic_harness.i [2023-11-23 08:07:44,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3cebc508/75570a79601e43138bc720c32240da8d/FLAG238620c27 [2023-11-23 08:07:44,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3cebc508/75570a79601e43138bc720c32240da8d [2023-11-23 08:07:44,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:07:44,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:07:44,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:07:44,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:07:44,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:07:44,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:07:44" (1/1) ... [2023-11-23 08:07:44,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48cd19ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:07:44, skipping insertion in model container [2023-11-23 08:07:44,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:07:44" (1/1) ... [2023-11-23 08:07:44,683 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:07:44,854 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_append_dynamic_harness.i[4501,4514] [2023-11-23 08:07:44,863 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_append_dynamic_harness.i[4561,4574] [2023-11-23 08:07:45,450 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:45,452 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:45,453 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:45,456 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:45,457 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:45,469 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:45,484 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:45,486 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:45,486 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:45,720 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:07:45,721 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:07:45,722 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:07:45,722 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:07:45,723 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:07:45,724 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:07:45,724 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:07:45,725 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:07:45,725 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:07:45,725 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:07:45,870 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:45,870 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:45,933 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:45,934 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:46,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:07:46,062 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:07:46,077 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_append_dynamic_harness.i[4501,4514] [2023-11-23 08:07:46,078 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_append_dynamic_harness.i[4561,4574] [2023-11-23 08:07:46,103 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:46,104 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:46,104 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:46,104 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:46,105 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:46,112 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:46,113 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:46,114 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:46,114 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:46,137 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:07:46,139 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:07:46,139 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:07:46,139 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:07:46,140 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:07:46,140 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:07:46,141 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:07:46,141 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:07:46,141 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:07:46,141 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:07:46,169 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:46,170 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:46,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8297] [2023-11-23 08:07:46,208 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:46,208 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:07:46,216 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8783-8794] [2023-11-23 08:07:46,237 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:07:46,382 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,382 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,382 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,383 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,383 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,383 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,383 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,383 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,383 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,383 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,383 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,383 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,384 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,384 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,384 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,384 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,384 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,384 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:07:46,390 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:07:46,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:07:46 WrapperNode [2023-11-23 08:07:46,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:07:46,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:07:46,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:07:46,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:07:46,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:07:46" (1/1) ... [2023-11-23 08:07:46,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:07:46" (1/1) ... [2023-11-23 08:07:46,588 INFO L138 Inliner]: procedures = 690, calls = 2640, calls flagged for inlining = 61, calls inlined = 11, statements flattened = 1066 [2023-11-23 08:07:46,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:07:46,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:07:46,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:07:46,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:07:46,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:07:46" (1/1) ... [2023-11-23 08:07:46,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:07:46" (1/1) ... [2023-11-23 08:07:46,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:07:46" (1/1) ... [2023-11-23 08:07:46,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:07:46" (1/1) ... [2023-11-23 08:07:46,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:07:46" (1/1) ... [2023-11-23 08:07:46,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:07:46" (1/1) ... [2023-11-23 08:07:46,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:07:46" (1/1) ... [2023-11-23 08:07:46,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:07:46" (1/1) ... [2023-11-23 08:07:46,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:07:46,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:07:46,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:07:46,691 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:07:46,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:07:46" (1/1) ... [2023-11-23 08:07:46,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:07:46,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:07:46,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 08:07:46,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 08:07:46,807 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2023-11-23 08:07:46,807 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2023-11-23 08:07:46,807 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2023-11-23 08:07:46,807 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2023-11-23 08:07:46,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:07:46,808 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-23 08:07:46,808 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-23 08:07:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2023-11-23 08:07:46,809 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2023-11-23 08:07:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 08:07:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2023-11-23 08:07:46,809 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2023-11-23 08:07:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:07:46,809 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:07:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:07:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:07:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:07:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2023-11-23 08:07:46,810 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2023-11-23 08:07:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:07:46,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:07:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 08:07:46,811 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 08:07:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2023-11-23 08:07:46,811 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2023-11-23 08:07:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2023-11-23 08:07:46,812 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2023-11-23 08:07:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:07:46,812 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:07:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2023-11-23 08:07:46,812 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2023-11-23 08:07:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2023-11-23 08:07:46,812 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2023-11-23 08:07:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:07:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2023-11-23 08:07:46,813 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2023-11-23 08:07:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:07:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:07:46,814 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-23 08:07:46,814 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-23 08:07:46,814 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2023-11-23 08:07:46,814 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2023-11-23 08:07:46,814 INFO L130 BoogieDeclarations]: Found specification of procedure assert_bytes_match [2023-11-23 08:07:46,814 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_bytes_match [2023-11-23 08:07:46,814 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:07:46,814 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:07:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 08:07:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:07:47,048 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:07:47,050 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:07:47,822 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:07:47,947 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:07:47,947 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 08:07:47,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:07:47 BoogieIcfgContainer [2023-11-23 08:07:47,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:07:47,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:07:47,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:07:47,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:07:47,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:07:44" (1/3) ... [2023-11-23 08:07:47,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd3a47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:07:47, skipping insertion in model container [2023-11-23 08:07:47,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:07:46" (2/3) ... [2023-11-23 08:07:47,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd3a47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:07:47, skipping insertion in model container [2023-11-23 08:07:47,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:07:47" (3/3) ... [2023-11-23 08:07:47,955 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_append_dynamic_harness.i [2023-11-23 08:07:47,967 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:07:47,967 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:07:48,009 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:07:48,017 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;@203d27f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:07:48,017 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:07:48,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 225 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 134 states have internal predecessors, (170), 72 states have call successors, (72), 18 states have call predecessors, (72), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2023-11-23 08:07:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-23 08:07:48,031 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:07:48,031 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-23 08:07:48,032 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:07:48,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:07:48,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1947267681, now seen corresponding path program 1 times [2023-11-23 08:07:48,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:07:48,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504947205] [2023-11-23 08:07:48,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:07:48,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:07:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:48,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:07:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:48,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:07:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:48,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:07:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:48,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:07:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:48,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:07:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:48,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:07:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:48,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:07:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:48,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:07:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:48,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:07:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:48,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:07:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:48,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 08:07:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:48,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:07:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:48,681 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-23 08:07:48,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:07:48,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504947205] [2023-11-23 08:07:48,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504947205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:07:48,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:07:48,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 08:07:48,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136155544] [2023-11-23 08:07:48,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:07:48,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 08:07:48,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:07:48,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 08:07:48,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 08:07:48,749 INFO L87 Difference]: Start difference. First operand has 225 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 134 states have internal predecessors, (170), 72 states have call successors, (72), 18 states have call predecessors, (72), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 08:07:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:07:49,242 INFO L93 Difference]: Finished difference Result 453 states and 675 transitions. [2023-11-23 08:07:49,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 08:07:49,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 73 [2023-11-23 08:07:49,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:07:49,252 INFO L225 Difference]: With dead ends: 453 [2023-11-23 08:07:49,253 INFO L226 Difference]: Without dead ends: 233 [2023-11-23 08:07:49,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 08:07:49,259 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 94 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:07:49,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 271 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 08:07:49,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-11-23 08:07:49,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 223. [2023-11-23 08:07:49,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 132 states have (on average 1.25) internal successors, (165), 133 states have internal predecessors, (165), 72 states have call successors, (72), 18 states have call predecessors, (72), 18 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2023-11-23 08:07:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 308 transitions. [2023-11-23 08:07:49,302 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 308 transitions. Word has length 73 [2023-11-23 08:07:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:07:49,302 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 308 transitions. [2023-11-23 08:07:49,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 08:07:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 308 transitions. [2023-11-23 08:07:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-23 08:07:49,305 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:07:49,305 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-23 08:07:49,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:07:49,306 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:07:49,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:07:49,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2136276425, now seen corresponding path program 1 times [2023-11-23 08:07:49,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:07:49,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693869795] [2023-11-23 08:07:49,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:07:49,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:07:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:49,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:07:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:49,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:07:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:49,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:07:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:49,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:07:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:49,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:07:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:49,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:07:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:49,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:07:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:49,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:07:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:07:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:49,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:07:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:49,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 08:07:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:49,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:07:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-11-23 08:07:49,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:07:49,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693869795] [2023-11-23 08:07:49,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693869795] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:07:49,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521377576] [2023-11-23 08:07:49,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:07:49,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:07:49,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:07:49,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:07:49,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 08:07:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:50,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 2547 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 08:07:50,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:07:50,415 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 08:07:50,415 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:07:50,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521377576] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:07:50,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:07:50,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-11-23 08:07:50,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255189828] [2023-11-23 08:07:50,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:07:50,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:07:50,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:07:50,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:07:50,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:07:50,418 INFO L87 Difference]: Start difference. First operand 223 states and 308 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-23 08:07:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:07:50,651 INFO L93 Difference]: Finished difference Result 439 states and 610 transitions. [2023-11-23 08:07:50,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:07:50,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 75 [2023-11-23 08:07:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:07:50,654 INFO L225 Difference]: With dead ends: 439 [2023-11-23 08:07:50,654 INFO L226 Difference]: Without dead ends: 225 [2023-11-23 08:07:50,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:07:50,656 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 87 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:07:50,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 963 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:07:50,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-11-23 08:07:50,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2023-11-23 08:07:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 133 states have (on average 1.2481203007518797) internal successors, (166), 135 states have internal predecessors, (166), 72 states have call successors, (72), 18 states have call predecessors, (72), 19 states have return successors, (76), 71 states have call predecessors, (76), 71 states have call successors, (76) [2023-11-23 08:07:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 314 transitions. [2023-11-23 08:07:50,672 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 314 transitions. Word has length 75 [2023-11-23 08:07:50,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:07:50,673 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 314 transitions. [2023-11-23 08:07:50,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-23 08:07:50,673 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 314 transitions. [2023-11-23 08:07:50,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 08:07:50,675 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:07:50,675 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-23 08:07:50,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 08:07:50,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:07:50,890 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:07:50,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:07:50,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1914798430, now seen corresponding path program 1 times [2023-11-23 08:07:50,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:07:50,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471726507] [2023-11-23 08:07:50,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:07:50,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:07:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:51,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:07:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:51,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:07:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:51,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:07:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:51,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:07:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:51,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:07:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:51,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 08:07:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:51,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:07:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:51,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:07:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:51,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:07:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:51,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 08:07:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:51,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 08:07:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:51,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 08:07:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-11-23 08:07:51,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:07:51,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471726507] [2023-11-23 08:07:51,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471726507] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:07:51,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199690551] [2023-11-23 08:07:51,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:07:51,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:07:51,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:07:51,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:07:51,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 08:07:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:51,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 2564 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 08:07:51,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:07:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 08:07:51,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:07:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-11-23 08:07:51,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199690551] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:07:51,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:07:51,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-23 08:07:51,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814995984] [2023-11-23 08:07:51,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:07:51,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 08:07:51,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:07:51,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 08:07:51,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:07:51,966 INFO L87 Difference]: Start difference. First operand 225 states and 314 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 7 states have call successors, (31), 4 states have call predecessors, (31), 5 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) [2023-11-23 08:07:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:07:52,830 INFO L93 Difference]: Finished difference Result 445 states and 622 transitions. [2023-11-23 08:07:52,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:07:52,830 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 7 states have call successors, (31), 4 states have call predecessors, (31), 5 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) Word has length 81 [2023-11-23 08:07:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:07:52,832 INFO L225 Difference]: With dead ends: 445 [2023-11-23 08:07:52,832 INFO L226 Difference]: Without dead ends: 237 [2023-11-23 08:07:52,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2023-11-23 08:07:52,834 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 467 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 08:07:52,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 556 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 08:07:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-11-23 08:07:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 227. [2023-11-23 08:07:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 134 states have (on average 1.2462686567164178) internal successors, (167), 137 states have internal predecessors, (167), 72 states have call successors, (72), 18 states have call predecessors, (72), 20 states have return successors, (81), 71 states have call predecessors, (81), 71 states have call successors, (81) [2023-11-23 08:07:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 320 transitions. [2023-11-23 08:07:52,849 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 320 transitions. Word has length 81 [2023-11-23 08:07:52,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:07:52,849 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 320 transitions. [2023-11-23 08:07:52,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 7 states have call successors, (31), 4 states have call predecessors, (31), 5 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) [2023-11-23 08:07:52,850 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 320 transitions. [2023-11-23 08:07:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-23 08:07:52,851 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:07:52,851 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-23 08:07:52,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 08:07:53,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-23 08:07:53,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:07:53,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:07:53,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1476561671, now seen corresponding path program 1 times [2023-11-23 08:07:53,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:07:53,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383450986] [2023-11-23 08:07:53,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:07:53,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:07:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:53,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:07:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:53,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:07:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:53,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:07:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:53,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:07:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:53,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:07:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:53,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 08:07:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:53,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:07:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:53,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:07:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:53,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:07:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:53,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:07:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:53,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:07:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:53,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 08:07:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:53,477 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-11-23 08:07:53,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:07:53,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383450986] [2023-11-23 08:07:53,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383450986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:07:53,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:07:53,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:07:53,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134569794] [2023-11-23 08:07:53,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:07:53,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:07:53,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:07:53,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:07:53,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:07:53,482 INFO L87 Difference]: Start difference. First operand 227 states and 320 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-23 08:07:54,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:07:54,098 INFO L93 Difference]: Finished difference Result 444 states and 620 transitions. [2023-11-23 08:07:54,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:07:54,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 83 [2023-11-23 08:07:54,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:07:54,101 INFO L225 Difference]: With dead ends: 444 [2023-11-23 08:07:54,101 INFO L226 Difference]: Without dead ends: 235 [2023-11-23 08:07:54,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:07:54,102 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 230 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 08:07:54,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 527 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 08:07:54,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-11-23 08:07:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 225. [2023-11-23 08:07:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 133 states have (on average 1.2406015037593985) internal successors, (165), 135 states have internal predecessors, (165), 72 states have call successors, (72), 18 states have call predecessors, (72), 19 states have return successors, (76), 71 states have call predecessors, (76), 71 states have call successors, (76) [2023-11-23 08:07:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 313 transitions. [2023-11-23 08:07:54,115 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 313 transitions. Word has length 83 [2023-11-23 08:07:54,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:07:54,116 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 313 transitions. [2023-11-23 08:07:54,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-23 08:07:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 313 transitions. [2023-11-23 08:07:54,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-23 08:07:54,118 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:07:54,118 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:07:54,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 08:07:54,118 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:07:54,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:07:54,119 INFO L85 PathProgramCache]: Analyzing trace with hash -246645372, now seen corresponding path program 1 times [2023-11-23 08:07:54,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:07:54,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633651235] [2023-11-23 08:07:54,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:07:54,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:07:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:54,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:07:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:54,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:07:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:54,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:07:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:54,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:07:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:54,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:07:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:54,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 08:07:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:54,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:07:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:54,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:07:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:54,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:07:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:54,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:07:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:54,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 08:07:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:54,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:07:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-11-23 08:07:54,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:07:54,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633651235] [2023-11-23 08:07:54,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633651235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:07:54,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:07:54,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:07:54,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232399368] [2023-11-23 08:07:54,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:07:54,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:07:54,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:07:54,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:07:54,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:07:54,441 INFO L87 Difference]: Start difference. First operand 225 states and 313 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-23 08:07:55,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:07:55,120 INFO L93 Difference]: Finished difference Result 437 states and 601 transitions. [2023-11-23 08:07:55,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:07:55,121 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 89 [2023-11-23 08:07:55,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:07:55,122 INFO L225 Difference]: With dead ends: 437 [2023-11-23 08:07:55,122 INFO L226 Difference]: Without dead ends: 233 [2023-11-23 08:07:55,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:07:55,124 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 220 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 08:07:55,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 556 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 08:07:55,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-11-23 08:07:55,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 223. [2023-11-23 08:07:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 132 states have (on average 1.2348484848484849) internal successors, (163), 133 states have internal predecessors, (163), 72 states have call successors, (72), 18 states have call predecessors, (72), 18 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2023-11-23 08:07:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 306 transitions. [2023-11-23 08:07:55,134 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 306 transitions. Word has length 89 [2023-11-23 08:07:55,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:07:55,134 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 306 transitions. [2023-11-23 08:07:55,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-23 08:07:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 306 transitions. [2023-11-23 08:07:55,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-23 08:07:55,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:07:55,136 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:07:55,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 08:07:55,136 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:07:55,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:07:55,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2063287649, now seen corresponding path program 1 times [2023-11-23 08:07:55,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:07:55,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328534881] [2023-11-23 08:07:55,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:07:55,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:07:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:55,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:07:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:55,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:07:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:55,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:07:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:55,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:07:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:55,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:07:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:55,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 08:07:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:55,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:07:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:56,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:07:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:56,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:07:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:56,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:07:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:56,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 08:07:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:56,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 08:07:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-11-23 08:07:56,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:07:56,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328534881] [2023-11-23 08:07:56,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328534881] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:07:56,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196135702] [2023-11-23 08:07:56,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:07:56,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:07:56,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:07:56,040 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:07:56,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 08:07:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:56,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 2591 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-23 08:07:56,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:07:56,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 08:07:56,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 08:07:56,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-23 08:07:56,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-23 08:07:57,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:07:57,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-23 08:07:57,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:07:57,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-23 08:07:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-23 08:07:57,587 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:07:57,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196135702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:07:57,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:07:57,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2023-11-23 08:07:57,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109319564] [2023-11-23 08:07:57,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:07:57,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:07:57,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:07:57,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:07:57,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2023-11-23 08:07:57,589 INFO L87 Difference]: Start difference. First operand 223 states and 306 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-23 08:07:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:07:58,461 INFO L93 Difference]: Finished difference Result 521 states and 700 transitions. [2023-11-23 08:07:58,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 08:07:58,461 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 91 [2023-11-23 08:07:58,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:07:58,463 INFO L225 Difference]: With dead ends: 521 [2023-11-23 08:07:58,463 INFO L226 Difference]: Without dead ends: 327 [2023-11-23 08:07:58,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 86 SyntacticMatches, 20 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2023-11-23 08:07:58,465 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 100 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 08:07:58,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1675 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 08:07:58,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-11-23 08:07:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2023-11-23 08:07:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 197 states have (on average 1.2284263959390862) internal successors, (242), 199 states have internal predecessors, (242), 99 states have call successors, (99), 28 states have call predecessors, (99), 28 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2023-11-23 08:07:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 438 transitions. [2023-11-23 08:07:58,482 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 438 transitions. Word has length 91 [2023-11-23 08:07:58,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:07:58,482 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 438 transitions. [2023-11-23 08:07:58,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-23 08:07:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 438 transitions. [2023-11-23 08:07:58,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-23 08:07:58,483 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:07:58,484 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:07:58,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 08:07:58,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:07:58,703 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:07:58,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:07:58,703 INFO L85 PathProgramCache]: Analyzing trace with hash 935883734, now seen corresponding path program 1 times [2023-11-23 08:07:58,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:07:58,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578811076] [2023-11-23 08:07:58,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:07:58,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:07:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:59,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:07:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:59,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:07:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:59,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:07:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:59,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:07:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:59,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:07:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:59,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 08:07:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:59,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:07:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:59,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:07:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:59,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:07:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:59,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:07:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:59,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 08:07:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:59,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 08:07:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:59,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-23 08:07:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:07:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-23 08:07:59,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:07:59,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578811076] [2023-11-23 08:07:59,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578811076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:07:59,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:07:59,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 08:07:59,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279006502] [2023-11-23 08:07:59,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:07:59,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:07:59,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:07:59,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:07:59,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:07:59,102 INFO L87 Difference]: Start difference. First operand 325 states and 438 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-23 08:07:59,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:07:59,871 INFO L93 Difference]: Finished difference Result 482 states and 641 transitions. [2023-11-23 08:07:59,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:07:59,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2023-11-23 08:07:59,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:07:59,873 INFO L225 Difference]: With dead ends: 482 [2023-11-23 08:07:59,874 INFO L226 Difference]: Without dead ends: 356 [2023-11-23 08:07:59,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:07:59,874 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 184 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 08:07:59,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 856 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 08:07:59,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-11-23 08:07:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 325. [2023-11-23 08:07:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 198 states have (on average 1.2222222222222223) internal successors, (242), 200 states have internal predecessors, (242), 98 states have call successors, (98), 28 states have call predecessors, (98), 28 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-23 08:07:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 436 transitions. [2023-11-23 08:07:59,893 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 436 transitions. Word has length 93 [2023-11-23 08:07:59,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:07:59,894 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 436 transitions. [2023-11-23 08:07:59,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-23 08:07:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 436 transitions. [2023-11-23 08:07:59,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-23 08:07:59,895 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:07:59,895 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:07:59,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 08:07:59,895 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:07:59,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:07:59,896 INFO L85 PathProgramCache]: Analyzing trace with hash 851142419, now seen corresponding path program 1 times [2023-11-23 08:07:59,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:07:59,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532354723] [2023-11-23 08:07:59,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:07:59,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:07:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:02,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:08:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:02,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:08:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:02,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:08:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:02,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:08:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:02,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:08:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:02,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 08:08:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:02,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:08:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:02,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:08:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:02,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:08:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:02,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:08:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:02,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 08:08:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:02,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 08:08:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:02,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-23 08:08:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:02,445 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-23 08:08:02,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:08:02,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532354723] [2023-11-23 08:08:02,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532354723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:08:02,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:08:02,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-23 08:08:02,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285131641] [2023-11-23 08:08:02,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:08:02,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-23 08:08:02,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:08:02,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-23 08:08:02,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2023-11-23 08:08:02,447 INFO L87 Difference]: Start difference. First operand 325 states and 436 transitions. Second operand has 16 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 8 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-23 08:08:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:08:04,446 INFO L93 Difference]: Finished difference Result 450 states and 620 transitions. [2023-11-23 08:08:04,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-23 08:08:04,446 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 8 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 95 [2023-11-23 08:08:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:08:04,449 INFO L225 Difference]: With dead ends: 450 [2023-11-23 08:08:04,449 INFO L226 Difference]: Without dead ends: 448 [2023-11-23 08:08:04,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2023-11-23 08:08:04,450 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 324 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-23 08:08:04,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1163 Invalid, 2579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 2250 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-23 08:08:04,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-11-23 08:08:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 358. [2023-11-23 08:08:04,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 218 states have (on average 1.2110091743119267) internal successors, (264), 221 states have internal predecessors, (264), 107 states have call successors, (107), 32 states have call predecessors, (107), 32 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2023-11-23 08:08:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 476 transitions. [2023-11-23 08:08:04,474 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 476 transitions. Word has length 95 [2023-11-23 08:08:04,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:08:04,474 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 476 transitions. [2023-11-23 08:08:04,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 8 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-23 08:08:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 476 transitions. [2023-11-23 08:08:04,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-23 08:08:04,476 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:08:04,476 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:08:04,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 08:08:04,476 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:08:04,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:08:04,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1847110394, now seen corresponding path program 1 times [2023-11-23 08:08:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:08:04,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429268537] [2023-11-23 08:08:04,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:08:04,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:08:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:05,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:08:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:05,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:08:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:05,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:08:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:05,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:08:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:05,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:08:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:05,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:08:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:05,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:08:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:05,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:08:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:05,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:08:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:05,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:08:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:05,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 08:08:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:05,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 08:08:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:05,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:08:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-11-23 08:08:05,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:08:05,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429268537] [2023-11-23 08:08:05,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429268537] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:08:05,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031859069] [2023-11-23 08:08:05,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:08:05,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:08:05,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:08:05,388 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:08:05,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 08:08:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:08:05,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 2603 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-23 08:08:05,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:08:05,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 08:08:05,979 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 08:08:05,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-23 08:08:06,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 08:08:06,388 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 08:08:06,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 15 [2023-11-23 08:08:12,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-11-23 08:08:29,168 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:08:29,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:08:30,031 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_474 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base| v_ArrVal_474) |c_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.offset| 8)) 0))) is different from false [2023-11-23 08:08:30,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031859069] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:08:30,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:08:30,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 23] total 31 [2023-11-23 08:08:30,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316951863] [2023-11-23 08:08:30,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:08:30,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-23 08:08:30,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:08:30,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-23 08:08:30,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1350, Unknown=2, NotChecked=74, Total=1560 [2023-11-23 08:08:30,042 INFO L87 Difference]: Start difference. First operand 358 states and 476 transitions. Second operand has 31 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 11 states have call successors, (27), 7 states have call predecessors, (27), 9 states have return successors, (26), 11 states have call predecessors, (26), 11 states have call successors, (26) [2023-11-23 08:08:34,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:08:36,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:08:38,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:08:40,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:08:42,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:08:48,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:08:50,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:08:57,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:08:59,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:01,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:03,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:05,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:07,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:10,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:12,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:14,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:16,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:18,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:20,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:22,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:24,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:26,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:28,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:30,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:33,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:35,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:37,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:39,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:42,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:44,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:46,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:48,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:50,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:53,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:55,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:57,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:09:59,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:01,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:03,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:05,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:07,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:09,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:11,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:13,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:15,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:17,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:20,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:23,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:25,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:27,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:29,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:31,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:33,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:35,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:37,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:39,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:41,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:44,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:46,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:49,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:51,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:53,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:55,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:57,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:59,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:01,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:03,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:07,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:09,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:11,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:13,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:15,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:17,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:19,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:21,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:24,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:26,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:28,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:30,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:32,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:35,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:37,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:37,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:11:37,959 INFO L93 Difference]: Finished difference Result 1267 states and 1722 transitions. [2023-11-23 08:11:37,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-11-23 08:11:37,959 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 11 states have call successors, (27), 7 states have call predecessors, (27), 9 states have return successors, (26), 11 states have call predecessors, (26), 11 states have call successors, (26) Word has length 95 [2023-11-23 08:11:37,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:11:37,964 INFO L225 Difference]: With dead ends: 1267 [2023-11-23 08:11:37,964 INFO L226 Difference]: Without dead ends: 921 [2023-11-23 08:11:37,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 156 SyntacticMatches, 11 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2266 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=820, Invalid=7369, Unknown=5, NotChecked=178, Total=8372 [2023-11-23 08:11:37,968 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 1171 mSDsluCounter, 2410 mSDsCounter, 0 mSdLazyCounter, 7024 mSolverCounterSat, 659 mSolverCounterUnsat, 81 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 179.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 2606 SdHoareTripleChecker+Invalid, 7764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 659 IncrementalHoareTripleChecker+Valid, 7024 IncrementalHoareTripleChecker+Invalid, 81 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 179.9s IncrementalHoareTripleChecker+Time [2023-11-23 08:11:37,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 2606 Invalid, 7764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [659 Valid, 7024 Invalid, 81 Unknown, 0 Unchecked, 179.9s Time] [2023-11-23 08:11:37,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2023-11-23 08:11:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 755. [2023-11-23 08:11:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 472 states have (on average 1.2161016949152543) internal successors, (574), 482 states have internal predecessors, (574), 216 states have call successors, (216), 64 states have call predecessors, (216), 66 states have return successors, (228), 208 states have call predecessors, (228), 211 states have call successors, (228) [2023-11-23 08:11:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1018 transitions. [2023-11-23 08:11:38,065 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1018 transitions. Word has length 95 [2023-11-23 08:11:38,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:11:38,065 INFO L495 AbstractCegarLoop]: Abstraction has 755 states and 1018 transitions. [2023-11-23 08:11:38,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 11 states have call successors, (27), 7 states have call predecessors, (27), 9 states have return successors, (26), 11 states have call predecessors, (26), 11 states have call successors, (26) [2023-11-23 08:11:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1018 transitions. [2023-11-23 08:11:38,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-23 08:11:38,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:38,070 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:11:38,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-23 08:11:38,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:11:38,312 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:38,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:38,313 INFO L85 PathProgramCache]: Analyzing trace with hash -3950870, now seen corresponding path program 1 times [2023-11-23 08:11:38,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:38,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144768064] [2023-11-23 08:11:38,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:38,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:38,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:38,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:38,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:38,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:11:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:39,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:11:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:39,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:39,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:11:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:39,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:11:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:39,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:11:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:39,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:11:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:39,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:11:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:39,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-23 08:11:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:39,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 08:11:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:39,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 08:11:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:39,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-23 08:11:39,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:39,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144768064] [2023-11-23 08:11:39,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144768064] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:11:39,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419505270] [2023-11-23 08:11:39,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:39,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:11:39,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:11:39,137 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:11:39,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 08:11:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:39,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 2674 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-23 08:11:39,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:11:39,657 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-23 08:11:39,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:11:39,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419505270] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:11:39,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:11:39,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 16 [2023-11-23 08:11:39,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245853940] [2023-11-23 08:11:39,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:11:39,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:11:39,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:11:39,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:11:39,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2023-11-23 08:11:39,659 INFO L87 Difference]: Start difference. First operand 755 states and 1018 transitions. Second operand has 9 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-23 08:11:40,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:11:40,107 INFO L93 Difference]: Finished difference Result 1476 states and 2000 transitions. [2023-11-23 08:11:40,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:11:40,108 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 112 [2023-11-23 08:11:40,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:11:40,112 INFO L225 Difference]: With dead ends: 1476 [2023-11-23 08:11:40,112 INFO L226 Difference]: Without dead ends: 775 [2023-11-23 08:11:40,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2023-11-23 08:11:40,115 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 13 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2133 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:11:40,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2133 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:11:40,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2023-11-23 08:11:40,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 763. [2023-11-23 08:11:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 478 states have (on average 1.213389121338912) internal successors, (580), 490 states have internal predecessors, (580), 216 states have call successors, (216), 64 states have call predecessors, (216), 68 states have return successors, (241), 208 states have call predecessors, (241), 211 states have call successors, (241) [2023-11-23 08:11:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1037 transitions. [2023-11-23 08:11:40,204 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1037 transitions. Word has length 112 [2023-11-23 08:11:40,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:11:40,205 INFO L495 AbstractCegarLoop]: Abstraction has 763 states and 1037 transitions. [2023-11-23 08:11:40,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-23 08:11:40,205 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1037 transitions. [2023-11-23 08:11:40,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 08:11:40,206 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:40,207 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:11:40,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 08:11:40,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 08:11:40,422 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:40,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:40,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1546655107, now seen corresponding path program 1 times [2023-11-23 08:11:40,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:40,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857270446] [2023-11-23 08:11:40,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:40,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:40,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:40,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:40,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:40,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:11:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:40,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:11:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:40,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:40,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:11:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:40,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:11:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:40,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:11:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:41,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 08:11:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:41,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-23 08:11:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:41,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-23 08:11:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:41,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 08:11:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:41,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:11:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:41,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-23 08:11:41,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:41,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857270446] [2023-11-23 08:11:41,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857270446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:11:41,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:11:41,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:11:41,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972645368] [2023-11-23 08:11:41,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:11:41,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:11:41,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:11:41,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:11:41,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:11:41,077 INFO L87 Difference]: Start difference. First operand 763 states and 1037 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 08:11:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:11:42,093 INFO L93 Difference]: Finished difference Result 1654 states and 2310 transitions. [2023-11-23 08:11:42,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:11:42,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2023-11-23 08:11:42,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:11:42,097 INFO L225 Difference]: With dead ends: 1654 [2023-11-23 08:11:42,098 INFO L226 Difference]: Without dead ends: 914 [2023-11-23 08:11:42,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:11:42,100 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 270 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 08:11:42,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 582 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 08:11:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2023-11-23 08:11:42,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 788. [2023-11-23 08:11:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 503 states have (on average 1.220675944333996) internal successors, (614), 515 states have internal predecessors, (614), 216 states have call successors, (216), 64 states have call predecessors, (216), 68 states have return successors, (241), 208 states have call predecessors, (241), 211 states have call successors, (241) [2023-11-23 08:11:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1071 transitions. [2023-11-23 08:11:42,158 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1071 transitions. Word has length 114 [2023-11-23 08:11:42,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:11:42,158 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1071 transitions. [2023-11-23 08:11:42,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 08:11:42,158 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1071 transitions. [2023-11-23 08:11:42,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 08:11:42,159 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:42,160 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:11:42,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 08:11:42,160 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:42,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:42,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1395132227, now seen corresponding path program 1 times [2023-11-23 08:11:42,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:42,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244323439] [2023-11-23 08:11:42,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:42,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:42,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:42,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:42,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:42,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:11:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:42,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:11:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:42,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:42,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:11:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:42,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:11:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:42,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:11:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:42,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 08:11:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:42,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-23 08:11:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:42,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-23 08:11:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:42,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 08:11:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:42,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:11:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:42,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:42,411 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-23 08:11:42,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:42,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244323439] [2023-11-23 08:11:42,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244323439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:11:42,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:11:42,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:11:42,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47712346] [2023-11-23 08:11:42,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:11:42,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:11:42,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:11:42,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:11:42,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:11:42,414 INFO L87 Difference]: Start difference. First operand 788 states and 1071 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 08:11:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:11:43,198 INFO L93 Difference]: Finished difference Result 1615 states and 2213 transitions. [2023-11-23 08:11:43,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:11:43,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2023-11-23 08:11:43,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:11:43,202 INFO L225 Difference]: With dead ends: 1615 [2023-11-23 08:11:43,202 INFO L226 Difference]: Without dead ends: 850 [2023-11-23 08:11:43,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:11:43,205 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 201 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 08:11:43,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 609 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 08:11:43,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2023-11-23 08:11:43,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 798. [2023-11-23 08:11:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 513 states have (on average 1.2163742690058479) internal successors, (624), 525 states have internal predecessors, (624), 216 states have call successors, (216), 64 states have call predecessors, (216), 68 states have return successors, (241), 208 states have call predecessors, (241), 211 states have call successors, (241) [2023-11-23 08:11:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1081 transitions. [2023-11-23 08:11:43,258 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1081 transitions. Word has length 114 [2023-11-23 08:11:43,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:11:43,259 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 1081 transitions. [2023-11-23 08:11:43,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 08:11:43,259 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1081 transitions. [2023-11-23 08:11:43,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 08:11:43,260 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:43,260 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:11:43,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 08:11:43,261 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:43,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:43,261 INFO L85 PathProgramCache]: Analyzing trace with hash -830574209, now seen corresponding path program 1 times [2023-11-23 08:11:43,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:43,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476975211] [2023-11-23 08:11:43,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:43,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:43,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:43,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:43,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:43,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:11:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:43,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:11:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:43,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:43,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:11:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:43,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:11:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:43,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:11:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:43,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 08:11:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:43,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-23 08:11:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:43,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-23 08:11:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:43,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 08:11:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:43,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:11:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:43,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-11-23 08:11:43,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476975211] [2023-11-23 08:11:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476975211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:11:43,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:11:43,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:11:43,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779508259] [2023-11-23 08:11:43,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:11:43,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:11:43,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:11:43,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:11:43,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:11:43,493 INFO L87 Difference]: Start difference. First operand 798 states and 1081 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 08:11:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:11:44,205 INFO L93 Difference]: Finished difference Result 1670 states and 2285 transitions. [2023-11-23 08:11:44,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:11:44,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2023-11-23 08:11:44,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:11:44,210 INFO L225 Difference]: With dead ends: 1670 [2023-11-23 08:11:44,210 INFO L226 Difference]: Without dead ends: 895 [2023-11-23 08:11:44,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:11:44,214 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 204 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 08:11:44,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 609 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 08:11:44,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2023-11-23 08:11:44,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 798. [2023-11-23 08:11:44,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 513 states have (on average 1.206627680311891) internal successors, (619), 525 states have internal predecessors, (619), 216 states have call successors, (216), 64 states have call predecessors, (216), 68 states have return successors, (241), 208 states have call predecessors, (241), 211 states have call successors, (241) [2023-11-23 08:11:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1076 transitions. [2023-11-23 08:11:44,276 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1076 transitions. Word has length 114 [2023-11-23 08:11:44,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:11:44,276 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 1076 transitions. [2023-11-23 08:11:44,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 08:11:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1076 transitions. [2023-11-23 08:11:44,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 08:11:44,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:44,278 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:11:44,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 08:11:44,278 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:44,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:44,279 INFO L85 PathProgramCache]: Analyzing trace with hash 45444797, now seen corresponding path program 1 times [2023-11-23 08:11:44,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:44,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88041624] [2023-11-23 08:11:44,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:44,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:44,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:44,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:44,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:44,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:11:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:44,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:11:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:44,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:44,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:11:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:44,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:11:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:44,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:11:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:44,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 08:11:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:44,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-23 08:11:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:44,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-23 08:11:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:44,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 08:11:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:44,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:11:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:44,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 08:11:44,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:44,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88041624] [2023-11-23 08:11:44,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88041624] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:11:44,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640758354] [2023-11-23 08:11:44,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:44,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:11:44,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:11:44,909 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:11:44,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 08:11:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:45,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 2671 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-23 08:11:45,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:11:45,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 08:11:45,487 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 08:11:45,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-23 08:11:45,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 08:11:45,902 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-23 08:11:45,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-23 08:11:47,964 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_25|) 8))) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_1|) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_25|) 0)) (not (= .cse0 0)) (not (= .cse0 |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_25|)) (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_25| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_1|)) (= .cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_1| 8)))))) is different from true [2023-11-23 08:11:48,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-23 08:11:48,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2023-11-23 08:11:50,124 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_2| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_26|) 8))) (and (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_26| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_2|)) (= .cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_2| 8))) (not (= .cse0 0)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_2|) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_26|) 0)) (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_26| .cse0))))) is different from true [2023-11-23 08:11:52,425 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_27| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_3| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_27|) 8))) (and (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_27| .cse0)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_27|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_3|)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_3| 8)) .cse0) (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_27| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_3|)) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_2| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_26|) 8))) (and (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_26| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_2|)) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_2| 8))) (not (= .cse1 0)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_2|) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_26|) 0)) (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_26| .cse1)))))) is different from true [2023-11-23 08:11:56,841 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7|) 8))) (and (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_4|)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_4| 8)) .cse0) (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7| .cse0)) (not (= 0 .cse0))))) is different from true [2023-11-23 08:12:01,700 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7|) 8))) (and (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_4|)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_4| 8)) .cse0) (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7| .cse0)) (not (= 0 .cse0))))) (exists ((|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_5| Int)) (let ((.cse2 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_29|) 0)) (.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_29|) 8))) (and (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_29| .cse1)) (not (= (mod .cse2 18446744073709551616) 0)) (not (= .cse1 0)) (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_29| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_5|)) (= .cse2 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_5|)) (= .cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_5|) (+ |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_5| 8))))))) is different from true [2023-11-23 08:12:03,948 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_6| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_30|) 8)) (.cse1 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_30|) 0))) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_6|) (+ |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_6| 8)) .cse0) (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_30| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_6|)) (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_30| .cse0)) (= .cse1 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_6|)) (not (= .cse0 0)) (not (= (mod .cse1 18446744073709551616) 0))))) (exists ((|v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7|) 8))) (and (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_4|)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_4| 8)) .cse2) (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7| .cse2)) (not (= 0 .cse2)))))) is different from true [2023-11-23 08:12:06,278 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_31| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_31|) 8)) (.cse1 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_31|) 0))) (and (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_31| .cse0)) (not (= (mod .cse1 18446744073709551616) 0)) (not (= .cse0 0)) (= .cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_7| 8))) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_7|) .cse1) (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_31| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_7|))))) (exists ((|v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7|) 8))) (and (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_4|)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_4| 8)) .cse2) (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7| .cse2)) (not (= 0 .cse2)))))) is different from true [2023-11-23 08:12:08,597 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_32| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse1 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_32|) 0)) (.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_32|) 8))) (and (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_32| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_8|)) (not (= .cse0 0)) (not (= .cse0 |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to~0#1.base_BEFORE_CALL_32|)) (not (= (mod .cse1 18446744073709551616) 0)) (= .cse1 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_8|)) (= .cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_8| 8)))))) (exists ((|v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7|) 8))) (and (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_4|)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_byte_buf_append_dynamic_harness_~#to_old~0#1.offset_BEFORE_CALL_4| 8)) .cse2) (not (= |v_ULTIMATE.start_aws_byte_buf_append_dynamic_~to#1.base_BEFORE_CALL_7| .cse2)) (not (= 0 .cse2)))))) is different from true Killed by 15